Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9909058 · Physical Review Letters

Universal Fault-Tolerant Quantum Computation on Decoherence-Free Subspaces

Dave Bacon, Julia Kempe, Daniel A. Lidar, K. Birgitta Whaley

Published Aug 21, 2000• 362 citations
arXivHTMLPDF

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.

DOI
10.1103/physrevlett.85.1758

Related papers

Theory of decoherence-free fault-tolerant universal quantum computation

Julia Kempe, Dave Bacon, Daniel A. Lidar +1 more

Universal quantum computation on decoherence-free subspaces and subsystems (DFSs) is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of decoherence-free (noiseless) subsystems in the Markovian regime is derived here for the first time. A stabilizer formalism for DFSs is then developed which allows for the explicit understanding of these in their dual role as quantum error correcting codes. Conditions for the existence of Hamiltonians whose induced evolution always preserves a DFS are derived within this stabilizer formalism. Two possible collective decoherence mechanisms arising from permutation symmetries of the system-bath coupling are examined within this framework. It is shown that in both cases universal quantum computation which always preserves the DFS (natural fault-tolerant computation) can be performed using only two-body interactions. This is in marked contrast to standard error correcting codes, where all known constructions using one- or two-body interactions must leave the code space during the on-time of the fault-tolerant gates. A further consequence of our universality construction is that a single exchange Hamiltonian can be used to perform universal quantum computation on an encoded space whose asymptotic coding efficiency is unity. The exchange Hamiltonian, which is naturally present in many quantum systems, is thus asymptotically universal.

arXiv:quant-ph/0004064•Physical Review A•Mar 20, 2001•534 citations

Universal Fault Tolerant Quantum Computation on a Class of Decoherence-Free Subspaces Without Spatial Symmetry

Daniel A. Lidar, Bacon, D J, Julia Kempe +1 more

Decoherence-free subspaces (DFSs) are constructed without the assumption of spatially symmetric system-bath coupling. Instead the underlying assumption is that subgroups of the full Pauli group of errors are responsible for the decoherence. The corresponding decoherence-free states can protect quantum information in the presence of multiple-qubit errors, and are stabilizer codes. It is shown how to perform universal fault tolerant quantum computation on this class of DFSs. This is the first demonstration that it is possible to use only one- and two-body quantum gates to perform full-blown quantum computation on a class of DFSs, with a finite number of measurements.

•Jan 1, 2001•1 citation

Decoherence-free subspaces for multiple-qubit errors. II. Universal, fault-tolerant quantum computation

Daniel A. Lidar, Dave Bacon, Julia Kempe +1 more

Decoherence-free subspaces (DFSs) shield quantum information from errors induced by the interaction with an uncontrollable environment. Here we study a model of correlated errors forming an Abelian subgroup (stabilizer) of the Pauli group (the group of tensor products of Pauli matrices). Unlike previous studies of DFSs, this type of error does not involve any spatial symmetry assumptions on the system-environment interaction. We solve the problem of universal, fault-tolerant quantum computation on the associated class of DFSs. We do so by introducing a hybrid DFS quantum error-correcting-code approach, where errors that arise due to departure of the codewords from the DFS are corrected actively.

arXiv:quant-ph/0007013•Physical Review A•Jan 17, 2001•65 citations

Scalable Fault-Tolerant Quantum Computation in Decoherence-Free Subspaces

Zheng-Wei Zhou, Bo Hao Yu, Xingxiang Zhou +2 more

We investigate how to concatenate different decoherence-free subspaces to realize scalable universal fault-tolerant quantum computation. Based on tunable $XXZ$ interactions, we present an architecture for scalable quantum computers which can fault-tolerantly perform universal quantum computation by manipulating only a single type of parameter. By using the concept of interaction-free subspaces, we eliminate the need to tune the couplings between logical qubits, which further reduces the technical difficulties for implementing quantum computation.

arXiv:quant-ph/0407241•Physical Review Letters•Jun 1, 2004•16 citations

Creating Decoherence-Free Subspaces Using Strong and Fast Pulses

Lian-Ao Wu, Daniel A. Lidar

A decoherence-free subspace (DFS) isolates quantum information from deleterious environmental interactions. We give explicit sequences of strong and fast ["bang-bang" (BB)] pulses that create the conditions allowing for the existence of DFSs that support scalable, universal quantum computation. One such example is the creation of the conditions for collective decoherence, wherein all system particles are coupled in an identical manner to their environment. The BB pulses needed for this are generated using only the Heisenberg exchange interaction. In conjunction with previous results, this shows that Heisenberg exchange is by itself an enabler of universal fault-tolerant quantum computation on DFSs.

