Universal Fault-Tolerant Quantum Computation on Decoherence-Free Subspaces
- 21 August 2000
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 85 (8), 1758-1761
- https://doi.org/10.1103/physrevlett.85.1758
Abstract
A general scheme to perform universal, fault-tolerant quantum computation within decoherence-free subspaces (DFSs) is presented. At most two-qubit interactions are required, and the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under spatially symmetric (collective) decoherence. Our results have immediate relevance to quantum computer implementations in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled quantum dot arrays and donor-atom arrays.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Robustness of decoherence-free subspaces for quantum computationPhysical Review A, 1999
- Computation on an error-avoiding quantum code and symmetrizationPhysical Review A, 1999
- Decoherence-Free Subspaces for Quantum ComputationPhysical Review Letters, 1998
- Reducing decoherence in quantum-computer memory with all quantum bits coupling to the same environmentPhysical Review A, 1998
- Quantum computing: pro and conProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Error Avoiding Quantum CodesModern Physics Letters B, 1997
- Noiseless Quantum CodesPhysical Review Letters, 1997
- Theory of quantum error-correcting codesPhysical Review A, 1997
- Good quantum error-correcting codes existPhysical Review A, 1996
- Error Correcting Codes in Quantum TheoryPhysical Review Letters, 1996