An efficient quantum algorithm for the Moebius function

Abstract

We give an efficient quantum algorithm for the Moebius function $\mu (n)$ from the natural numbers to $\{-1,0,1\}$. The cost of the algorithm is asymptotically quadratic in $\log n$ and does not require the computation of the prime factorization of $n$ as an intermediate step.

On further consideration it appears that the algorithm as described here has an exponentially small probability of success

Cited by in corpus (1)

• Universal measurement-based quantum computation in two-dimensional SPT phases