arXiv:quant-ph/0112144•Physical Review Letters•May 6, 2002•158 citations

Nonadiabatic Holonomic Quantum Computation in Decoherence-Free Subspaces

Guofu Xu, Jiang Zhang, D. M. Tong +2 more

Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum computation in decoherence-free subspaces have been proposed in the past few years. However, nonadiabatic holonomic quantum computation in decoherence-free subspaces, which avoids a long run-time requirement but with all the robust advantages, remains an open problem. Here, we demonstrate how to realize nonadiabatic holonomic quantum computation in decoherence-free subspaces. By using only three neighboring physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of quantum gates.

arXiv:1210.6782•Physical Review Letters•Oct 24, 2012•301 citations
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.
Universal quantum computation on decoherence-free subspaces and subsystems (DFSs) is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of decoherence-free (noiseless) subsystems in the Markovian regime is derived here for the first time. A stabilizer formalism for DFSs is then developed which allows for the explicit understanding of these in their dual role as quantum error correcting codes. Conditions for the existence of Hamiltonians whose induced evolution always preserves a DFS are derived within this stabilizer formalism. Two possible collective decoherence mechanisms arising from permutation symmetries of the system-bath coupling are examined within this framework. It is shown that in both cases universal quantum computation which always preserves the DFS (natural fault-tolerant computation) can be performed using only two-body interactions. This is in marked contrast to standard error correcting codes, where all known constructions using one- or two-body interactions must leave the code space during the on-time of the fault-tolerant gates. A further consequence of our universality construction is that a single exchange Hamiltonian can be used to perform universal quantum computation on an encoded space whose asymptotic coding efficiency is unity. The exchange Hamiltonian, which is naturally present in many quantum systems, is thus asymptotically universal.
Decoherence-free subspaces (DFSs) are constructed without the assumption of spatially symmetric system-bath coupling. Instead the underlying assumption is that subgroups of the full Pauli group of errors are responsible for the decoherence. The corresponding decoherence-free states can protect quantum information in the presence of multiple-qubit errors, and are stabilizer codes. It is shown how to perform universal fault tolerant quantum computation on this class of DFSs. This is the first demonstration that it is possible to use only one- and two-body quantum gates to perform full-blown quantum computation on a class of DFSs, with a finite number of measurements.
Decoherence-free subspaces (DFSs) shield quantum information from errors induced by the interaction with an uncontrollable environment. Here we study a model of correlated errors forming an Abelian subgroup (stabilizer) of the Pauli group (the group of tensor products of Pauli matrices). Unlike previous studies of DFSs, this type of error does not involve any spatial symmetry assumptions on the system-environment interaction. We solve the problem of universal, fault-tolerant quantum computation on the associated class of DFSs. We do so by introducing a hybrid DFS quantum error-correcting-code approach, where errors that arise due to departure of the codewords from the DFS are corrected actively.
We investigate how to concatenate different decoherence-free subspaces to realize scalable universal fault-tolerant quantum computation. Based on tunable XXZXXZXXZ interactions, we present an architecture for scalable quantum computers which can fault-tolerantly perform universal quantum computation by manipulating only a single type of parameter. By using the concept of interaction-free subspaces, we eliminate the need to tune the couplings between logical qubits, which further reduces the technical difficulties for implementing quantum computation.
A decoherence-free subspace (DFS) isolates quantum information from deleterious environmental interactions. We give explicit sequences of strong and fast ["bang-bang" (BB)] pulses that create the conditions allowing for the existence of DFSs that support scalable, universal quantum computation. One such example is the creation of the conditions for collective decoherence, wherein all system particles are coupled in an identical manner to their environment. The BB pulses needed for this are generated using only the Heisenberg exchange interaction. In conjunction with previous results, this shows that Heisenberg exchange is by itself an enabler of universal fault-tolerant quantum computation on DFSs.
Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum computation in decoherence-free subspaces have been proposed in the past few years. However, nonadiabatic holonomic quantum computation in decoherence-free subspaces, which avoids a long run-time requirement but with all the robust advantages, remains an open problem. Here, we demonstrate how to realize nonadiabatic holonomic quantum computation in decoherence-free subspaces. By using only three neighboring physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of quantum gates.