Abstract

A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a increase in computation time of at most a polynomial factor. It is not clear whether this is still true when quantum mechanics is taken into consideration. Several researchers, starting with David Deutsch, have developed models for quantum mechanical computers and have investigated their computational properties. This paper gives Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored. These two problems are generally considered hard on a classical computer and have been used as the basis of several proposed cryptosystems. (We thus give the first examples of quantum cryptanalysis.) 1 Introduction Since the discovery of quantum mechanics, people have found the behavior of...

Citations

2507	A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al.
583	Quantum theory, the Church–Turing principle and the universal quantum computer - Deutsch - 1985
447	Quantum complexity theory - Bernstein, Vazirani - 1993
377	Logical reversibility of computation - Bennett - 1973
330	Simulating physics with computers - Feynman - 1982
267	circuit complexity - Yao - 1993
226	Quantum computational networks - Deutsch - 1989
133	An introduction to the theory of numbers fifth edition - Hardy, Wright - 1979
70	Quantum mechanical Hamiltonian models of Turing machines that dissipate no energy - Benioff - 1980
49	The quantum challenge to structural complexity theory - Berthiaume, Brassard - 1992
7	Rapid Solution of Problems by Quantum - Deutsch, Jozsa - 1992
2	personal communication - Vazirani - 1992
1	On the Power of Quantum Computation, manuscript - Simon