Primality Test Via Quantum Factorization
From MaRDI portal
Publication:4488254
DOI10.1142/S0129183197000138zbMath0941.11051arXivquant-ph/9508005MaRDI QIDQ4488254
No author found.
Publication date: 5 July 2000
Published in: International Journal of Modern Physics C (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/9508005
Cites Work
- On distinguishing prime numbers from composite numbers
- Riemann's hypothesis and tests for primality
- Fast multiplication of large numbers
- Quantum computational networks
- Quantum theory, the Church–Turing principle and the universal quantum computer
- A New Proof of the Quantum Noiseless Coding Theorem
- Quantum cryptography using any two nonorthogonal states
- Realizable Universal Quantum Logic Gates
- A universal two-bit gate for quantum computation
- Logical Reversibility of Computation