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

Record

Authors
Shor, P. W.
Year
1997
Title
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Published in
SIAM Journal on Computing
Volume
26 (5)
Pages
1484–1509
Type
Journal article
Our note
none yet
Verification
matched-by-title: found by title in an open index (same title, year and first author) (checked against OpenAlex, 2026-11-14).
Identifiers found: OpenAlex W3023478445 · DOI 10.1137/s0097539795293172
Id
shor-1997-polynomial-time-algorithms-prime-factorization-discrete

Cited on

As cited

The pages cite this work in one form.

  • Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484–1509. Preliminary version in the Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994). Read in the arXiv version, quant-ph/9508027.

BibLaTeX

@article{shor-1997-polynomial-time-algorithms-prime-factorization-discrete,
  author = {Shor, P. W.},
  title = {{Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer}},
  journaltitle = {SIAM Journal on Computing},
  date = {1997},
  volume = {26},
  number = {5},
  pages = {1484--1509}
}

Download · JSON with CSL-JSON · the whole bibliography