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

SIAM Review

Volumn 41, Issue 2, 1999, Pages 303-332

  Shor, Peter W ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DIGITAL COMPUTERS; FOURIER TRANSFORMS; NUMBER THEORY; POLYNOMIALS; QUANTUM THEORY; RANDOM PROCESSES;

CHURCH THESIS; DISCRETE LOGARITHMS; POLYNOMIAL TIME ALGORITHMS; PRIME FACTORIZATION; QUANTUM COMPUTERS; SPIN SYSTEMS;

ALGORITHMS;

EID: 0032628303     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036144598347011     Document Type: Article

References (116)

1. D. S. ABRAMS AND S. LLOYD (1997), Simulation of many-body Fermi systems on a universal quantum computer, Phys. Rev. Lett., 79, pp. 2586-2589.
2. 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.
3. L. M. ADLEMAN AND K. S. MCCURLEY (1994), Open problems m number-theoretic complexity II, in Algorithmic Number Theory, Proc. 1994 Algorithmic Number Theory Symposium, Ithaca, NY, Lecture Notes in Comput. Sci. 877, L. M. Adleman and M.-D. Huang, eds., Springer-Verlag, Berlin, pp. 291-322.
4. D. AHARONOV AND M. BEN-OR (1997), Fault tolerant quantum computation with constant error in Proc. 29th Annual ACM Symposium on Theory of Computing, ACM, New York, pp. 176-188.
5. 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.
6. A. BARENCO, D. DEUTSCH, A. EKERT, AND R. JOZSA (1995b), Conditional quantum dynamics and logic gates, Phys. Rev. Lett., 74, pp. 4083-4086.
7. D. BECKMAN, A. N. CHARI, S. DEVABHAKTUNI, AND J. PRESKILL (1996), Efficient networks for quantum factoring, Phys. Rev. A, 54, pp. 1034-1063.
8. 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.
9. P. BENIOFF (1982a), Quantum mechanical Hamiltonian models of Turing machines, J. Statist. Phys., 29, pp. 515-546.
10. P. BENIOFF (1982b), Quantum mechanical Hamiltonian models of Turing machines that dissipate no energy, Phys. Rev. Lett., 48, pp. 1581-1585.
11. C. H. BENNETT (1973), Logical reversibility of computation, IBM J. Res. Develop., 17, pp. 525-532.
12. C. H. BENNETT (1989), Time/space trade-offs for reversible computation, SIAM J. Comput., 18, pp. 766-776.
13. C. H. BENNETT, E. BERNSTEIN, G. BRASSARD, AND U. VAZIRANI (1997), Strengths and weaknesses of quantum computing, SIAM J. Comput., 26, pp. 1510-1523.
14. C. H. BENNETT AND G. BRASSARD (1984), Quantum cryptography: Public key distribution and coin tossing, in Proc. IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India, pp. 175-179.
15. C. H. BENNETT, G. BRASSARD, C. CRÉPEAU, R. JOZSA, A. PERES, AND W. K. WOOTTERS (1993), Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels Phys. Rev. Lett., 70, pp. 1895-1898.
16. 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.
17. C. H. BENNETT AND P. W. SHOR (1998), Quantum information theory, IEEE Trans. Inform. Theory, 44, pp. 2724-2742
18. E. BERNSTEIN AND U. VAZIRANI (1993), Quantum complexity theory, in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM, New York, pp. 11-20; SIAM J. Comput., 26 (1997), pp. 1411-1473.
19. E. BERNSTEIN AND U. VAZIRANI (1993), Quantum complexity theory, in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM, New York, pp. 11-20; SIAM J. Comput., 26 (1997), pp. 1411-1473.
20. 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.
21. A. BERTHIAUME AND G. BRASSARD (1994), Oracle quantum, computing, J. Modern Opt., 41, pp. 2521-2535.
22. 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.
23. 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.
24. 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.
25. G. BRASSARD (1993), Quantum cryptography: A bibliography, SIGACT News, 24:3, pp. 16-20; more recent version is available online from: http://www.iro.umontreal.ca/∼crepeau/Biblio-QC.html.
26. H. BUHRMAN, R. CLEVE, AND A. WIGDERSON (1998), Quantum vs. classical communication and computation, in Proc. 30th Annual ACM Symposium on Theory of Computing, ACM Press, New York, pp. 63-69.
27. A. R. CALDERBANK, E. M. RAINS, P. W. SHOR, AND N. J. A. SLOANE (1997), Quantum error correction via orthogonal geometry, Phys. Rev. Lett., 78, pp. 405-408.
28. A. R. CALDERBANK, E. M. RAINS, P. W. SHOR, AND N. J. A. SLOANE (1998), Quantum error correction via codes over GF(4), IEEE Trans. Inform. Theory, 44, pp. 1369-1387.
29. A. R. CALDERBANK AND P. W. SHOR (1996), Good quantum error-correcting codes exist, Phys. Rev. A, 54, pp. 1098-1106.
30. 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.
31. 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, ACM, New York, pp. 350-359.
32. I. L. CHUANG, R. LAFLAMME, P. W. SHOR, AND W. H. ZUREK (1995), Quantum computers, factoring and decoherence, Science, 270, pp. 1633-1635.
33. I. L. CHUANG AND Y. YAMAMOTO (1995), A simple quantum computer, Phys. Rev. A, 52, pp. 3489-3496.
34. A. CHURCH (1936), An unsolvable problem of elementary number theory, Amer. J. Math., 58, pp. 345-363.
35. J. I. CIRAC AND P. ZOLLER (1995), Quantum computations with cold trapped ions, Phys. Rev. Lett., 74, pp. 4091-4094.
36. R. CLEVE (1994), A Note on Computing Fourier Transforms by Quantum Programs, preprint.
37. R. CLEVE AND H. BUHRMAN (1997), Substituting quantum entanglement for communication, Phys. Rev. A, 56, pp. 1201-1204.
38. D. COPPERSMITH (1994), An Approximate Fourier Transform Useful in Quantum Factoring, IBM Research Report RC 19642, T. J. Watson Laboratory, Yorktown Heights, NY.
39. D. G. CORY, A. F. FAHMY, AND T. F. HAVEL (1997), Ensemble quantum computing by nuclear magnetic resonance spectroscopy, Proc. Nat. Acad. Sci., 94, pp. 1634-1639.
40. D. DEUTSCH (1985), Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. Roy. Soc. London Ser. A, 400, pp. 96-117.
41. D. DEUTSCH (1989), Quantum computational networks, Proc. Roy. Soc. London Ser. A, 425, pp. 73-90.
42. D. DEUTSCH, A. BARENCO, AND A. EKERT (1995), Universality of quantum computation, Proc. Roy. Soc. London Ser. A, 449, pp. 669-677.
43. D. DEUTSCH AND R. JOZSA (1992), Rapid solution of problems by quantum computation, Proc. Roy. Soc. London Ser. A, 439, pp. 553-558.
44. D. P. DIVINCENZO (1995), Two-bit gates are universal for quantum computation, Phys. Rev. A, 51, pp. 1015-1022.
45. A. EKERT AND R. JOZSA (1996), Shor's quantum algorithm for factorising numbers, Rev. Mod. Phys., 68, pp. 733-753.
46. A. EKERT AND C. MACCHIAVELLO (1996), Error correction in quantum communication, Phys. Rev. Lett., 77, pp. 2585-2588.
47. R. FEYNMAN (1982), Simulating physics with computers, Internat. J. Theoret. Phys., 21, pp. 467-488.
48. R. FEYNMAN (1986), Quantum mechanical computers, Found. Phys., 16, pp. 507-531; originally published in Optics News, February 1985, pp. 11-20.
49. R. FEYNMAN (1986), Quantum mechanical computers, Found. Phys., 16, pp. 507-531; originally published in Optics News, February 1985, pp. 11-20.
50. E. FREDKIN AND T. TOFFOLI (1982), Conservative logic, Internat. J. Theoret. Phys., 21, pp. 219-253.
51. N. A. GERSHENFELD AND I. L. CHUANG (1997), Bulk spin resonance quantum computation, Science, 275, pp. 350-356.
52. D. M. GORDON (1993), Discrete logarithms in GF(p) using the number field sieve, SIAM J. Discrete Math., 6, pp. 124-138.
53. D. GOTTESMAN (1996), A class of quantum error-correcting codes saturating the quantum Hamming bound, Phys. Rev. A, 54, pp. 1862-1868.
54. R. B. GRIFFITHS AND C.-S. NIU (1996), Semiclassical Fourier transform for quantum computation, Phys. Rev. Lett., 76, pp. 3228-3231.
55. L. K. GROVER (1997), Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett., 78, pp. 325-328.
56. L. K. GROVER (1998), A framework for fast quantum mechanical algorithms, in Proc. 30th Annual ACM Symposium on Theory of Computing, ACM Press, New York, pp. 53-62.
57. G. H. HARDY AND E. M. WRIGHT (1979), An Introduction to the Theory of Numbers, 5th ed., Oxford University Press, New York.
58. 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.
59. B. E. KANE (1998), A silicon-based nuclear spin quantum computer, Nature, 393, pp. 133-137.
60. 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).
61. 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).
62. A. KITAEV (1997), Quantum computations: Algorithms and error correction, Uspekhi Mat. Nauk 52, pp. 53-112 (in Russian). English translation in Russian Math. Surveys 52, pp. 1191-1249.
63. A. KITAEV (1997), Quantum computations: Algorithms and error correction, Uspekhi Mat. Nauk 52, pp. 53-112 (in Russian). English translation in Russian Math. Surveys 52, pp. 1191-1249.
64. E. KNILL (1995), personal communication.
65. E. KNILL AND R. LAFLAMME (1997), A theory of quantum error-correcting codes, Phys. Rev. A, 55, pp. 900-911.
66. E. KNILL, R. LAFLAMME, AND W. H. ZUREK (1998), Resiliant quantum computation, Science, 279, pp. 342-345.
67. D. E. KNUTH (1981), The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, MA.
68. R. LANDAUER (1995), Is quantum mechanics useful?, Philos. Trans. Roy. Soc. London Ser. A, 353, pp. 367-376.
69. 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.
70. nu, où θ est un isomorphisms de codes, C. R. Acad. Française Sci., 257, pp. 2597-2600.
71. A. K. LENSTRA AND H. W. LENSTRA, JR., EDS. (1993), The Development of the Number Field Sieve, Lecture Notes in Math. 1554, Springer-Verlag, Berlin.
72. 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, ACM, New York, pp. 564-572; expanded version appears in Lenstra and Lenstra [1993, pp. 11-42].
73. 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, ACM, New York, pp. 564-572; expanded version appears in Lenstra and Lenstra [1993, pp. 11-42].
74. 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.
75. S. LLOYD (1993), A potentially realizable quantum computer, Science, 261, pp. 1569-1571.
76. S. LLOYD (1994), Envisioning a quantum supercomputer, Science, 263, p. 695.
77. S. LLOYD (1995), Almost any quantum logic gate is universal, Phys. Rev. Lett., 75, pp. 346-349.
78. S. LLOYD (1996), Universal quantum simulators, Science, 273, pp. 1073-1078.
79. N. MARGOLUS (1986), Quantum computation, Ann. New York Acad. Sci., 480, pp. 487-497.
80. N. MARGOLUS (1990), Parallel quantum computation, in Complexity, Entropy and the Physics of Information, Santa Fe Institute Studies in the Sciences of Complexity VIII, W. H. Zurek, ed., Addison-Wesley, Reading, MA, pp. 273-287.
81. D. MAYERS (1998), Unconditional Security m Quantum Cryptography, manuscript, LANL e-print quant-ph/9802025.
82. D. MAYERS AND A. C.-C. YAO (1998), Quantum cryptography with imperfect apparatus, in Proc. 39th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, pp. 503-509.
83. G. L. MILLER (1976), Riemann's hypothesis and tests for primality, J. Comput. System Sci., 13, pp. 300-317.
84. A. M. ODLYZKO (1995), personal communication.
85. 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.
86. A. PERES (1993), Quantum Theory: Concepts and Methods, Kluwer Academic Publishers, Dordrecht, The Netherlands.
87. 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.
88. E. POST (1936), Finite combinatory processes. Formulation I, J. Symbolic Logic, 1, pp. 103-105.
89. J. PRESKILL (1998), Lecture notes for Physics 229, California Institute of Technology, available online at http://www.theory.caltech.edu/people/preskill/ph229/.
90. J. PRESKILL (1999). Fault-tolerant quantum computation, in Introduction to Quantum Computation, H.-K. Lo, S. Popescu, and T. P. Spiller, eds., World Scientific, to appear. Also LANL e-print quant-ph/9712048.
91. 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.
92. L. A. RUBEL (1989), Digital simulation of analog computation and Church's thesis, J. Symbolic Logic, 54, pp. 1011-1017.
93. 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 Comput. Sci. 144, J. Calmet, ed., Springer-Verlag, Berlin, pp. 3-15.
94. A. SCHÖNHAGE, A. F. W. GROTEFELD, AND E. VETTER (1994), Fast Algorithms: A Multitape Turing Machine Implementation, B. I. Wissenschaftsverlag, Mannheim, Germany.
95. A. SCHÖNHAGE AND V. STRASSEN (1971), Schnelle Multiplikation grosser Zahlen, Computing, 7, pp. 281-292.
96. 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.
97. P. W. SHOR (1995), Scheme for reducing decoherence in quantum computer memory, Phys. Rev. A, 52, pp. 2493-2496.
98. P. W. SHOR (1996), Fault-tolerant quantum computation, in Proc. 37th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, pp. 56-65.
99. P. W. SHOR (1998), Quantum computing, Doc. Math., (Extra Volume, Proceedings ICM), I, pp. 305-324.
100. 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.
101. 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.
102. T. SLEATOR AND H. WEINFURTER (1995), Realizable universal quantum logic gates, Phys. Rev. Lett., 74, pp. 4087-4090.
103. R. SOLOVAY (1995), personal communication.
104. A. STEANE (1996a), Error correcting codes in quantum theory, Phys. Rev. Lett., 77, pp. 793-796.
105. A. STEANE (1996b), Multiple particle interference and quantum error correction, Proc. Roy. Soc. London Ser. A, 452, pp. 2551-2577.
106. A. STEANE (1999), Quantum error correction, in Introduction to Quantum Computation, H.-K. Lo, S. Popescu, and T. P. Spiller, eds., World Scientific, River Edge, NJ; also available as LANL e-print quant-ph/9712048.
107. 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.
108. 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.
109. T. TOFFOLI (1980), Reversible computing, in Automata, Languages and Programming, 7th Colloquium, Lecture Notes in Comput. Sci. 84, J. W. de Bakker and J. van Leeuwen, eds., Springer-Verlag, Berlin, pp. 632-644.
110. 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.
111. 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.
112. W. G. UNRUH (1995), Maintaining coherence in quantum computers, Phys. Rev. A, 51, pp. 992-997.
113. P. VAN EMDE BOAS (1990), Machine models and simulations, in Handbook of Theoretical Computer Science A, J. van Leeuwen, ed., Elsevier, Amsterdam, The Netherlands, pp. 1-66.
114. A. VERGIS, K. STEIGLITZ, AND B. DICKINSON (1986), The complexity of analog computation, Math. Comput. Simulation, 28, pp. 91-113.
115. 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.
116. C. ZALKA (1998), Efficient simulation of quantum systems by quantum computers, Proc. Roy. Soc. London Ser. A, 454, pp. 313-322.