Skip to main content
SpringerLink
Log in

Polynomial time algorithms for discrete logarithms and factoring on a quantum computer

  • Conference paper
  • First Online:
Algorithmic Number Theory (ANTS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 877))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. E. Bernstein and U. Vazirani, “Quantum complexity theory,” in Proc. 25th ACM Symp. on Theory of Computation, pp. 11–20 (1993).

    Google Scholar 

  2. A. Berthiaume and G. Brassard. “The quantum challenge to structural complexity theory,” in Proc. 7th IEEE Conference on Structure in Complexity Theory, pp. 132–137 (1992).

    Google Scholar 

  3. A. Berthiaume and G. Brassard, “Oracle quantum computing,” in Proc. Workshop on Physics of Computation, pp. 195–199, IEEE Press (1992).

    Google Scholar 

  4. D. Deutsch, “Quantum theory, the Church-Turing principle and the universal quantum computer,” Proc. R. Soc. Lond. Vol. A400, pp. 96–117 (1985).

    Google Scholar 

  5. D. Deutsch, “Quantum computational networks,” Proc. R. Soc. Lond. Vol. A425, pp. 73–90 (1989).

    Google Scholar 

  6. D. Deutsch and R. Jozsa, “Rapid solution of problems by quantum computation,” Proc. R. Soc. Lond. Vol. A439, pp. 553–558 (1992).

    Google Scholar 

  7. R. Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics, Vol. 21, nos. 6/7, pp. 467–488 (1982).

    Google Scholar 

  8. R. Feynman, “Quantum mechanical computers,” Foundations of Physics, Vol. 16, pp. 507–531 (1986). (Originally appeared in Optics News, February 1985.)

    Google Scholar 

  9. D. Simon, “On the power of quantum computation,” manuscript (1993).

    Google Scholar 

  10. A. Yao, “Quantum circuit complexity,” in Proc. 34th Symp. on Foundations of Computer Science, pp. 352–361, IEEE Press (1993).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Bell Labs, Room 2D-149, 600 Mountain Ave., 07974, Murray Hill, NJ, USA

    Peter W. Shor

Authors
  1. Peter W. Shor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leonard M. Adleman Ming-Deh Huang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shor, P.W. (1994). Polynomial time algorithms for discrete logarithms and factoring on a quantum computer. In: Adleman, L.M., Huang, MD. (eds) Algorithmic Number Theory. ANTS 1994. Lecture Notes in Computer Science, vol 877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58691-1_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-58691-1_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58691-3

  • Online ISBN: 978-3-540-49044-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation