The Depolarizing Channel
The depolarizing channel is the most symmetric model of noise: with some probability the qubit is replaced by the maximally mixed state, otherwise it survives untouched. It is isotropic — it has no preferred direction — which makes its action on the Bloch ball especially clean and makes it the workhorse of average-case error analysis.
Definition
For a single qubit, the depolarizing channel with parameter is
With probability nothing happens; with probability the qubit is discarded and reset to the maximally mixed state . At it is the identity; at it is the completely depolarizing channel that erases everything.
Pauli (Kraus) form
Because for any single-qubit (the Pauli "twirl" identity), the channel is a mixture of Pauli operations:
The Kraus operators are therefore and . Check completeness: , since each Pauli squares to . The channel is CPTP, and it is unital () because each Pauli term is.
Action on the Bloch ball
Write . Each Pauli conjugation flips the sign of the two Bloch components orthogonal to it (e.g. sends ). Averaging over kills all three components equally, so the channel shrinks the Bloch vector isotropically toward the center:
The Bloch ball contracts uniformly by the factor ; at every state collapses to the origin . This isotropy is the defining geometric signature of depolarizing noise — contrast it with amplitude damping, whose Bloch map is an asymmetric contraction plus a shift toward the north pole.
Purity and information loss
The shrink factor controls how much information survives. The purity of the output starting from a pure state () is
falling from (pure) at to (maximally mixed) at . The same factor appears in the channel's average fidelity and in its entanglement-breaking threshold (the qubit depolarizing channel becomes entanglement-breaking at ).
Try it
For the qubit depolarizing channel with acting on the pure input (Bloch vector ), compute the output purity . Use the Bloch picture: the output Bloch vector has length , and for a single qubit . Return that number.
Sign in on the full site to ask questions and join the discussion.