Carmichael Numbers on a Quantum Computer

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-549670

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.