Decoherence and Noise
On paper a qubit is a lonely, perfect thing: a state vector
|\psi\rangle that stays exactly where you left it until you choose to act on
it. In a real machine there is no such isolation. Every qubit is a physical object — a superconducting
loop, a trapped ion, a spin — surrounded by a vast, jostling environment of stray
photons, phonons, wandering fields and warm neighbouring atoms. The qubit cannot help but interact with
all of it, and that interaction quietly ruins the delicate superposition you worked so hard to prepare.
This slow, ceaseless corruption is called decoherence, and it is the single biggest
reason building a quantum computer is hard.
The heart of the problem is that the environment acts like an eavesdropper who never looks away. When
the qubit becomes entangled
with its surroundings, those surroundings effectively measure it — and, as with any
measurement, that destroys the phase relationships that make a superposition more than a coin you
haven't flipped. To see precisely what is lost, we need the
density matrix.
Decoherence turns pure into mixed
A qubit you know exactly is a pure state, and its density matrix satisfies
\operatorname{Tr}(\rho^2) = 1. Once the qubit entangles with an environment
you cannot track, the piece in your hand no longer has a state vector of its own — it becomes a
mixed state, and its purity drops:
\rho \ \text{pure } (\operatorname{Tr}\rho^2 = 1) \quad\xrightarrow{\ \text{decoherence}\ }\quad \rho \ \text{mixed } (\operatorname{Tr}\rho^2 < 1).
The damage shows up in a specific place. Recall that the off-diagonal entries of
\rho are the coherences — the fingerprint of a genuine
superposition, the thing that separates |{+}\rangle from an unknown coin.
Decoherence eats the coherences. It leaves the diagonal populations (the plain
probabilities of 0 and 1) more or less intact, but
drives the off-diagonal terms toward zero. When the coherences are gone, an honest superposition has
decayed into a mundane classical mixture, and the quantum advantage evaporates with it.
Two clocks: T1 and T2
Decoherence is usually split into two processes, each measured by its own timescale.
-
T1 — energy relaxation (amplitude damping). The excited state
|1\rangle carries more energy than the ground state
|0\rangle, and the qubit leaks that energy into the environment, decaying
|1\rangle \to |0\rangle. T_1 is the
characteristic time for that decay — the population of |1\rangle
falls like e^{-t/T_1}.
-
T2 — dephasing. Even with no energy exchanged, random shifts in
the qubit's frequency scramble the relative phase between
|0\rangle and |1\rangle. This is exactly the
decay of the off-diagonal coherences, which shrink like e^{-t/T_2}.
The two are linked. Losing energy also randomises phase, so relaxation is one source of
dephasing — but there are usually others (pure dephasing) on top. That forces a hard inequality:
T_2 \ \le\ 2\,T_1.
In words: phase coherence can never outlast twice the energy-relaxation time, and in real devices
T_2 is often noticeably shorter than 2T_1
— phase tends to die first. Keeping both clocks long (microseconds to milliseconds today) is the whole
engineering battle.
The vocabulary of errors: X, Z, and both
When we discretise this continuous damage into "errors" a code can catch, three basic mistakes on a
single qubit cover everything:
-
A bit-flip swaps |0\rangle \leftrightarrow |1\rangle. It
is the Pauli X = \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} operator, the
quantum analogue of a classical bit flipping.
-
A phase-flip leaves |0\rangle alone but sends
|1\rangle \to -|1\rangle. It is the Pauli
Z = \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix} operator, and it has
no classical counterpart — it corrupts the sign, i.e. the phase, that only quantum states
carry.
-
A combined bit-and-phase flip is Y = iXZ. Together with the
identity, \{I, X, Y, Z\} — the Pauli set — spans every single-qubit error,
which is why correcting just X and Z turns out to
be enough to correct anything.
Dephasing (the T_2 process) is essentially a continuous smear of
Z errors; relaxation (T_1) mixes in
X-like flips. Error correction will lean on being able to name the error as a
Pauli.
Worked example: dephasing kills the coherences
Start from the balanced superposition |{+}\rangle, whose density matrix is all
halves:
\rho(0) = |{+}\rangle\langle{+}| = \begin{bmatrix} \tfrac12 & \tfrac12 \\[2pt] \tfrac12 & \tfrac12 \end{bmatrix}.
Pure dephasing leaves the diagonal populations at \tfrac12 but multiplies the
off-diagonal coherences by a shrinking factor e^{-t/T_2}:
\rho(t) = \begin{bmatrix} \tfrac12 & \tfrac12\,e^{-t/T_2} \\[3pt] \tfrac12\,e^{-t/T_2} & \tfrac12 \end{bmatrix}.
At t = 0 the factor is 1 and we have the pure
state. As t \to \infty the factor decays to 0 and
\rho(\infty) = \begin{bmatrix} \tfrac12 & 0 \\[2pt] 0 & \tfrac12 \end{bmatrix} = \tfrac12 I.
The superposition has slid all the way to the maximally mixed state — total ignorance,
\operatorname{Tr}(\rho^2) = \tfrac12. Nothing changed the 50/50 odds of a
computational-basis measurement; what died was the phase information that made
|{+}\rangle predictable in the \pm basis. Slide the
coherence-time control below and watch how a longer T_2 keeps the coherence
alive for longer.
Worked example: a bit-flip with probability p
Prepare the qubit in |0\rangle, so
\rho = |0\rangle\langle 0| = \operatorname{diag}(1, 0). Suppose the noise
applies a bit-flip X with probability p and does
nothing with probability 1-p. Since
X|0\rangle = |1\rangle, the "flip" branch lands in
|1\rangle\langle 1| = \operatorname{diag}(0,1), and the resulting state is the
weighted mixture
\rho' = (1-p)\,|0\rangle\langle 0| + p\,|1\rangle\langle 1| = \begin{bmatrix} 1-p & 0 \\ 0 & p \end{bmatrix}.
A measurement now returns 1 with probability p
instead of never: the bit-flip has injected a p chance of error. For a
concrete number take p = 0.1:
\rho' = \operatorname{diag}(0.9,\, 0.1), with purity
\operatorname{Tr}(\rho'^2) = 0.9^2 + 0.1^2 = 0.82 < 1 — a pure input has been
pushed into a mixed output, exactly the signature of noise.
Picture: the Bloch vector shrinking inward
Every qubit state is a point in the Bloch ball: pure states live on the surface
(length 1), and the maximally mixed \tfrac12 I sits at the dead centre
(length 0). Decoherence is the arrow losing length — sliding off the surface, in toward the middle
— as coherence and population information bleed into the environment. Step through the figure to watch a
crisp pure state decay into a shapeless mixed one.
It helps to picture the environment as a relentless, distracted observer. You never asked it to look,
but every stray photon that scatters off your qubit, every thermal wobble of a nearby atom, carries away
a faint imprint of the qubit's state — and that leakage is a measurement, whether or not anyone
reads the result. This is why a superposition has a shelf life: from the instant you
prepare it, the coherences begin to fade like a photograph left in the sun, on the clock set by
T_2. Every quantum algorithm is therefore a race — you must finish your
computation and read out the answer before the environment finishes "measuring" it for you. Error
correction is the art of extending that shelf life indefinitely, by spreading one fragile logical qubit
across many physical ones so that no single eavesdropping event can learn the encoded state.
Two things to keep straight. First, decoherence is not a single discrete "oops, a gate
misfired" event that happens once and is done. It is a continuous process: the qubit is
perpetually and gradually entangling with its environment, and pure states are steadily turning mixed
the entire time they sit idle — even when you apply no gate at all. (We model the accumulated
damage as random Pauli errors so a code can correct it, but the underlying physics is smooth, not
stroboscopic.) Second, do not assume the energy clock is the binding one. It is tempting to think a qubit
is "fine" as long as it hasn't relaxed, but T_2 — the phase clock — is usually
the shorter of the two, capped by T_2 \le 2T_1. Phase coherence, the
very thing that makes a qubit quantum, is typically the first casualty.
Summary
Decoherence is the reason quantum information is precious and perishable, and it sets the agenda for the
error-correction pages that follow — modelling noise as
quantum channels,
then defeating it with the
three-qubit bit-flip code
and ultimately the
Shor code.
- a real qubit continuously entangles with its environment, which effectively
measures it and turns a pure state (\operatorname{Tr}\rho^2 = 1)
into a mixed one (\operatorname{Tr}\rho^2 < 1);
- the damage lands on the off-diagonal coherences of
\rho, driving them to 0 (e.g.
|{+}\rangle\langle{+}| \to \tfrac12 I);
- T1 is energy relaxation / amplitude damping
(|1\rangle \to |0\rangle, population \sim e^{-t/T_1});
T2 is dephasing (coherence \sim e^{-t/T_2}),
with T_2 \le 2T_1 and often T_2 shorter;
- single-qubit errors are the Paulis: bit-flip X,
phase-flip Z, and their product
Y;
- on the Bloch ball, decoherence shrinks the state vector toward the centre.