Showed that quantum algorithms can efficiently factor integers and compute discrete logarithms, and introduced a way to protect stored quantum information against decoherence.
arXiv / SIAM Journal on ComputingPhysical Review AShor changed both the motivation for quantum computing and the case that it could be made reliable. His factoring and discrete-logarithm algorithms supplied concrete computational tasks with striking quantum possibilities. His error-correction work then addressed the fragility of the quantum information those algorithms need. These are complementary contributions: one identifies a reason to build a quantum computer, and the other helps explain how imperfect physical components might support dependable quantum computation.
MIT CSAILarXiv / SIAM Journal on ComputingPhysical Review AThe work behind the recognition
Work, in context- 1994
Factoring and discrete logarithms in polynomial time
Shor presented quantum algorithms whose runtime scales polynomially for integer factoring and discrete logarithms. The result concerns an ideal quantum computational model and does not imply that contemporary devices can break deployed cryptographic keys.
Originator and sole author of the cited factoring and discrete-logarithm paper.
Source-supported recordarXiv / SIAM Journal on Computing - 1995
Protecting quantum memory from decoherence
Shor proposed a quantum error-correcting construction to reduce decoherence in stored quantum information when errors act independently on the constituent qubits. It established a route to preserving quantum states through encoded redundancy.
Sole author of the cited quantum-memory error-correction proposal.
Source-supported recordPhysical Review A
Keep in perspective
The algorithmic result is distinct from the hardware and error-correction resources required for a practical cryptanalytic computation.
The evidence map
Both views link each contribution to its sources. Choose a contribution on the map or read them all in the list.
Factoring and discrete logarithms in polynomial time
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Supports: Algorithm statements and explicit origin in the 1994 FOCS paper.
Published 1995 · Checked 19 Sept 2026Credit & limits: Originator and sole author of the cited factoring and discrete-logarithm paper.
Read the full contribution| Contribution | Evidence & what it supports | Credit & limits |
|---|---|---|
| Factoring and discrete logarithms in polynomial time1994 | Primary paperPolynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer Algorithm statements and explicit origin in the 1994 FOCS paper. Published 1995 · Checked 19 Sept 2026 | Originator and sole author of the cited factoring and discrete-logarithm paper. |
| Protecting quantum memory from decoherence1995 | Primary paperScheme for reducing decoherence in quantum computer memory Quantum error-correcting construction and independent-decoherence assumption. Published 1 Oct 1995 · Checked 19 Sept 2026 | Sole author of the cited quantum-memory error-correction proposal. |
Follow the evidence
3 sourcesPrimary papers, institutional records and attributed announcements. Each source supports the claims linked above.
- MIT CSAILInstitutional record
Peter Shor
Current MIT professor identification and quantum-computing research.
Checked 19 Sept 2026 - arXiv / SIAM Journal on ComputingPrimary paper
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Algorithm statements and explicit origin in the 1994 FOCS paper.
Published 1995 · Checked 19 Sept 2026 - Physical Review APrimary paper
Scheme for reducing decoherence in quantum computer memory
Quantum error-correcting construction and independent-decoherence assumption.
Published 1 Oct 1995 · Checked 19 Sept 2026