Skip to content

Decoherence-Free Subspaces

A decoherence-free subspace is a subspace whose states are not distinguished by a specified noise process. The environment may still interact with the physical degrees of freedom, but it acts identically on every state in the protected subspace, so it cannot learn which logical state was stored there.

The compact idea is:

noise symmetry⟹protected logical information.\text{noise symmetry} \quad\Longrightarrow\quad \text{protected logical information}.

This is not magic isolation. A decoherence-free subspace is protected only against the noise operators that have the required symmetry. If the actual environment distinguishes the encoded states, if the Hamiltonian leaks the state out of the subspace, or if independent local noise breaks the collective model, the protection is lost or only approximate.

Let C⊂H\mathcal C\subset\mathcal H be a candidate code subspace with projector PCP_{\mathcal C}. Suppose a Markovian master equation has Lindblad operators LμL_\mu. A sufficient decoherence-free condition is

Lμ∣ψ⟩=λμ∣ψ⟩for every ∣ψ⟩∈C and every μ,L_\mu\lvert\psi\rangle = \lambda_\mu \lvert\psi\rangle \qquad \text{for every } \lvert\psi\rangle\in\mathcal C \text{ and every }\mu,

with the same scalar λμ\lambda_\mu for all states in C\mathcal C. Equivalently,

LμPC=λμPC.L_\mu P_{\mathcal C} = \lambda_\mu P_{\mathcal C}.

Then the dissipator cannot distinguish two states in C\mathcal C. For any operator ρ\rho supported on C\mathcal C,

LμρLμ†=∣λμ∣2ρ,{Lμ†Lμ,ρ}=2∣λμ∣2ρ,L_\mu\rho L_\mu^\dagger = |\lambda_\mu|^2\rho, \qquad \{L_\mu^\dagger L_\mu,\rho\} = 2|\lambda_\mu|^2\rho,

so

D[Lμ]ρ=0.\mathcal D[L_\mu]\rho=0.

The Hamiltonian must also preserve the subspace:

HeffC⊆C.H_{\mathrm{eff}}\mathcal C \subseteq \mathcal C.

If the Hamiltonian moves states out of C\mathcal C, the dissipator may become active afterward even if the initial state was protected.

Decoherence requires distinguishability. If the environment couples to the same label for every state in C\mathcal C, it cannot acquire which-logical-state information.

For two encoded states ∣0L⟩\lvert0_L\rangle and ∣1L⟩\lvert1_L\rangle, a protected interaction has the schematic action

∣ψL⟩∣E0⟩⟼UL∣ψL⟩∣EC⟩\lvert\psi_L\rangle\lvert E_0\rangle \longmapsto U_L\lvert\psi_L\rangle \lvert E_{\mathcal C}\rangle

for every encoded state

∣ψL⟩=α∣0L⟩+β∣1L⟩.\lvert\psi_L\rangle = \alpha\lvert0_L\rangle + \beta\lvert1_L\rangle.

The environment state ∣EC⟩\lvert E_{\mathcal C}\rangle is independent of α\alpha and β\beta. Tracing out the environment therefore does not suppress coherence between ∣0L⟩\lvert0_L\rangle and ∣1L⟩\lvert1_L\rangle.

By contrast, if

∣0L⟩∣E0⟩⟼∣0L⟩∣E0′⟩,∣1L⟩∣E0⟩⟼∣1L⟩∣E1′⟩\lvert0_L\rangle\lvert E_0\rangle \longmapsto \lvert0_L\rangle\lvert E_0'\rangle, \qquad \lvert1_L\rangle\lvert E_0\rangle \longmapsto \lvert1_L\rangle\lvert E_1'\rangle

with ⟨E1′∣E0′⟩\langle E_1'|E_0'\rangle small, the environment has distinguished the logical states and the subspace is not decoherence free for that process.

This is the subspace version of the pointer-state principle. A pointer sector can preserve coherence inside a degenerate monitored sector even while coherences between sectors are suppressed.

Example: Collective Dephasing of Two Qubits

Section titled “Example: Collective Dephasing of Two Qubits”

Consider two qubits subject to collective dephasing with one Lindblad operator

L=Z1+Z2.L=Z_1+Z_2.

In the computational basis,

L∣00⟩=2∣00⟩,L∣01⟩=0,L∣10⟩=0,L∣11⟩=−2∣11⟩.\begin{aligned} L\lvert00\rangle&=2\lvert00\rangle,\\ L\lvert01\rangle&=0,\\ L\lvert10\rangle&=0,\\ L\lvert11\rangle&=-2\lvert11\rangle. \end{aligned}

The subspace

C=span⁡{∣01⟩,∣10⟩}\mathcal C = \operatorname{span} \{ \lvert01\rangle, \lvert10\rangle \}

