Decoherence-Free Subspaces for Quantum Computation
- 21 September 1998
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 81 (12) , 2594-2597
- https://doi.org/10.1103/physrevlett.81.2594
Abstract
Decoherence in quantum computers is formulated within the semigroup approach. The error generators are identified with the generators of a Lie algebra. This allows for a comprehensive description which includes as a special case the frequently assumed spin-boson model. A generic condition is presented for errorless quantum computation: decoherence-free subspaces are spanned by those states which are annihilated by all the generators. It is shown that these subspaces are stable to perturbations and, moreover, that universal quantum computation is possible within them.All Related Versions
This publication has 23 references indexed in Scilit:
- Reducing decoherence in quantum-computer memory with all quantum bits coupling to the same environmentPhysical Review A, 1998
- Quantum Computers Can Search Arbitrarily Large Databases by a Single QueryPhysical Review Letters, 1997
- Dissipative dynamics in a quantum registerPhysical Review A, 1997
- Error Avoiding Quantum CodesModern Physics Letters B, 1997
- Stabilization of Quantum Computations by SymmetrizationSIAM Journal on Computing, 1997
- Preserving Coherence in Quantum Computation by Pairing Quantum BitsPhysical Review Letters, 1997
- Bulk Spin-Resonance Quantum ComputationScience, 1997
- Good quantum error-correcting codes existPhysical Review A, 1996
- Error Correcting Codes in Quantum TheoryPhysical Review Letters, 1996
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995