Carmichael Numbers on a Quantum Computer
Quantum Physics
2009-09-25 v1
Abstract
We present a quantum probabilistic algorithm which tests with a polynomial computational complexity whether a given composite number is of the Carmichael type. We also suggest a quantum algorithm which could verify a conjecture by Pomerance, Selfridge and Wagstaff concerning the asymptotic distribution of Carmichael numbers smaller than a given integer.
Cite
@article{arxiv.quant-ph/9908022,
title = {Carmichael Numbers on a Quantum Computer},
author = {A. Carlini and A. Hosoya},
journal= {arXiv preprint arXiv:quant-ph/9908022},
year = {2009}
}
Comments
7 pages, Latex/REVTEX file