Primality Test Via Quantum Factorization

From MaRDI portal



Abstract: We consider a probabilistic quantum implementation of a variable of the Pocklington-Lehmer N−1 primality test using Shor's algorithm. O(log3NloglogNlogloglogN) 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.












This page was built for publication: Primality Test Via Quantum Factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4488254)