Primality Test Via Quantum Factorization

H. F. Chau; H. -K. Lo

Primality Test Via Quantum Factorization

Quantum Physics 2016-09-08 v3

Authors: H. F. Chau , H. -K. Lo

Abstract

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.

Keywords

quantum search algorithms

Cite

@article{arxiv.quant-ph/9508005,
  title  = {Primality Test Via Quantum Factorization},
  author = {H. F. Chau and H. -K. Lo},
  journal= {arXiv preprint arXiv:quant-ph/9508005},
  year   = {2016}
}

Comments

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

Related papers

View all related →