An efficient quantum algorithm for the Moebius function
classification
🪐 quant-ph
keywords
algorithmefficientfunctionmoebiusquantumasymptoticallycomputationcost
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.