Kraus Representation of Quantum Channels
Every physically allowed transformation of a quantum state — a noisy gate, a decohering wire, a measurement whose outcome you forget, a system leaking into its surroundings — is one mathematical object: a quantum channel. Abstractly a channel obeys two demands. It must be completely positive: it sends density operators to density operators, even when acting on only part of a larger entangled system. And it must be trace-preserving: it conserves total probability. Together these are the CPTP conditions — a pair of abstract inequalities on a superoperator, hard to check and hard to build with. The Kraus, or operator-sum, representation turns that abstraction into arithmetic. Every CPTP map can be written as a finite sum of one-sided conjugations by ordinary linear operators , subject to the single constraint . Each term is manifestly positive; the constraint is exactly conservation of probability; and complete positivity is automatic, because the same operators tensored with the identity act correctly on any extension. The whole content of "physically allowed" is compressed into a short list of matrices. That list is not unique — and its non-uniqueness is not a defect but a physical fact, the mathematical shadow of the freedom to read out a hidden environment in any basis. This article builds the operator-sum form from complete positivity, proves exactly how much freedom the carry, and places the Kraus picture at the centre of a triangle with its equivalent siblings, the Stinespring dilation and the Choi matrix.
- The Kraus (operator-sum) representation writes any quantum channel as , with the Kraus operators linear maps from input to output Hilbert space.
- Trace preservation is exactly the completeness relation ; relaxing it to gives a trace non-increasing operation attached to one measurement outcome.
- Having a Kraus form is equivalent to being CPTP — the concrete face of the abstract condition, dual to the Choi matrix and the Stinespring dilation.
- The representation is not unique: and give the same channel iff for an isometry ; only basis-independent quantities are physical.
- A channel on a -dimensional system needs at most Kraus operators — the Kraus rank equals the rank of the Choi matrix and bounds the minimal environment in any dilation.
- Reading exposes the physics: a channel is a unitary on system-plus-environment, then discard the environment.
- Key idea: a CPTP map is exactly a sum of conjugations with ; the Kraus operators are the matrix elements of a system–environment unitary in an environment basis, unique only up to an isometric mixing of the index.
A CPTP map is exactly a sum of one-sided conjugations with ; the Kraus operators are the matrix elements of a system–environment unitary in an environment basis, and they are unique only up to an isometric mixing of the index.
Where this lives today
Kraus operators are the working currency of quantum error correction. Every QEC noise model is a Kraus set — bit flip , depolarising, amplitude and phase damping — and the Knill–Laflamme conditions are stated directly on those operators. Digitising continuous noise into a discrete (often Pauli) Kraus basis is what makes fault tolerance possible: a code that corrects a finite Kraus basis automatically corrects everything in its linear span. To characterise real hardware, process and gate-set tomography reconstruct a channel's Choi matrix from measured data; its eigendecomposition yields a minimal orthogonal Kraus set, and the number of significant eigenvalues — the effective Kraus rank — measures how strongly a superconducting or trapped-ion qubit decoheres, while comparing the dominant Kraus operator to the intended unitary isolates coherent gate error. Open-system simulators either compile a Lindblad master equation into a CPTP map with explicit Kraus operators or unravel it into stochastic trajectories where each jump applies one — and the isometric freedom in the Kraus set is exactly the freedom to choose the unravelling, all reproducing the same averaged density matrix. At the frontier, the complementary channel built from the same Kraus set defines the coherent information governing quantum capacity, and whether that capacity has a single-letter formula (degradability, antidegradability, the open question of superadditivity) is read off from the relation between and .
The physical picture
Think of a channel as a black box that secretly couples your system to a fresh, hidden environment, lets the two interact through one unitary , then throws the environment away — a single story that reproduces every channel there is. If you could recover the discarded environment and measure it in some basis , you would learn "outcome " occurred and your system would jump to with probability . Because you did not look, you average over the branches: . The Kraus operators are precisely those branches — the matrix elements of the joint unitary. The first figure is that story drawn as a circuit.
Each is a partial, non-unitary evolution — it can shrink, rotate, and entangle — but the completeness relation laces the branches together so probabilities still add to one: it is the quantum generalisation of a stochastic matrix whose columns sum to one. The number of independent branches — the Kraus rank — measures how many distinguishable ways the environment carries information off: rank one is reversible unitary evolution, higher rank is genuine decoherence. Crucially the branches are not observer-independent: measuring the environment in a different basis mixes the by a unitary and changes nothing about the channel, so no single Kraus operator is "what really happened." The second figure makes that non-uniqueness concrete on a real channel, with real numbers.
The core equations
The definition is one line: a channel is a sum of one-sided conjugations tied together by a completeness relation that enforces probability conservation. Everything below is a consequence or repackaging of it.
where: — the quantum channel, a CPTP linear map from operators on to operators on ; — Kraus operators, linear maps ; — input density operator, , ; — identity on the input space. Read it as: apply each operator, add the results, and completeness keeps the output a valid state. Trace preservation is not an extra axiom — it is precisely the completeness relation, as cyclicity of the trace shows. This is the single most-used calculation in the subject.
where: the second equality is cyclicity, moving to the front; the last uses . If instead , the trace can only decrease, and is the probability of the associated measurement outcome — a trace non-increasing operation, not a channel. The operator-sum form is not unique: the freedom is exactly an isometry on the Kraus index, and two sets describe the same channel if and only if they are related this way.
where: — an alternative Kraus set for the same channel; — entries of an isometry (a unitary once both sets are padded to equal size); — Kronecker delta. Mixing the branches by any with orthonormal columns leaves the channel untouched — the algebraic image of remeasuring the environment in a rotated basis. The Kraus form is the operator-sum incarnation of the Stinespring dilation: dilate the channel to a unitary on system-plus-environment, fix an environment basis, and each Kraus operator is a block of that unitary.
where: — unitary on ; — fixed initial environment state; — orthonormal environment basis extracting each Kraus operator; — partial trace. Completeness is exactly the statement that is unitary. The Kraus form is also dual to the Choi matrix: diagonalising it hands you a canonical, mutually orthogonal Kraus set whose size is the intrinsic Kraus rank.
where: — unnormalised maximally entangled vector; — Choi matrix, complete positivity; — sub-normalised eigenvectors of , the vectorised canonical Kraus operators; — Kraus rank, the minimal operator count, bounded by (so by when ). The canonical set is Hilbert–Schmidt orthogonal: . The same dilating unitary defines the complementary channel — keep the environment instead of discarding it — whose matrix elements are built from the same Kraus operators, the door to entropy exchange and quantum capacity.
where: — complementary channel, the map from system to environment; — matrix element in the environment basis. Tracing out instead of swaps "kept" and "lost" information; the environment-basis choice mixes the index by the usual isometry .
The goal is the existence half of the theory: to prove that every completely positive map admits a Kraus representation, and that trace preservation forces the completeness relation, by constructing the operators from the spectral decomposition of the Choi matrix. This turns the abstract inequality "complete positivity" into a finite, computable list of matrices that exists whenever the map is a channel. Let be linear on operators of with , and set and .
Step 1. Complete positivity means preserves positivity; since , the Choi matrix . Why: this converts a statement about a superoperator into positivity of a single ordinary matrix, which we can diagonalise.
Step 2. Because , decompose it with eigenvalues absorbed: with , and orthonormal in . Why: positivity makes the eigenvalues non-negative, so their square roots are real and the are well defined — no positivity, no Kraus operators.
Step 3. Devectorise each eigenvector: define by , i.e. . Why: sets up the Choi–Jamiołkowski isomorphism between vectors in and operators , so each eigenvector is an operator in disguise.
Step 4. Contract the second factor of against ; the structure reassembles as . Why: the same isomorphism turns the eigen-expansion of back into the channel — one fact, two writings.
Step 5. Impose trace preservation. Tracing out the output of gives (transposed on ), so is equivalent to . Why: the partial-trace condition on the Choi matrix and the completeness relation are literally the same equation, which is why "trace-preserving" and "" are interchangeable. *The equivalence CP operator-sum form exists is the central result of this derivation. The rank of is the minimal number of Kraus operators, bounded by .*
Go deeper · Derivation B · 1 minThe Kraus operators are unique only up to an isometry
The goal is to pin down exactly how much freedom the operator-sum form carries: to prove that two Kraus sets represent the same channel if and only if they are related by an isometry on the index, so the genuine non-uniqueness is neither more nor less than a change of environment basis. This licenses reshuffling error models and switching between trajectory unravellings without changing the physics — and forbids attaching meaning to any single Kraus operator. Take two Kraus sets and into ; pad the shorter with zeros so .
Step 1. Sufficiency by direct substitution. If with , then . Why: the isometry relation collapses the double sum to a single diagonal one, so an isometric mixing provably leaves the channel invariant.
Step 2. For necessity, encode each set as one purifying vector, and ; tracing out the ancilla returns the Choi matrix. Why: bundling the set into one state turns "same channel" into "same reduced state," which we can answer.
Step 3. Equal channels have equal Choi matrices, so and purify the same positive operator . By the HJW / GHJW theorem, any two purifications are related by an isometry on the purifying system: . Why: purifications of a fixed operator form one isometry-equivalence class — the operator version of the fact that all ensembles of a density matrix are unitarily related.
Step 4. Devectorise to with , which guarantees both sets obey completeness. Why: the Choi–Jamiołkowski dictionary turns the vector relation into the operator mixing, closing the equivalence both ways. *Padding the shorter Kraus set with zero operators makes a genuine unitary on the larger index set, completing the equivalence in both directions.*
Go deeper · Derivation C · 1 minOne dephasing channel written two ways, checked with numbers
The goal is to make non-uniqueness fully concrete: to write one physical channel — phase damping that shrinks a qubit's off-diagonal coherence to a factor of its input — in two visibly different Kraus sets, verify by matrix multiplication that both give the identical map, and exhibit the explicit isometry linking them. Parametrising by the coherence-survival factor (not a decay probability) makes the two forms equal at the same parameter; we take so every entry is checkable by hand. The target action is .
Step 1. Random-unitary form: and . Completeness: . Off-diagonal: . Why: a random application of or , whose branch flips the sign of the coherence, so mixing them attenuates it by exactly .
Step 2. Diagonal "damping" form: and . Completeness: . The upper-right entry of is , and contributes nothing off-diagonal. Why: the "environment reads the populations" form looks nothing like Step 1 yet must give the same map.
Step 3. Both maps send , fixing populations and multiplying coherences by ; direct multiplication confirms identical output on every . Why: two different-looking lists implement one channel, so their difference cannot be physical.
Step 4. The isometry: satisfies , and , reproduce and exactly. Why: the previous derivation guarantees such a exists — here it is with numerical entries, non-uniqueness demonstrated rather than asserted. *Both sets satisfy ; direct matrix multiplication confirms that both reproduce ; and the isometry maps Set A to Set B exactly.*
Limiting cases
Special cases of the operator-sum form recover the familiar transformations, each fixed by how many Kraus operators survive.
| Case | Result | Meaning |
|---|---|---|
| Unitary (closed) evolution | A single Kraus operator, Kraus rank . No environment is entangled; the evolution is reversible and entropy-preserving. | |
| Measurement with recorded outcome | A quantum instrument: the index is copied to a classical register. Each is a POVM element and . | |
| Random unitary / dephasing | are proportional to unitaries; unital. Qubit dephasing uses . | |
| Amplitude damping (non-unital) | Models spontaneous emission. takes ; but . | |
| Trace non-increasing operation | One outcome of a selective measurement; is its probability. Renormalise to get the post-selected state. |
Worked examples
1 · The depolarising channel: completeness and Kraus rank (fully worked)
The depolarising channel mixes in white noise: . Take ; read off the Kraus operators, verify completeness, find the Bloch-vector effect, and state the Kraus rank.
Step 1. The four Kraus operators are and . Four Pauli-proportional operators.
Step 2. Completeness: since , . Trace-preserving for every . Σ Kᵢ†Kᵢ = I confirmed.
Step 3. Effect on : each Pauli conjugation flips the sign of the two orthogonal Bloch components, so and the Bloch vector contracts uniformly, . The Bloch ball shrinks isotropically by 0.6 toward the maximally mixed centre.
Step 4. Kraus rank: are Hilbert–Schmidt orthogonal, so none is redundant and the rank is — the maximum a qubit channel can have, saturating . Any representation with more operators reduces to these four. Kraus rank = 4 (maximal).
2 · Amplitude damping: completeness, non-unitality, and a decayed population
The amplitude-damping channel with has and . Verify completeness, show it is non-unital, and evolve the excited state .
Step 1. Completeness: and , so . The channel is trace-preserving. Σ Kᵢ†Kᵢ = I confirmed.
Step 2. The other combination: and , so — the channel is non-unital, draining population toward the ground state rather than fixing the maximally mixed state. Σ KᵢKᵢ† = diag(1.3, 0.7) ≠ I.
Step 3. Evolve : and sum to — a fraction of the excited population has decayed to ground, exactly as spontaneous emission over one interval should. |1⟩⟨1| ↦ 0.3 |0⟩⟨0| + 0.7 |1⟩⟨1|.
Physics of the portrait
The operator-sum representation answers a foundational question — what is the most general way a quantum state can change? — and bears the name of the physicist who posed it.
Origins · 1 minKarl Kraus and how this was discovered
Karl Kraus (born 21 March 1938 in Hohenelbe, today Vrchlabí; died 9 June 1988) took his doctorate in 1962 under Kurt Just, then became an assistant to Günther Ludwig at Marburg. It was Ludwig's operational programme — describing quantum theory through states, effects, and operations rather than wavefunctions alone — that shaped his central contribution. In a 1971 Annals of Physics paper, "General state changes in quantum theory," Kraus asked precisely the right question: what is the most general map that must send every valid quantum state to another valid state, even when the system is entangled with a reference it never touches? The answer is the operator-sum form now universally called the Kraus representation. He built on Stinespring's 1955 dilation theorem and worked alongside the matrix criterion Choi published in 1975; his 1983 Springer lecture notes, States, Effects, and Operations, unified states, effects (POVM elements), and operations into a language now standard across quantum information. Appointed professor at Würzburg in 1971, he died in 1988 at fifty — but the operators bearing his name are today the everyday vocabulary of quantum error correction, open-system simulation, and channel-capacity theory.
Going further
Texts. Nielsen and Chuang, Quantum Computation and Quantum Information, §8.2–8.3 · Preskill, Lecture Notes for Physics 219, Ch. 3 · Watrous, The Theory of Quantum Information, Ch. 2 · Wilde, Quantum Information Theory, Ch. 4 · Kitaev, Shen and Vyalyi, Classical and Quantum Computation, §11 (superoperators). Key results to keep in mind: existence of the operator-sum form follows from diagonalising the Choi matrix and confirming CP; the unitary-freedom theorem gives ; the Kraus-rank bound is from ; trace preservation re-derives via cyclicity. For the phase-damping example at : both sets satisfy , both send , and (with ) maps Set A to Set B. For amplitude damping at : and .
Builds on: Quantum Channels and Completely Positive Trace-Preserving Maps · Von Neumann Entropy · Stinespring Dilation Theorem. Leads to: Choi–Jamiołkowski Isomorphism · Complementary Channels and Degradability · Data-Processing Inequality · Schumacher Quantum Data Compression.
Ask the tutor: ask me to build the explicit Kraus operators for any channel you name — bit flip, depolarising, amplitude damping — and I will check completeness, find the Kraus rank from the Choi matrix, and show you a second, isometry-related set for the very same channel.
Why isn't the Kraus decomposition of a channel unique?
Because the discarded environment has no preferred basis. The Kraus operators are the blocks of the dilating unitary in a chosen environment basis; choose a different basis and you mix them by a unitary , giving — the identical channel. Padding with zeros is a further trivial freedom. The invariant content survives all such changes: the channel, its Kraus rank, the Choi spectrum, and any entropy computed from them.
What is the Kraus rank and why does it matter?
The Kraus rank is the minimal number of Kraus operators for a channel, equal to the rank of the Choi matrix. Unlike the raw count — which you can inflate by adding zeros — the rank is intrinsic. It bounds the smallest environment in any Stinespring dilation, so it measures how many distinguishable "ways to leak" the channel has: rank is reversible unitary evolution, higher rank is genuine decoherence. In tomography the number of significant Choi eigenvalues is the effective rank, a direct read-out of device noise. For a -dimensional system it never exceeds .
Why is the completeness relation Σ Kᵢ†Kᵢ = I and not Σ KᵢKᵢ† = I?
Trace preservation demands for every input. By cyclicity , which equals for all only if — daggers inside, acting on the input space. The other combination equals and is only for a unital channel. Amplitude damping is the standard non-unital counterexample, with .
How does the Kraus form relate to the Stinespring and Choi pictures?
Three faces of one object. Stinespring writes the channel as ; contracting in an environment basis gives . Choi packs the channel into one positive matrix , and diagonalising returns a canonical orthogonal Kraus set. Use Stinespring for complementary channels and entropy, Choi to test complete positivity (), and Kraus for explicit error-model algebra. The Kraus unitary freedom is the same as the environment-basis choice in Stinespring and the eigenbasis degeneracy in Choi.
Can a channel require infinitely many Kraus operators?
Not in finite dimensions. The Choi matrix of a channel between dimensions and is , so its rank — the Kraus rank — is at most , and that many operators always suffice. You may write more (padding with zeros) but never need more, since diagonalising the Choi matrix reduces any representation to the minimal orthogonal one. Infinitely many operators arise only in infinite-dimensional (continuous-variable) settings, where the Choi operator can have infinite rank.
Is an individual Kraus operator something physical that happened?
No. Reading as "error occurred with some probability" is basis-dependent: a different valid set describes the same channel and corresponds to measuring the environment in a rotated basis, a choice no experiment on the system alone can settle. Two people can disagree about "which error happened" yet agree on every prediction. Only basis-independent quantities are real. When a specific unravelling is singled out (a photodetector clicks), that fixes a basis — but then the measurement, not the Kraus form, does the work.
How do I get Kraus operators for a real, measured noise process?
Run process or gate-set tomography to reconstruct the Choi matrix , then diagonalise it: . Each eigenvector, rescaled by and devectorised through the maximally entangled state, is a canonical, Hilbert–Schmidt-orthogonal Kraus operator; the eigenvalues above the noise floor give the effective Kraus rank. Comparing the dominant Kraus operator to the intended gate isolates coherent error, while the smaller eigenvalues quantify decoherence — the split that tells you whether a gate is calibration- or decoherence-limited.