Primality Test Via Quantum Factorization
From MaRDI portal
Abstract: We consider a probabilistic quantum implementation of a variable of the Pocklington-Lehmer primality test using Shor's algorithm. O() elementary q-bit operations are required to determine the primality of a number , making it (asymptotically) the fastest known primality test. Thus, the potential power of quantum mechanical computers is once again revealed.
Recommendations
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING
- Factorization of integers
- scientific article; zbMATH DE number 579167
Cites work
- A New Proof of the Quantum Noiseless Coding Theorem
- A universal two-bit gate for quantum computation
- Fast multiplication of large numbers
- Logical Reversibility of Computation
- On distinguishing prime numbers from composite numbers
- Quantum computational networks
- Quantum cryptography using any two nonorthogonal states
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Realizable Universal Quantum Logic Gates
- Riemann's hypothesis and tests for primality
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)