zoom_in Click to enlarge

Peter Shor

▲ ▼

description Peter Shor Overview

Peter Shor is an American applied mathematics professor at MIT whose work changed the discussion of what quantum computers could accomplish. In 1994, he introduced Shor's algorithm, which can factor integers in polynomial time on a suitable quantum computer. This differs from simply speeding up a familiar classical method; the algorithm uses quantum computation to approach a problem important to public-key cryptography. The result showed that sufficiently capable quantum machines could threaten widely used cryptographic systems, helping drive research into quantum information and alternative security methods.

It does not mean that any existing quantum device can break practical encryption. Shor also contributed to quantum error correction, which addresses errors in delicate quantum information. His work suits readers interested in both the theoretical power of quantum algorithms and the practical obstacles to building machines that can run them reliably.

help Peter Shor FAQ

What is Shor's algorithm and why is it significant?

Shor's algorithm, published by Peter Shor in 1994, is a quantum algorithm that factors large integers in polynomial time — exponentially faster than any known classical method. Its significance is that RSA and other widely used cryptosystems rely on the difficulty of factoring large numbers, so a sufficiently large quantum computer running Shor's algorithm could break them.

Can Shor's algorithm break current encryption like RSA?

In theory yes, Shor's algorithm can break RSA encryption, but current quantum computers as of the 2020s lack the thousands of stable, error-corrected qubits needed to factor the 2048-bit numbers used in real cryptographic keys. This threat has motivated NIST to develop post-quantum cryptography standards, with the first finalized standards published in 2024.

What is the Shor code in quantum error correction?

Published by Shor in 1995, the Shor code was the first quantum error-correcting code, encoding one logical qubit using nine physical qubits to protect against arbitrary single-qubit errors. This breakthrough demonstrated that quantum computation could be made fault-tolerant despite the inherent fragility of quantum states.

Where does Peter Shor work?

Shor is a professor in the Department of Mathematics at MIT, where he has been on the faculty since 2003. Before MIT, he spent seven years at AT&T Bell Laboratories (later AT&T Labs), where he developed his famous factoring algorithm, and he received his PhD from MIT in 1985.