is decoherence free for this noise, because LL has the same eigenvalue 00 on every vector in C\mathcal C:

L∣ψ⟩=0∣ψ⟩∈C.L\lvert\psi\rangle=0 \qquad \lvert\psi\rangle\in\mathcal C.

One may encode a logical qubit as

∣0L⟩=∣01⟩,∣1L⟩=∣10⟩.\lvert0_L\rangle=\lvert01\rangle, \qquad \lvert1_L\rangle=\lvert10\rangle.

Collective phase noise cannot distinguish the two code states. It sees only the total ZZ value, and both states have the same value.

Independent dephasing is different. If the noise operators are Z1Z_1 and Z2Z_2 separately, then

Z1∣01⟩=∣01⟩,Z1∣10⟩=−∣10⟩.Z_1\lvert01\rangle=\lvert01\rangle, \qquad Z_1\lvert10\rangle=-\lvert10\rangle.

The environment can now distinguish the two encoded states, so the same subspace is no longer decoherence free.

Decoherence-free subspaces usually arise from symmetry. If the bath couples only to collective operators,

Sα=∑j=1Nsα(j),S_\alpha = \sum_{j=1}^N s_\alpha^{(j)},

then states or multiplicity spaces that transform identically under all SαS_\alpha can carry protected information.

For collective dephasing,

Sz=∑j=1NZj,S_z=\sum_{j=1}^N Z_j,

each fixed-eigenvalue sector of SzS_z is protected against the dephasing generated by SzS_z itself. Coherence inside the fixed-eigenvalue sector survives; coherence between different sectors decays.

For fully collective SU(2)SU(2) noise with

Sx,Sy,Sz,S_x, \qquad S_y, \qquad S_z,

singlet sectors and representation multiplicity spaces can be protected. This is where angular-momentum decomposition becomes operational: the environment may couple to total spin, while information stored in multiplicity labels is invisible to that coupling.

The symmetry statement is the main point. Protection follows from how the noise algebra acts, not from the physical qubits being far apart or from the state having small energy.

A dark state is annihilated by a jump operator:

J∣ψ⟩=0.J\lvert\psi\rangle=0.

Dark states are common sources of decoherence-free structure. For collective spontaneous emission from two identical two-level systems, the jump operator is

J−=σ−(1)+σ−(2).J_-=\sigma_-^{(1)}+\sigma_-^{(2)}.

The singlet state

∣ψ−⟩=∣ge⟩−∣eg⟩2\lvert\psi_-\rangle = \frac{ \lvert ge\rangle-\lvert eg\rangle } {\sqrt2}

is dark:

J−∣ψ−⟩=0.J_-\lvert\psi_-\rangle=0.

The ground state ∣gg⟩\lvert gg\rangle is also dark. Thus collective decay can protect a dark subspace, but being dark is not the same as being uniquely prepared. A large dark subspace can preserve information; reservoir engineering asks how to make a desired dark state or subspace also attracting.

For the jump-operator language, see Lindblad Operators. For designed attraction into dark states, see Reservoir Engineering.

A decoherence-free subspace is the simplest case. More generally, the protected information may live in a tensor factor inside a sector:

H≅⨁J(HAJ⊗HBJ)⊕K.\mathcal H \cong \bigoplus_J \left( \mathcal H_{A_J}\otimes\mathcal H_{B_J} \right) \oplus \mathcal K.

A noiseless subsystem is a factor HAJ\mathcal H_{A_J} on which the noise acts trivially while it may act nontrivially on HBJ\mathcal H_{B_J}:

Ea∣HAJ⊗HBJ=IAJ⊗Ma,J.E_a \big|_{\mathcal H_{A_J}\otimes\mathcal H_{B_J}} = I_{A_J}\otimes M_{a,J}.

Then a state encoded in AJA_J is protected even if BJB_J changes:

ρAJ⊗ρBJ⟼ρAJ⊗ΦBJ(ρBJ).\rho_{A_J}\otimes\rho_{B_J} \longmapsto \rho_{A_J}\otimes \Phi_{B_J}(\rho_{B_J}).

This is stronger and more flexible than looking only for one subspace on which every error operator is a scalar. It is especially natural when symmetry decomposes the Hilbert space into irreducible representations and multiplicity spaces. The noise may act on the representation factor while leaving the multiplicity factor untouched.

A decoherence-free subspace is related to fixed points, but the concepts are not identical.

If every state supported on C\mathcal C is unchanged by the dissipative part of the generator, then the dissipator has a large fixed set. But the full dynamics on C\mathcal C may still include a Hamiltonian:

ρC(t)=UC(t)ρC(0)UC†(t).\rho_{\mathcal C}(t) = U_{\mathcal C}(t) \rho_{\mathcal C}(0) U_{\mathcal C}^\dagger(t).

