Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 41 (2), 303-332
- https://doi.org/10.1137/s0036144598347011
Abstract
No abstract availableOther Versions
This publication has 69 references indexed in Scilit:
- Strengths and Weaknesses of Quantum ComputingSIAM Journal on Computing, 1997
- Simulation of Many-Body Fermi Systems on a Universal Quantum ComputerPhysical Review Letters, 1997
- Efficient networks for quantum factoringPhysical Review A, 1996
- Elementary gates for quantum computationPhysical Review A, 1995
- Conditional Quantum Dynamics and Logic GatesPhysical Review Letters, 1995
- Time/Space Trade-Offs for Reversible ComputationSIAM Journal on Computing, 1989
- Quantum mechanical hamiltonian models of turing machinesJournal of Statistical Physics, 1982
- Quantum Mechanical Models of Turing Machines That Dissipate No EnergyPhysical Review Letters, 1982
- The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machinesJournal of Statistical Physics, 1980
- Logical Reversibility of ComputationIBM Journal of Research and Development, 1973