Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer

SIAM Journal on Computing

Volumn 26, Issue 5, 1997, Pages 1484-1509

  Shor, Peter W ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Algorithmic number theory; Church's thesis; Discrete logarithms; Foundations of quantum mechanics; Fourier transforms; Prime factorization; Quantum computers; Spin systems

Indexed keywords

EID: 0142051871     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795293172     Document Type: Article

References (83)

1. L. M. ADLEMAN (1994), Algorithmic number theory - The complexity contribution, in Proc. 35th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, pp. 88-113.
2. L. M. ADLEMAN AND K. S. MCCURLEY (1994), Open problems in number-theoretic complexity II, in Algorithmic Number Theory, Proc. 1994 Algorithmic Number Theory Symposium, Ithaca, NY, Lecture Notes in Computer Science 877, L. M. Adleman and M.-D. Huang, eds., Springer-Verlag, Berlin, pp. 291-322.
3. A. BARENCO, C. H. BENNETT, R. CLEVE, D. P. DIVINCENZO, N. MARGOLUS, P. SHOR, T. SLEATOR, J. A. SMOLIN, AND H. WEINFURTER (1995a), Elementary gates for quantum computation, Phys. Rev. A, 52, pp. 3457-3467.
4. A. BARENCO, D. DEUTSCH, A. EKERT, AND R. JOZSA (1995b), Conditional quantum dynamics and logic gates, Phys. Rev. Lett., 74, pp. 4083-4086.
5. D. BECKMAN, A. N. CHARI, S. DEVABHAKTUNI, AND J. PRESKILL (1996), Efficient networks for quantum factoring, Phys. Rev. A, 54, pp. 1034-1063.
6. P. BENIOFF (1980), The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines, J. Statist. Phys., 22, pp. 563-591.
7. P. BENIOFF (1982a), Quantum mechanical Hamiltonian models of Turing machines, J. Statist. Phys., 29, pp. 515-546.
8. P. BENIOFF (1982b), Quantum mechanical Hamiltonian models of Turing machines that dissipate no energy, Phys. Rev. Lett., 48, pp. 1581-1585.
9. C. H. BENNETT (1973), Logical reversibility of computation, IBM J. Res. Develop., 17, pp. 525-532.
10. C. H. BENNETT (1989), Time/space trade-offs for reversible computation, SIAM J. Comput., 18, pp. 766-776.
11. C. H. BENNETT, E. BERNSTEIN, G. BRASSARD, AND U. VAZIRANI (1997), Strengths and weaknesses of quantum computing, SIAM J. Comput., 26, pp. 1510-1523.
12. C. H. BENNETT, G. BRASSARD, S. POPESCU, B. SCHUMACHER, J. A. SMOLIN, AND W. K. WOOTERS (1996), Purification of noisy entanglement and faithful teleportation via noisy channels, Phys. Rev. Lett., 76, pp. 722-725.
13. E. BERNSTEIN AND U. VAZIRANI (1993), Quantum complexity theory, in Proc. 25th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, pp. 11-20; SIAM J. Comput., 26 (1997), pp. 1411-1473.
14. E. BERNSTEIN AND U. VAZIRANI (1993), Quantum complexity theory, in Proc. 25th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, pp. 11-20; SIAM J. Comput., 26 (1997), pp. 1411-1473.
15. A. BERTHIAUME AND G. BRASSARD (1992), The quantum challenge to structural complexity theory, in Proc. 7th Annual Structure in Complexity Theory Conference, IEEE Computer Society Press, Los Alamitos, CA, pp. 132-137.
16. A. BERTHIAUME AND G. BRASSARD (1994), Oracle quantum computing, J. Modern Opt., 41, pp. 2521-2535.
17. A. BERTHIAUME, D. DEUTSCH, AND R. JOZSA (1994), The stabilisation of quantum computations, in Proc. Workshop on Physics of Computation: PhysComp '94, IEEE Computer Society Press, Los Alamitos, CA, pp. 60-62.
18. M. BIAFORE (1994), Can quantum computers have simple Hamiltonians, in Proc. Workshop on Physics of Computation: PhysComp '94, IEEE Computer Society Press, Los Alamitos, CA, pp. 63-68.
19. D. BONEH AND R. J. LIPTON (1995), Quantum cryptanalysis of hidden linear functions, Advances in Cryptology - CRYPTO '95, Proc. 15th Annual International Cryptology Conference, Santa Barbara, CA, D. Coppersmith, ed. Springer-Verlag, Berlin, pp. 424-437.
20. J. F. CANNY AND J. REIF (1987), New lower bound techniques for robot motion planning problems, in Proc. 28th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, pp. 49-60.
21. J. CHOI, J. SELLEN, AND C.-K. YAP (1995), Precision-sensitive Euclidean shortest path in 3-space, in Proc. 11th Annual Symposium on Computational Geometry, Association for Computing Machinery, New York, pp. 350-359.
22. I. L. CHUANG, R. LAFLAMME, P. W. SHOR, AND W. H. ZUREK (1995), Quantum computers, factoring and decoherence, Science, 270, pp. 1633-1635.
23. I. L. CHUANG AND Y. YAMAMOTO (1995), A simple quantum computer, Phys. Rev. A, 52, pp. 3489-3496.
24. A. CHURCH (1936), An unsolvable problem of elementary number theory, Amer. J. Math., 58, pp. 345-363.
25. J. I. CIRAC AND P. ZOLLER (1995), Quantum computations with cold trapped ions, Phys. Rev. Lett., 74, pp. 4091-4094.
26. R. CLEVE (1994), A note on computing Fourier transforms by quantum programs, preprint.
27. D. COPPERSMITH (1994), An Approximate Fourier Transform Useful in Quantum Factoring, IBM Research Report RC 19642.
28. D. DEUTSCH (1985), Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. Roy. Soc. London Ser. A, 400, pp. 96-117.
29. D. DEUTSCH (1989), Quantum computational networks, Proc. Roy. Soc. London Ser. A, 425, pp. 73-90.
30. D. DEUTSCH, A. BARENCO, AND A. EKERT (1995), Universality of quantum computation, Proc. Roy. Soc. London Ser. A, 449, pp. 669-677.
31. D. DEUTSCH AND R. JOZSA (1992), Rapid solution of problems by quantum computation, Proc. Roy. Soc. London Ser. A, 439, pp. 553-558.
32. D. P. DIVINCENZO (1995), Two-bit gates are universal for quantum computation, Phys. Rev. A, 51, pp. 1015-1022.
33. A. EKERT AND R. JOZSA (1996), Shor's quantum algorithm for factorising numbers, Rev. Mod. Phys., 68, pp. 733-753.
34. R. FEYNMAN (1982), Simulating physics with computers, Internat. J. Theoret. Phys., 21, pp. 467-488.
35. R. FEYNMAN (1986), Quantum mechanical computers, Found. Phys., 16, pp. 507-531; originally published in Optics News (February 1985), pp. 11-20.
36. R. FEYNMAN (1986), Quantum mechanical computers, Found. Phys., 16, pp. 507-531; originally published in Optics News (February 1985), pp. 11-20.
37. E. FREDKIN AND T. TOFFOLI (1982), Conservative logic, Internat. J. Theoret. Phys., 21, pp. 219-253.
38. D. M. GORDON (1993), Discrete logarithms in GF(p) using the number field sieve, SIAM J. Discrete Math., 6, pp. 124-139.
39. R. B. GRIFFITHS AND C.-S. NIU (1996), Semiclassical Fourier tranform for quantum computation, Phys. Rev. Lett., 76, pp. 3228-3231.
40. G. H. HARDY AND E. M. WRIGHT (1979), An Introduction to the Theory of Numbers, 5th ed., Oxford University Press, New York.
41. J. HARTMANIS AND J. SIMON (1974), On the power of multiplication in random access machines, in Proc. 15th Annual Symposium on Switching and Automata Theory, IEEE Computer Society, Long Beach, CA, pp. 13-23.
42. A. KARATSUBA AND YU. OFMAN (1962), Multiplication of multidigit numbers on automata, Dokl. Akad. Nauk SSSR, 145, pp. 293-294 (in Russian); Sov. Phys. Dokl., 7 (1963), pp. 595-596 (English translation).
43. A. KARATSUBA AND YU. OFMAN (1962), Multiplication of multidigit numbers on automata, Dokl. Akad. Nauk SSSR, 145, pp. 293-294 (in Russian); Sov. Phys. Dokl., 7 (1963), pp. 595-596 (English translation).
44. E. KNILL (1995), personal communication.
45. D. E. KNUTH (1981), The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, MA.
46. R. LANDAUER (1995), Is quantum mechanics useful? Philos. Trans. Roy. Soc. London Ser. A, 353, pp. 367-376.
47. R. LANDAUER (1997), Is quantum mechanically coherent computation useful?, in Proc. Drexel-4 Symposium on Quantum Nonintegrability - Quantum Classical Correspondence, D. H. Feng and B-L. Hu, eds., International Press, Cambridge, MA, to appear.
48. nu, où θ est un isomorphisme de codes, C. R. Acad. Française Sci., 257, pp. 2597-2600.
49. A. K. LENSTRA AND H. W. LENSTRA, JR., EDS. (1993), The Development of the Number Field Sieve, Lecture Notes in Mathematics 1554, Springer-Verlag, Berlin.
50. A. K. LENSTRA, H. W. LENSTRA, JR., M. S. MANASSE, AND J. M. POLLARD (1990), The number field sieve, in Proc. 22nd Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, pp. 564-572; expanded version appears in Lenstra and Lenstra, Jr. [1993], pp. 11-42.
51. A. K. LENSTRA, H. W. LENSTRA, JR., M. S. MANASSE, AND J. M. POLLARD (1990), The number field sieve, in Proc. 22nd Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, pp. 564-572; expanded version appears in Lenstra and Lenstra, Jr. [1993], pp. 11-42.
52. R. Y. LEVINE AND A. T. SHERMAN (1990), A note on Bennett's time-space tradeoff for reversible computation, SIAM J. Comput., 19, pp. 673-677.
53. S. LLOYD (1993), A potentially realizable quantum computer, Science, 261, pp. 1569-1571.
54. S. LLOYD (1994), Envisioning a quantum supercomputer, Science, 263, p. 695.
55. S. LLOYD (1995), Almost any quantum logic gate is universal, Phys. Rev. Lett., 75, pp. 346-349.
56. N. MARGOLUS (1986), Quantum computation, Ann. New York Acad. Sci., 480, pp. 487-497.
57. N. MARGOLUS (1990), Parallel quantum computation, in Complexity, Entropy and the Physics of Information, Santa Fe Institute Studies in the Sciences of Complexity, Vol. VIII, W. H. Zurek, ed., Addison-Wesley, Reading, MA, pp. 273-287.
58. G. L. MILLER (1976), Riemann's hypothesis and tests for primality, J. Comput. System Sci., 13, pp. 300-317.
59. A. M. ODLYZKO (1995), personal communication.
60. G. M. PALMA, K.-A. SUOMINEN, AND A. K. EKERT (1996), Quantum computers and dissipation, Proc. Roy. Soc. London Ser. A, 452, pp. 567-584.
61. A. PERES (1993), Quantum Theory: Concepts and Methods, Kluwer Academic Publishers, Dordrecht, The Netherlands.
62. C. POMERANCE (1987), Fast, rigorous factorization and discrete logarithm algorithms, in Discrete Algorithms and Complexity, Proc. Japan-US Joint Seminar, 1986, Kyoto, D. S. Johnson, T. Nishizeki, A. Nozaki, and H. S. Wilf, eds., Academic Press, New York, pp. 119-143.
63. E. POST (1936), Finite combinatory processes. Formulation I, J. Symbolic Logic, 1, pp. 103-105.
64. R. L. RIVEST, A. SHAMIR, AND L. ADLEMAN (1978), A method of obtaining digital signatures and public-key cryptosystems, Comm. Assoc. Comput. Mach., 21, pp. 120-126.
65. L. A. RUBEL (1989), Digital simulation of analog computation and Church's thesis, J. Symbolic Logic, 54, pp. 1011-1017.
66. A. SCHÖNHAGE (1982), Asymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coefficients, in Computer Algebra EUROCAM '82, Lecture Notes in Computer Science 144, J. Calmet, ed., Springer-Verlag, Berlin, pp. 3-15.
67. A. SCHÖNHAGE, A. F. W. GROTEFELD, AND E. VETTER (1994), Fast Algorithms: A Multitape Turing Machine Implementation, B. I. Wissenschaftsverlag, Mannheim, Germany.
68. A. SCHÖNHAGE AND V. STRASSEN (1971), Schnelle Multiplikation grosser Zahlen, Computing, 7, pp. 281-292.
69. P. W. SHOR (1994), Algorithms for quantum computation: Discrete logarithms and factoring, in Proc. 35th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, pp. 124-134.
70. P. W. SHOR (1995), Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A, 52, pp. 2493-2496.
71. D. SIMON (1994), On the power of quantum computation, in Proc. 35th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, pp. 116-123; SIAM J. Comput., 26 (1997), pp. 1474-1483.
72. D. SIMON (1994), On the power of quantum computation, in Proc. 35th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, pp. 116-123; SIAM J. Comput., 26 (1997), pp. 1474-1483.
73. T. SLEATOR AND H. WEINFURTER (1995), Realizable universal quantum logic gates, Phys. Rev. Lett., 74, pp. 4087-4090.
74. R. SOLOVAY (1995), personal communication.
75. K. STEIGLITZ (1988), Two non-standard paradigms for computation: Analog machines and cellular automata, in Performance Limits in Communication Theory and Practice, Proc. NATO Advanced Study Institute, Il Ciocco, Castelvecchio Pascoli, Tuscany, Italy, 1986, J. K. Skwirzynski, ed., Kluwer Academic Publishers, Dordrecht, The Netherlands, pp. 173-192.
76. W. G. TEICH, K. OBERMAYER, AND G. MAHLER (1988), Structural basis of multistationary quantum systems II: Effective few-particle dynamics, Phys. Rev. B, 37, pp. 8111-8121.
77. T. TOFFOLI (1980), Reversible computing, in Automata, Languages and Programming, 7th Colloquium, Lecture Notes in Computer Science 84, J. W. de Bakker and J. van Leeuwen, eds., Springer-Verlag, Berlin, pp. 632-644.
78. A. M. TURING (1936), On computable numbers, with an application to the Entscheidungsproblem, in Proc. London Math. Soc. (2), 42, pp. 230-265; corrections in Proc. London Math. Soc. (2), 43 (1937), pp. 544-546.
79. A. M. TURING (1936), On computable numbers, with an application to the Entscheidungsproblem, in Proc. London Math. Soc. (2), 42, pp. 230-265; corrections in Proc. London Math. Soc. (2), 43 (1937), pp. 544-546.
80. W. G. UNRUH (1995), Maintaining coherence in quantum computers, Phys. Rev. A, 51, pp. 992-997.
81. P. VAN EMDE BOAS (1990), Machine models and simulations, in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, ed., Elsevier, Amsterdam, pp. 1-66.
82. A. VERGIS, K. STEIGLITZ, AND B. DICKINSON (1986), The complexity of analog computation, Math. Comput. Simulation, 28, pp. 91-113.
83. A. YAO (1993), Quantum circuit complexity, in Proc. 34th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, pp. 352-361.