Polynomial Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.pdf

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer∗ 6 9 Peter W. Shor† 9 1 n a Abstract J A digital computer is generally believed to be an efficient universal computing 5 2 device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be 2 true when quantum mechanics is taken into consideration. This paper considers v factoring integers and finding discrete logarithms, two problems which are generally 7 thought to be hard on a classical computer and which have been used as the basis 2 of several proposed cryptosystems. Efficient randomized algorithms are given for 0 these two problems on a hypothetical quantum computer. These algorithms take 8 a number of steps polynomial in the input size, e.g., the number of digits of the 0 integer to be factored. 5 9 / h Keywords: algorithmic number theory, prime factorization, discrete logarithms, p Church’s thesis, quantum computers, foundations of quantum mechanics, spin systems, t- Fourier transforms n a AMS subject classifications: 81P10, 11Y05, 68Q10, 03D10 u q : v i X r a ∗A preliminary version of this paper appeared in the Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, Nov. 20–22, 1994, IEEE Computer Society Press, pp. 124–