Peter W. Shor
AT&T (United States)
3 papers in the Anchorcite directory, published between 1995 and 1997, cited 18,618 times in total.
ORCID profileResearch topics
- Quantum Computing Algorithms and Architecture · 3 papers
- Quantum Information and Cryptography · 3 papers
- Cryptography and Residue Arithmetic · 1 paper
- Quantum Mechanics and Applications · 1 paper
- Quantum-Dot Cellular Automata · 1 paper
Frequent co-authors
- Adriano Barenco · 1 paper
- Charles H. Bennett · 1 paper
- Richard Cleve · 1 paper
- David Peter Divincenzo · 1 paper
- Norman Margolus · 1 paper
- Tycho Sleator · 1 paper
- John A. Smolin · 1 paper
- Harald Weinfurter · 1 paper
Papers
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing · 1997 · 9,399 citations
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not…
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A · 1995 · 4,669 citations
Recently, it was realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest has since been growing in the area of quantum computation. One of the main difficulties of quantum computation is that decoherence…
- Elementary gates for quantum computationPhysical Review A · 1995 · 4,550 citations
We show that a set of gates that consists of all one-bit quantum gates [U(2)] and the two-bit exclusive-OR gate [that maps Boolean values (x,y) to (x,x\ensuremath{\bigoplus}y)] is universal in the sense that all unitary operations on arbitrarily many bits…
Metadata from OpenAlex (CC0).