Carmichael Numbers on a Quantum Computer
classification
🪐 quant-ph
keywords
carmichaelquantumalgorithmgivennumbersasymptoticcomplexitycomposite
read the original 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.
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.