Thus the encoded information can evolve unitarily while remaining protected from the specified dissipator. A stationary state is fixed in time; a decoherence-free subspace can support nontrivial logical unitary dynamics.

For the channel-level fixed-point language, see Channel Composition and Fixed Points.

Decoherence-free subspaces are passive error-avoidance structures. They do not require measuring syndromes and applying corrections if the actual noise respects the required symmetry.

Quantum error correction is broader. A code projector PP corrects a set of errors {Ea}\{E_a\} when the Knill–Laflamme condition holds:

PEa†EbP=cabP.P E_a^\dagger E_b P = c_{ab}P.

A decoherence-free subspace is a special, more restrictive case in which the errors act as scalars on the code:

EaP=caPE_a P = c_a P

up to an allowed logical unitary convention. No syndrome is needed because the encoded state was never distinguished by the error.

The tradeoff is clear:

MethodStrengthLimitation
decoherence-free subspacepassive protection against symmetric noisefails when symmetry-breaking noise dominates
noiseless subsystemprotects a logical factor under a noise algebrarequires the correct algebraic decomposition
dynamical decouplingaverages unwanted couplings with control pulsesrequires fast, accurate control
active error correctioncorrects broader error setsneeds syndrome extraction, redundancy, and fault-tolerant design

Detailed code constructions, thresholds, and syndrome circuits belong in quantum information. This page only fixes the open-system mechanism and the canonical conditions.

Real systems rarely satisfy perfect collective symmetry. Suppose the noise operator is

L=Lcollective+ϵLlocal.L = L_{\mathrm{collective}} + \epsilon L_{\mathrm{local}}.

If C\mathcal C is protected against LcollectiveL_{\mathrm{collective}}, decoherence inside C\mathcal C is controlled by the symmetry-breaking term. The leading residual rate often scales with powers of ϵ\epsilon, but the exact scaling depends on the model, spectrum, Hamiltonian leakage, and whether active correction or decoupling is added.

Approximate decoherence-free subspaces are still useful. They can lengthen coherence times, reduce error rates, and provide a natural encoding for a dominant noise channel. But they should be tested against the full noise budget rather than advertised as absolute immunity.

For a candidate subspace C\mathcal C:

  1. List the noise operators or Kraus operators being modeled.
  2. Check whether each operator acts as a scalar on C\mathcal C or as identity on a logical subsystem.
  3. Check whether the Hamiltonian preserves C\mathcal C.
  4. Check whether control pulses, measurements, and leakage channels preserve the encoding.
  5. Compare collective noise rates with independent local noise rates.
  6. Decide whether passive protection is enough or whether dynamical decoupling or active error correction is needed.

The most common failure mode is proving protection against an idealized collective model and then applying the conclusion to a device whose dominant noise is not collective.

  • Calling a subspace decoherence free without specifying the noise model.
  • Confusing collective dephasing with independent local dephasing.
  • Assuming a dark state is automatically an attracting steady state.
  • Forgetting that the Hamiltonian can leak states out of the protected subspace.
  • Treating a one-dimensional dark state as a memory for an arbitrary qubit.
  • Assuming protection from dephasing also protects against amplitude damping, leakage, or measurement crosstalk.
  • Confusing a decoherence-free subspace with a noiseless subsystem.
  • Describing passive DFS protection as a replacement for all quantum error correction.
  • Ignoring symmetry-breaking perturbations and calibration errors.
  • P. Zanardi and M. Rasetti, “Noiseless quantum codes,” Physical Review Letters 79, 3306-3309 (1997).
  • L.-M. Duan and G.-C. Guo, “Preserving coherence in quantum computation by pairing quantum bits,” Physical Review Letters 79, 1953-1956 (1997).
  • D. A. Lidar, I. L. Chuang, and K. B. Whaley, “Decoherence-free subspaces for quantum computation,” Physical Review Letters 81, 2594-2597 (1998).
  • E. Knill, R. Laflamme, and L. Viola, “Theory of quantum error correction for general noise,” Physical Review Letters 84, 2525-2528 (2000).
  • D. Bacon, D. A. Lidar, and K. B. Whaley, “Robustness of decoherence-free subspaces for quantum computation,” Physical Review A 60, 1944-1955 (1999).
  • P. Zanardi, “Stabilizing quantum information,” Physical Review A 63, 012301 (2000).
  • D. A. Lidar and K. B. Whaley, “Decoherence-free subspaces and subsystems,” in Irreversible Quantum Dynamics, Lecture Notes in Physics 622, Springer (2003).
  • D. A. Lidar and T. A. Brun, eds., Quantum Error Correction, Cambridge University Press (2013).
  1. Collective dephasing code. Let L=Z1+Z2L=Z_1+Z_2. Show that every state in span⁡{∣01⟩,∣10⟩}\operatorname{span}\{\lvert01\rangle,\lvert10\rangle\} is annihilated by LL.
