Algorithms for quantum computation: Discrete logarithms and factoring

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 1994, Pages 124-134

  Shor, Peter W ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; QUANTUM COMPUTERS;

COMPUTATION TIME; COMPUTATIONAL DEVICES; COMPUTATIONAL PROPERTIES; DEVELOPED MODEL; DISCRETE LOGARITHMS; FACTORING INTEGERS; LAS VEGAS ALGORITHMS; POLYNOMIAL FACTOR; QUANTA COMPUTERS; QUANTUM MECHANICAL;

QUANTUM THEORY;

EID: 85115374351     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1994.365700     Document Type: Conference Paper

References (32)

1. P. Benioff, "Quantum mechanical Hamiltonian models of Turing machines," J. Stat. Phys. Vol. 29, pp. 515-546(1982).
2. P. Benioff, "Quantum mechanical Hamiltonian models of Turing machines that dissipate no energy," Phys. Rev. Lett. Vol. 48, pp. 1581-1585 (1982).
3. C. H. Bennett, "Logical reversibility of computation," IBMJ. Res. Develop. Vol. 17, pp. 525-532(1973).
4. C. H. Bennett, E. Bernstein, G. Brassard and U. Vazirani, "What is feasible on a quantum computer," manuscript (1994).
5. E. Bernstein and U. Vazirani, "Quantum complexity theory," in Proc. 25th ACM Symp. on Theory of Computation, pp. 11-20(1993).
6. A. Berthiaume and G. Brassard, "The quantum challenge to structural complexity theory," in Proc. 7th IEEE Conf. on Structure in Complexity Theory, pp. 132-137(1992).
7. A. Berthiaume and G. Brassard, "Oracle quantum computing," in Proc. Workshop on Physics of Computation, pp. 195-199, IEEE Press (1992).
8. D. Coppersmith, "An approximate Fourier transform useful in quantum factoring," IBM Research Report RC19642 (1994).
9. D. Deutsch, "Quantum theory, the Church-Turing principle and the universal quantum computer," Proc. Roy. Soc. Lond. Vol. A400, pp. 96-117 (1985).
10. D. Deutsch, "Quantum computational networks," Proc. Roy. Soc. Lond. Vol. A425, pp. 73-90 (1989).
11. D. Deutsch and R. Jozsa, "Rapid solution of problems by quantum computation," Proc. Roy. Soc. Lond. Vol. A439, pp. 553-558 (1992).
12. D. P. DiVincenzo, "Two-bit gates are universal for quantum computation," manuscript (1994).
13. R. Feynman, "Simulating physics with computers," International Journal of Theoretical Physics, Vol. 21, No. 6/7, pp. 467-488 (1982).
14. R. Feynman, "Quantum mechanical computers," Foundations of Physics, Vol. 16, pp. 507-531 (1986). (Originally appeared in Optics News, February 1985.)
15. L. Fortnow and M. Sipser, "Are there interactive protocols for co-NP languages?" Inform. Proc. Lett. Vol. 28, pp. 249-251 (1988).
16. D. M. Gordon, "Discrete logarithms in GF(p) using the number field sieve," SIAM J. Discrete Math. Vol. 6, pp. 124-139(1993).
17. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Fifth Edition, Oxford University Press, New York (1979).
18. R. Landauer, "Is quantum mechanics useful?" Proc. Roy. Soc. Lond., to appear (1994).
19. A. K. Lenstra and H. W. Lenstra, Jr., eds., The Development of the Number Field Sieve, Lecture Notes in Mathematics No. 1554, Springer-Verlag (1993).
20. H. W. Lenstra, Jr. and C. Pomerance, "A rigorous time bound for factoring integers, J. Amer. Math. Soc. Vol. 5, pp. 483-516 (1992).
21. S. Lloyd, "A potentially realizable quantum computer," Science, Vol. 261, pp. 1569-1571 (1993).
22. S. Lloyd, "Envisioning a quantum supercomputer," Science, Vol. 263, p. 695 (1994).
23. G. L. Miller, "Riemann's hypothesis and tests for primality,"J. Comp. Sys. Sci. Vol. 13, pp. 300-317 (1976).
24. S. Pohlig and M. Hellman, "An improved algorithm for computing discrete logarithms over GF(p) and its cryptographic significance," IEEE Trans. Information Theory, Vol. 24, pp. 106-110 (1978).
25. C. Pomerance, "Fast, rigorous factorization and discrete logarithm algorithms," in Discrete Algorithms and Complexity (Proc. Japan-US Joint Seminar), pp. 119-143, Academic Press (1986).
26. R. L. Rivest, A. Shamir, and L. Adleman "A method of obtaining digital signatures and public-key cryptosystems," Communications ACM, Vol. 21, No. 2, pp. 120-126 (1978).
27. A. Shamir, "IP = PSPACE," in Proc. 31th Ann. Symp. Foundations of Computer Science, pp. 11-15, IEEE Press (1990).
28. D. Simon, "On the power of quantum computation," in Proc. 35th Ann. Symp. Foundations of Computer Science, IEEE Press (1994).
29. W. G. Teich, K. Obermayer, and G. Mahler, "Structural basis of multistationary quantum systems II: Effective few-particle dynamics," Phys. Rev. B, Vol. 37, pp. 8111-8121 (1988).
30. T. Toffoli, "Reversible computing," in Automata, Languages and Programming, Seventh Colloq., Lecture Notes in Computer Science No. 84 (J. W. De Bakker and J. van Leeuwen, eds.) pp. 632-644, Springer-Verlag (1980).
31. W. G. Unruh, "Maintaining coherence in quantum computers," manuscript (1994).
32. A. Yao, "Quantum circuit complexity," in Proc. 34th Ann. Symp. Foundations of Computer Science, pp. 352-361, IEEE Press (1993).