Generated by GPT-5-mini| Peter Shor | |
|---|---|
| Name | Peter |
| Birth date | 1965 |
| Birth place | New York City |
| Nationality | United States |
| Fields | Computer science, Quantum computing, Applied mathematics |
| Workplaces | Massachusetts Institute of Technology, Bell Labs, AT&T Labs |
| Alma mater | Massachusetts Institute of Technology, Princeton University |
| Doctoral advisor | Richard M. Karp |
| Known for | Shor's algorithm, quantum error correction, quantum information theory |
Peter Shor
Peter Shor is an American mathematician and computer scientist known for foundational work in quantum computing. He is best known for developing an efficient quantum algorithm for integer factorization and for contributions to quantum error correction and quantum information theory. Shor's work has had wide influence across theoretical computer science, cryptography, physics, and engineering, prompting shifts in research at institutions such as Bell Labs, AT&T Labs, and Massachusetts Institute of Technology.
Shor was born in New York City and raised in an academic environment that included links to Princeton University and Massachusetts Institute of Technology communities. He completed undergraduate studies at Massachusetts Institute of Technology where he worked alongside faculty connected to Richard M. Karp and researchers in computational complexity theory at MIT Computer Science and Artificial Intelligence Laboratory. Shor earned his Ph.D. in applied mathematics from Princeton University under the supervision of Richard M. Karp, joining a lineage that intersects with researchers from Bell Labs and theoretical groups at AT&T Bell Laboratories. During graduate school he interacted with scholars associated with Stanford University, Harvard University, and the Institute for Advanced Study, shaping his orientation toward problems at the nexus of mathematics and computer science.
After doctoral work, Shor held positions at Bell Labs where he collaborated with scientists from AT&T Labs Research and engineers with ties to Lucent Technologies. He later joined the faculty of Massachusetts Institute of Technology as a professor in the Department of Mathematics and affiliate with MIT Computer Science and Artificial Intelligence Laboratory. His career includes visiting appointments and collaborations with researchers at Microsoft Research, IBM Research, Google, and academic groups at Caltech and University of California, Berkeley. Shor supervised students who went on to roles at institutions such as Princeton University, Harvard University, Stanford University, and national laboratories including Los Alamos National Laboratory. He has been a frequent speaker at conferences organized by ACM, IEEE, International Congress of Mathematicians, and workshops held by National Science Foundation and DARPA.
Shor introduced an efficient quantum algorithm for integer factorization that runs in polynomial time on a hypothetical quantum computer, dramatically impacting the status of public-key cryptosystems such as RSA (cryptosystem). The algorithm combines ideas from quantum Fourier transform, period finding, and techniques related to classical algorithms studied by researchers at Bell Labs and in the complexity theory community. Shor also pioneered constructions in quantum error correction that led to the development of quantum fault-tolerant quantum computing paradigms; these constructions connect to codes studied in coding theory and to stabilization concepts used in architectures proposed by IBM, Google, and academic groups at University of Oxford. His work on the threshold theorem influenced engineering programs at MIT Lincoln Laboratory and experimental efforts at laboratories such as National Institute of Standards and Technology and University of Innsbruck.
Beyond the factoring algorithm, Shor contributed to complexity-theoretic classifications such as relationships between BQP and classical complexity classes, and to algorithmic techniques for quantum simulation of physical systems originating from discussions in Condensed matter physics and quantum chemistry. His publications engaged with topics explored by scholars at Princeton University, Caltech, and Perimeter Institute for Theoretical Physics. Collaborations and citations tie his research to developments by Lov Grover, John Preskill, Alexei Kitaev, Emanuel Knill, and Gottesman, forming a network across quantum information science.
Shor's algorithm and subsequent research have been recognized by awards and honors from organizations including MacArthur Fellows Program-style fellowships and prizes granted by professional societies such as ACM, IEEE, and American Mathematical Society. He has been elected to national academies connected to National Academy of Sciences and honored with invited lectures at International Congress of Mathematicians and awards from National Science Foundation and Simons Foundation-funded programs. Shor has received prizes that acknowledge breakthroughs in cryptography and quantum information, joining laureates associated with Turing Award contenders and recipients of medals from institutions like Royal Society and American Physical Society.
Outside academia, Shor has participated in outreach programs aimed at audiences reached by institutions such as Museum of Mathematics, Institute for Quantum Information and Matter, and public lecture series at Carnegie Mellon University and Smithsonian Institution. He has collaborated with documentary filmmakers and journalists affiliated with outlets including Nature (journal), Science (journal), and mainstream media profiles in The New York Times and Scientific American to explain implications of quantum algorithms for technologies related to cryptography and computing. Shor maintains connections with families and colleagues from New York City and supports mentoring networks linked to graduate programs at MIT and Princeton University.
Category:American computer scientists Category:Quantum information scientists