This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Peter W. Shor | |
|---|---|
| Name | Peter W. Shor |
| Birth date | 1959 |
| Nationality | American |
| Fields | Quantum computation, Computer science, Mathematics |
| Workplaces | Massachusetts Institute of Technology, AT&T Bell Labs, Clay Mathematics Institute |
| Alma mater | California Institute of Technology, Massachusetts Institute of Technology |
| Known for | Shor's algorithm |
Peter W. Shor
Peter W. Shor is an American mathematician and computer scientist known for foundational work in quantum computing and quantum information theory. He is best known for devising a polynomial-time quantum algorithm for integer factorization that dramatically influenced research at institutions such as Bell Labs, Massachusetts Institute of Technology, and spurred developments at technology companies like Google and IBM. Shor's work connects threads through theoretical computer science, cryptography, and mathematical physics, reshaping research agendas at universities including Harvard University, Princeton University, and institutes such as the Clay Mathematics Institute.
Shor was born in 1959 and raised in the United States, where he developed early interests that led him to study at the California Institute of Technology and the Massachusetts Institute of Technology. At Caltech he undertook undergraduate studies influenced by faculty in mathematics and computing who were connected to research at the National Aeronautics and Space Administration and collaborations with laboratories such as Bell Labs. At MIT he completed graduate work under advisors with ties to computer science programs and mathematical research groups that intersected with contemporary work at Stanford University and the University of California, Berkeley.
Shor held positions at AT&T Bell Laboratories where he worked alongside researchers in theoretical physics and information theory affiliated with Bell Labs Research and collaboratories with groups at Harvard University and Princeton University. He later joined the faculty of the Massachusetts Institute of Technology and held appointments supporting cross-disciplinary centers that connected to researchers at institutions such as MIT Lincoln Laboratory and the Perimeter Institute for Theoretical Physics. His career includes visiting positions and collaborations with researchers at IBM Research, Microsoft Research, and the Institute for Advanced Study, and participation in programs organized by the National Science Foundation and the Simons Foundation.
Shor developed a quantum algorithm for integer factorization and discrete logarithms that runs in polynomial time on a quantum computer, a result that established a direct challenge to widely used cryptographic systems based on the difficulty of factoring, including protocols standardized by organizations such as the National Institute of Standards and Technology. His algorithm drew on concepts from number theory, Fourier analysis, and the theory of quantum error correction developed in concert with work by researchers at Caltech, Cambridge University, and the University of Waterloo. The algorithm stimulated experimental implementations in architectures pursued by teams at IBM, Google Quantum AI, Rigetti Computing, and laboratories at Harvard University and Yale University, and led to intensified research into post-quantum cryptography at institutions including NIST and collaborations with companies such as Intel.
Beyond the factoring algorithm, Shor contributed to the theory of quantum error-correcting codes and fault-tolerant quantum computation, connecting to work by researchers associated with Claude Shannon's information theory legacy at Bell Labs and subsequent developments at the Perimeter Institute. He influenced algorithmic frameworks used in proposals for scalable quantum processors being pursued at IonQ and in superconducting qubit programs at Google and IBM, and impacted theoretical studies at Microsoft Research into topological quantum computing.
Shor's contributions earned recognition including awards and prizes bestowed by organizations such as the National Academy of Sciences, the MacArthur Foundation, and professional societies like the Association for Computing Machinery and the American Mathematical Society. He has been elected to national academies and honored with medals presented at events hosted by institutions such as the Institute of Electrical and Electronics Engineers and the Royal Society. His research has been cited in reports from the National Science Foundation and referenced in announcements by corporate research labs including Bell Labs and IBM Research.
Shor's seminal paper presenting the factoring algorithm appeared in conference proceedings and journals frequented by researchers across theoretical computer science, cryptography, and physics. He authored influential articles on quantum error correction that are studied alongside works by colleagues at Caltech, MIT, and Princeton University. Subsequent publications addressed fault-tolerant schemes and algorithmic complexity, forming part of curricula in courses at MIT, Stanford University, and graduate programs supported by the Simons Foundation. His work is widely cited in papers and monographs produced by research groups at Harvard University, University of California, Berkeley, and the University of Cambridge.
Shor's professional influence spans academia, national laboratories, and industry research labs, shaping directions at entities such as Google, IBM, Intel, and national initiatives run by NIST and the National Science Foundation. Colleagues and students from institutions including Massachusetts Institute of Technology, Harvard University, and the Institute for Advanced Study have continued lines of inquiry inspired by his results, contributing to fields including post-quantum cryptography, quantum complexity theory, and experimental quantum computing at organizations like IonQ and Rigetti Computing. His legacy is reflected in prize citations from bodies such as the Association for Computing Machinery and in the curriculum of graduate programs at leading universities.
Category:American computer scientists Category:Quantum information scientists