Who is Peter Shor and what did he invent?
Peter Shor is an American theoretical computer scientist and professor of applied mathematics at the Massachusetts Institute of Technology. He is best known for developing Shor's algorithm in 1994, a quantum algorithm capable of finding the prime factors of an integer exponentially faster than classical computers. His work laid foundational groundwork in the field of quantum computation.
What we know
- Peter Shor is an American theoretical computer scientist born on August 14, 1959. [2]
- He has served as a professor of applied mathematics at the Massachusetts Institute of Technology since 2003. [1, 2]
- He developed Shor's algorithm in 1994 to find prime factors of integers exponentially faster than classical algorithms. [2, 4]
- Shor's algorithm includes related procedures for solving the discrete logarithm problem and the period-finding problem. [4]
Where to go next
- how it workedHow does Shor's algorithm work?
- the bigger pictureWhat is quantum computation?
- whereMassachusetts Institute of Technology
- compared withGeneral number field sieve
- what followedWhat are quantum error correction and qubits?
- an unexpected connectionHow does recursion theory connect to modern computer science foundations?Both Peter Shor and Rózsa Péter are prominent mathematicians whose pioneering work fundamentally shaped computational theory, spanning from recursive functions to quantum algorithms.
Sources
- [1]Peter Shor (Wikidata Q370071) · CC0 1.0
- [2]Peter Shor · CC BY-SA 4.0
- [3]Shor · CC BY-SA 4.0
- [4]Shor's algorithm · CC BY-SA 4.0
- [5]Rózsa Péter · CC BY-SA 4.0