Primality Test Via Quantum Factorization

Details Primality Test Via Quantum Factorization Primality Test Via Quantum Factorization

1995-08-05

arxiv.org/abs/quant-ph/9508005v3

Physics

Quantum Physics

Using REVTEX 3.0, AMS fonts required. Typos corrected. To appear in Int.J.Mod.Phys.C

Scientific paper

We consider a probabilistic quantum implementation of a variable of the Pocklington-Lehmer $N-1$ primality test using Shor's algorithm. O($\log^3 N \log\log N \log\log\log N$) elementary q-bit operations are required to determine the primality of a number $N$, making it (asymptotically) the fastest known primality test. Thus, the potential power of quantum mechanical computers is once again revealed.

Affiliated with

Also associated with

No associations

Rating

Primality Test Via Quantum Factorization 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 Primality Test Via Quantum Factorization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Primality Test Via Quantum Factorization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-348537