Quantum computation and Shor{close_quote}s factoring algorithm

Journal Article · Mon Jul 01 04:00:00 EDT 1996 · Reviews of Modern Physics

DOI:https://doi.org/10.1103/RevModPhys.68.733· OSTI ID:287011

Ekert, A; Jozsa, R ^[1]

---

1. Clarendon Laboratory, University of Oxford Oxford OX1 3PU (United Kingdom)

Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations beyond the scope of any classical computer. Recently Peter Shor discovered an efficient algorithm for factoring whole numbers, which uses characteristically quantum effects. The algorithm illustrates the potential power of quantum computation, as there is no known efficient classical method for solving this problem. The authors give an exposition of Shor{close_quote}s algorithm together with an introduction to quantum computation and complexity theory. They discuss experiments that may contribute to its practical implementation. {copyright} {ital 1996 The American Physical Society.}

• OSTI ID: 287011
• Journal Information: Reviews of Modern Physics, Journal Name: Reviews of Modern Physics Journal Issue: 3 Vol. 68; ISSN 0034-6861; ISSN RMPHAT
• Country of Publication: United States
• Language: English

Related Subjects

66 PHYSICS
ALGORITHMS
COMPUTER CALCULATIONS
COMPUTER NETWORKS
COMPUTERS
DIPOLE INTERACTIONS
FACTORIZATION
GATES
GATING CIRCUITS
LOGIC CIRCUITS
MATHEMATICS
PARALLEL PROCESSING
QUANTUM MECHANICS