University of North Texas Digital Library (University of North Texas) · 1998 · 284 citations · 7 references
Open access
ComputingComputer SciencePhysicsAlgorithmsQuantum ComputingQuantum MechanicsQuantum AlgorithmsQuantum BitsQuantum ComputationQuantum DynamicsQuantum OperatorsQuantum StatesCommunication ProtocolsHeisenberg ModelPolynomial-time AlgorithmsQuantum Circuit ModelQuantum Circuit RepresentationShor's AlgorithmTensor Products
Since Shor`s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features of quantum computers--the difficulty of describing them on classical computers--also makes it difficult to describe and understand precisely what can be done with them. A formalism describing the evolution of operators rather than states has proven extremely fruitful in understanding an important class of quantum operations. States used in error correction and certain communication protocols can be described by their stabilizer, a group of tensor products of Pauli matrices. Even this simple group structure is sufficient to allow a rich range of quantum effects, although it falls short of the full power of quantum computation.
7
Mixed-state entanglement and quantum error correction
Charles H. Bennett, David P. DiVincenzo, John A. Smolin et al. · Physical Review A · 1996 · 5.4K citations · Full text
Perfect Quantum Error Correcting Code
Raymond Laflamme, César Miquel, Juan Pablo Paz et al. · Physical Review Letters · 1996 · 978 citations
Computing, Computer Science, Physics +17
Theory of fault-tolerant quantum computation
Daniel Gottesman · Physical Review A · 1998 · 974 citations · Full text
Computing, Computer Science, Physics +16
Fault-tolerant quantum computation
Peter W. Shor · 2002 · 915 citations
Computing, Computer Science, Physics +17