Peter Shor is a mathematician whose research includes quantum computing, quantum information theory, algorithms and computational geometry.[ref] His quantum algorithms for integer factorization and discrete logarithms require a number of steps polynomial in the number of input digits. They made the distinction between classical and quantum computational resources concrete for problems used in cryptography.[ref]
Portrait of Peter Shor
. International Centre for Theoretical Physics. CC BY 3.0, via Wikimedia Commons. Source.
Peter Shor is an American mathematician and computer scientist, best known for his groundbreaking work in the field of quantum computing. He gained prominence for developing Shor's algorithm in 1994, which is an efficient quantum algorithm for factoring large integers. This algorithm demonstrated that quantum computers could solve certain problems much more quickly than classical computers, specifically, it showed that factoring integers (a problem that is fundamental to the security of many cryptographic systems) could be done in polynomial time on a quantum computer.
New to topics? Read the docs here!