Solution

Using Z∣0⟩=∣0⟩Z\lvert0\rangle=\lvert0\rangle and Z∣1⟩=−∣1⟩Z\lvert1\rangle=-\lvert1\rangle,

L∣01⟩=(1−1)∣01⟩=0,L\lvert01\rangle = (1-1)\lvert01\rangle = 0,

and

L∣10⟩=(−1+1)∣10⟩=0.L\lvert10\rangle = (-1+1)\lvert10\rangle = 0.

For any

∣ψ⟩=α∣01⟩+β∣10⟩,\lvert\psi\rangle = \alpha\lvert01\rangle+\beta\lvert10\rangle,

linearity gives

L∣ψ⟩=0.L\lvert\psi\rangle=0.

Thus the whole two-dimensional subspace is decoherence free for this collective dephasing operator.

  1. Independent dephasing failure. For the same encoded states, show that Z1Z_1 distinguishes ∣01⟩\lvert01\rangle and ∣10⟩\lvert10\rangle.
Solution

The first qubit is ∣0⟩\lvert0\rangle in ∣01⟩\lvert01\rangle and ∣1⟩\lvert1\rangle in ∣10⟩\lvert10\rangle. Therefore

Z1∣01⟩=∣01⟩,Z1∣10⟩=−∣10⟩.Z_1\lvert01\rangle=\lvert01\rangle, \qquad Z_1\lvert10\rangle=-\lvert10\rangle.

The two states have different eigenvalues of Z1Z_1. A bath that monitors Z1Z_1 can distinguish them, so the collective-dephasing code is not protected against independent dephasing on qubit 1.

  1. Dissipator vanishes. Suppose L∣ψ⟩=λ∣ψ⟩L\lvert\psi\rangle=\lambda\lvert\psi\rangle for every ∣ψ⟩\lvert\psi\rangle in a subspace C\mathcal C. Show that D[L]ρ=0\mathcal D[L]\rho=0 for any ρ\rho supported on C\mathcal C.
Solution

If ρ=PCρPC\rho=P_{\mathcal C}\rho P_{\mathcal C} and LPC=λPCL P_{\mathcal C}=\lambda P_{\mathcal C}, then

LρL†=∣λ∣2ρ.L\rho L^\dagger = |\lambda|^2\rho.

Also,

L†Lρ=∣λ∣2ρ,ρL†L=∣λ∣2ρ.L^\dagger L\rho = |\lambda|^2\rho, \qquad \rho L^\dagger L = |\lambda|^2\rho.

Therefore

D[L]ρ=LρL†−12{L†L,ρ}=∣λ∣2ρ−∣λ∣2ρ=0.\mathcal D[L]\rho = L\rho L^\dagger - \frac12\{L^\dagger L,\rho\} = |\lambda|^2\rho - |\lambda|^2\rho = 0.
  1. Dark singlet. Let J−=σ−(1)+σ−(2)J_-=\sigma_-^{(1)}+\sigma_-^{(2)} and
∣ψ−⟩=∣ge⟩−∣eg⟩2.\lvert\psi_-\rangle = \frac{\lvert ge\rangle-\lvert eg\rangle}{\sqrt2}.

Show that J−∣ψ−⟩=0J_-\lvert\psi_-\rangle=0.

Solution

The lowering operator gives

J−∣ge⟩=∣gg⟩,J−∣eg⟩=∣gg⟩.J_-\lvert ge\rangle=\lvert gg\rangle, \qquad J_-\lvert eg\rangle=\lvert gg\rangle.

Therefore

J−∣ψ−⟩=∣gg⟩−∣gg⟩2=0.J_-\lvert\psi_-\rangle = \frac{\lvert gg\rangle-\lvert gg\rangle}{\sqrt2} = 0.

The minus sign produces destructive interference in the emission amplitude.

  1. DFS versus QEC. Explain why a decoherence-free subspace is a special case of quantum error correction but does not replace active error correction.
Solution

For a DFS, the relevant errors act as scalars on the code:

EaP=caP.E_aP=c_aP.

Then

PEa†EbP=ca∗cbP,P E_a^\dagger E_b P = c_a^*c_b P,

which satisfies the Knill–Laflamme condition. No syndrome is needed because the error did not distinguish the encoded state.

Active error correction is broader. It can correct errors that move the state into distinguishable syndrome subspaces, provided the syndrome can be measured and corrected without learning the logical state. A DFS protects only against noise with the required symmetry or algebraic action; symmetry-breaking noise generally requires other methods.