Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Peter Shor

Also Known As Peter Williston Shor · Peter W. Shor · P. W. Shor
Theory of Computation

Peter Williston Shor (born August 14, 1959, in New York City) is an American theoretical computer scientist known for devising Shor's algorithm, a quantum algorithm that factors integers exponentially faster than the best known classical algorithm, with direct implications for breaking widely used public key cryptosystems. He earned his PhD from MIT in 1985 and worked at the University of California, Berkeley and at Bell Labs, where he developed the algorithm in 1994, before joining MIT in 2003 as a professor of applied mathematics affiliated with the Computer Science and Artificial Intelligence Laboratory. Beyond his namesake factoring algorithm he developed the Shor code and the CSS quantum error correcting code and contributed to the quantum threshold theorem. His work has been recognized with the Rolf Nevanlinna Prize in 1998, the Godel Prize in 1999, a MacArthur Fellowship in 1999, and the Claude E. Shannon Award in 2025.

Facts
Birth Year
1959 1
Birth Date
1959-08-14 1
Award
International Quantum Communication Award 1
Award
Dickson Prize in Science 1
Award
Gödel Prize 1
Award
Josiah Willard Gibbs Lectureship 1
Award
MacArthur Fellows Program 1
Award
ACM Fellow 1
Award
ICTP Dirac Medal 1
Award
King Faisal Prize in Science 1
Award
O'Reilly Open Source Award 1
Award
IEEE Eric E. Sumner Award 1
Award
Fellow of the American Mathematical Society 1
Award
IMU Abacus Medal 1
Connections

Invented

Peter Shor published his quantum algorithm for integer factorization in 1994.

In the Other Atlases
Sources
1. Wikidata: Peter Shor
Wikidata Q370071, class allow-list match (w-wdresolver-0926)View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.