JOURNAL ARTICLE

Universal Fault-Tolerant Quantum Computation on Decoherence-Free Subspaces

Dave BaconJulia KempeDaniel A. LidarK. Birgitta Whaley

Year: 2000 Journal:   Physical Review Letters Vol: 85 (8)Pages: 1758-1761   Publisher: American Physical Society

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:
Quantum computer Decoherence-free subspaces Quantum decoherence Quantum error correction Physics Quantum mechanics Qubit Quantum algorithm Universal set Computer science Topology (electrical circuits) Quantum Mathematics Combinatorics

Metrics

363
Cited By
33.31
FWCI (Field Weighted Citation Impact)
25
Refs
1.00
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Quantum Computing Algorithms and Architecture
Physical Sciences →  Computer Science →  Artificial Intelligence
Quantum Information and Cryptography
Physical Sciences →  Computer Science →  Artificial Intelligence
Quantum and electron transport phenomena
Physical Sciences →  Physics and Astronomy →  Atomic and Molecular Physics, and Optics
© 2026 ScienceGate Book Chapters — All rights reserved.