Physics – Quantum Physics
Scientific paper
1999-08-05
Physics
Quantum Physics
7 pages, Latex/REVTEX file
Scientific paper
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.
Carlini Alberto
Hosoya Akio
No associations
LandOfFree
Carmichael Numbers on a Quantum Computer does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Carmichael Numbers on a Quantum Computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Carmichael Numbers on a Quantum Computer will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-549670