An efficient quantum algorithm for the Moebius function
Quantum Physics
2016-03-22 v2
Abstract
We give an efficient quantum algorithm for the Moebius function from the natural numbers to . The cost of the algorithm is asymptotically quadratic in and does not require the computation of the prime factorization of as an intermediate step.
Cite
@article{arxiv.1412.3817,
title = {An efficient quantum algorithm for the Moebius function},
author = {Peter J. Love},
journal= {arXiv preprint arXiv:1412.3817},
year = {2016}
}
Comments
On further consideration it appears that the algorithm as described here has an exponentially small probability of success