Kraus Representation of Quantum Channels
The Kraus, or operator-sum, representation is the single most useful formula in the theory of open quantum systems: it writes the most general physically allowed evolution of a density operator as . Closed systems evolve reversibly, ; but a real qubit is never closed — it leaks energy into phonons, dephases against fluctuating fields, and gets measured. The Kraus theorem says every such irreversible, non-unitary process — provided only that it is linear, completely positive, and trace-preserving (CPTP) — collapses to that one compact sum of "sandwich" terms. Decoherence, dissipation, and measurement back-action are all instances of it. Three viewpoints converge on the same object. The axiomatic view asks that map density operators to density operators even when the system is entangled with an untouched reference — the demand of complete positivity, whose structure theorem is the operator-sum form. The Stinespring dilation view couples the system to a fresh environment, evolves the pair under one global unitary, and traces it away; the Kraus operators are then partial matrix elements . The Choi–Jamiołkowski view sends the channel to a single positive matrix whose eigenvectors hand back a canonical minimal Kraus set. The non-uniqueness of the operators is a feature — it encodes which basis of the environment you never read out — and is exactly what lets error correction discretize a continuum of errors. Every canonical noise model is a short Kraus list whose differential limit is the Lindblad generator.
- A quantum channel is a completely positive, trace-preserving linear map on density operators; its Kraus form is with the completeness relation .
- Every channel is a unitary coupling to an environment followed by a partial trace — the Stinespring dilation — and .
- The Kraus operators are not unique: any two minimal sets are related by a unitary mixing , so channels must be compared by their Choi matrix, never operator-by-operator.
- Complete positivity, not mere positivity, is the physical requirement; the transpose map is positive but not CP and has no Kraus form, whereas the operator-sum structure makes CP manifest.
- The Kraus rank equals the rank of the Choi matrix, at most : at most 4 for a qubit, 9 for a qutrit; amplitude damping needs only 2.
- Key idea: A CPTP map has the operator-sum form with ; equivalently, couple the system to an environment, apply a global unitary, and trace the environment out.
A CPTP map has the operator-sum form with ; this is equivalent to coupling the system to an environment, applying a global unitary, and tracing out the environment.
Where this lives today
The Kraus representation is the data structure of noisy quantum computing. Every error-modelling simulator — Qiskit Aer, Cirq, QuTiP — stores a channel as a list of Kraus operators and applies noise by evaluating after each gate. Characterizing a real device runs the theorem in reverse: process tomography reconstructs the Choi matrix of a gate on superconducting or trapped-ion hardware, then imposes and trace preservation to project the noisy estimate onto a valid CPTP map — without which the fit can carry negative eigenvalues and predict negative probabilities. The amplitude-damping and phase-damping Kraus sets are what experimentalists fit to and decay, and the depolarizing channel is the error model behind randomized benchmarking and the surface-code threshold. The Kraus non-uniqueness is load-bearing in fault tolerance: the discretization of errors — that correcting a basis of Pauli errors corrects the whole continuum a real channel produces — is precisely the statement that any physical Kraus set is a linear combination of correctable ones. And different Kraus unravellings of one Lindblad channel are physically distinct continuous-monitoring schemes, from photon counting to homodyne, all reproducing the same average dynamics.
The physical picture
Picture the system as a qubit colliding with a fresh environment in a known pure state. The two evolve together under one big unitary U, and then you walk away from the environment — you trace it out because you neither control nor read it. Each orthogonal final environment state eₖ labels a branch of the joint wavefunction, and the operator producing that branch is the Kraus operator Kₖ = ⟨eₖ|U|e₀⟩. Summing the branches incoherently, ℰ(ρ) = Σ Kₖ ρ Kₖ†, is exactly the mathematics of forgetting which outcome the environment recorded. The first figure draws it as a circuit. The completeness relation Σ Kₖ† Kₖ = I is just probability conservation: pₖ = Tr(Kₖ ρ Kₖ†) is the probability of the k-th branch, and requiring these to sum to one for every input ρ forces Σ Kₖ† Kₖ = I. Read the other way, {Kₖ† Kₖ} is a POVM — the channel is a generalized measurement whose result you discard, which is why one formula covers both noise and measurement.
Rotating the environment basis before tracing re-mixes the operators as Kⱼ′ = Σₖ Wⱼₖ Kₖ without touching the channel, so the "list of Kraus operators" is a gauge-dependent name for a gauge-invariant object — the channel, equivalently its Choi matrix. Complete positivity, the demand that the channel behave when the system is half of an entangled pair, is manifest: (ℰ ⊗ id)(σ) = Σₖ (Kₖ ⊗ I) σ (Kₖ ⊗ I)† is a sum of terms A σ A†, positive on any positive σ. The second figure makes this concrete with the workhorse channel, amplitude damping — a qubit decaying from its excited state ( relaxation). For γ = 0.2, the Bloch vector of the plus state contracts and tilts toward the ground state.
The core equations
The channel itself is the operator-sum. Everything else — probability conservation, complete positivity, the environment picture — is a corollary of this one shape. Read it as "sandwich the state between an operator and its adjoint, then sum".
where: — the quantum channel, a CPTP linear map on density operators; — input density operator, , ; — Kraus elements, bounded operators on the system Hilbert space; — index over the operators, . Each is an unnormalized positive operator. Trace preservation — probabilities still add to one after the channel acts — is not an extra assumption but a single algebraic constraint, the completeness relation.
where: — identity on the system Hilbert space; — Hermitian adjoint of the -th operator. Equivalently is a POVM; relaxing to gives a trace-non-increasing operation conditioned on an outcome. Every channel has a physical origin — unitary coupling to a pure-state environment, followed by ignoring it. This is the Stinespring dilation, the reason the operator-sum form describes how open-system dynamics actually arises.
where: — unitary on the joint space ; — fixed pure initial environment state; — partial trace over the environment, of dimension . Expanding that partial trace in an orthonormal environment basis extracts the operators: the -th Kraus operator is the block of mapping input to output slice .
where: — orthonormal basis of ; the bra and ket act on the environment only, so is a system operator. Unitarity collapses to the completeness relation (2); a different basis choice is the unitary freedom below. The operators are never unique. Rotating the environment basis by a unitary re-mixes them without changing the channel, so a Kraus list is a gauge choice; compare gauge-invariant data, not raw operator lists.
where: — isometry/unitary mixing matrix (pad the shorter set with zeros to make it square); — a physically identical Kraus set. Two Kraus sets describe the same channel iff such a exists. Complete positivity — that the map stays physical even acting on half of an entangled pair — is automatic here, since is a sum of terms , hence positive on any positive for a reference of any dimension. The invariant object behind the whole story is the Choi matrix: feed one half of an unnormalized maximally entangled state through the channel. It is positive exactly when the map is CP, and its rank is the minimal number of Kraus operators.
where: — unnormalized maximally entangled state; — Choi operator, CP; — column-stacked vectorization of ; the eigenvectors of , rescaled by and unvectorized, are the canonical minimal Kraus set (at most four for a qubit, nine for a qutrit).
The goal is a constructive, both-directions proof that a map admits an operator-sum decomposition exactly when it arises from a unitary on the system plus an environment traced out. We start from any operator set obeying completeness, build an isometry into a larger space, dilate it to a unitary, trace the environment out to recover the operator-sum form, then run the argument backwards to show every dilation returns a valid Kraus set. This is what makes the axiomatic, dilation, and operator-sum pictures literally the same theorem.
Step 1. Take any finite set with and define into with orthonormal. Then , so : is an isometry. Why: completeness is exactly the statement that stacking the outputs into an enlarged space preserves inner products.
Step 2. Any isometry extends to a unitary with , provided : define on by and complete it on the orthogonal complement by Gram–Schmidt. Why: an isometry is a unitary told what to do on only part of its domain; the free rest is the seed of Kraus non-uniqueness.
Step 3. Trace out the environment: , using . Since , this is the Stinespring formula (3) reproducing the operator-sum form (1). Why: orthonormality of the environment basis kills every cross term, collapsing the double sum to the single sum — the content of "forgetting which branch occurred".
Step 4. Converse. Given any dilation, define ; unitarity gives , so completeness holds and the reproduce . Hence "has a dilation" and "has a Kraus set" are equivalent. Why: every operator-sum decomposition is the shadow of some unitary on a bigger space — the physical origin is not an add-on. *Note: the isometry condition holds explicitly for the amplitude-damping operators.*
Go deeper · Derivation B · 1 minComplete positivity forces the operator-sum structure, via Choi
The goal is to prove the equivalence chain that pins down which linear maps are physical channels: is completely positive if and only if its Choi operator is positive semidefinite if and only if it admits a Kraus decomposition. This settles why ordinary positivity — sending states to states — is not enough; the transpose passes that weaker test yet is unphysical. We show CP implies Choi positivity, Choi positivity yields Kraus operators by spectral decomposition, and the Kraus form implies CP, then give the transpose counterexample.
Step 1. CP implies Choi positivity. With and , complete positivity for a reference of dimension gives immediately. Why: the maximally entangled input is the single hardest test — survive it and you survive every positive input, the content of the Choi–Jamiołkowski isomorphism.
Step 2. Choi positivity implies the Kraus form. A positive operator has a spectral decomposition with . Set ; the reconstruction identity then expands into . Why: eigenvectors of are automatically orthogonal Kraus operators, — the canonical minimal set, exactly of them.
Step 3. The Kraus form implies CP. For any reference and any , is a sum of positive operators, hence positive. This closes the loop CP Kraus. Why: the operator-sum form turns complete positivity into a one-line consequence of "a sum of is positive".
Step 4. The sharp counterexample. The transpose is positive — it maps every density matrix to a density matrix. Yet is the swap operator, whose eigenvalues are ; the makes indefinite, so is not CP and has no Kraus form. Why: a machine transposing half of an entangled pair would create negative probabilities — nature forbids it, and the same negativity powers the PPT entanglement criterion. *Note: the transpose map's Choi operator has eigenvalue (from the swap), confirming it is not CP; the amplitude-damping Choi spectrum was also checked numerically.*
Go deeper · Derivation C · 1 minDifferential limit from Kraus operators to the Lindblad generator
The goal is to show that a one-parameter family of channels over an infinitesimal time , expanded to first order, is exactly the Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) master equation — the continuous-time law of Markovian open-system dynamics, bridging the discrete Kraus picture and the differential equation an experimentalist fits to a decaying qubit. We posit a near-identity no-jump operator plus small jump operators, check completeness to first order, and read off the generator.
Step 1. Ansatz. Split into one near-identity term and several small ones: and , with Hermitian and the jump operators. The scaling is forced: a jump contributes at first order only if its amplitude is order . Why: this split is the quantum-trajectory unravelling — is the smooth evolution between random jumps .
Step 2. Completeness to first order. Compute . The anticommutator piece of exactly cancels the jump contribution. Why: this cancellation is the whole reason the "damping" term must appear in — trace preservation fixes it uniquely.
Step 3. Difference quotient. Assemble , keep terms linear in , and form . Why: the cross terms give the Hamiltonian commutator plus half the anticommutator, and the jumps supply — together the Lindblad dissipator.
Step 4. Limit. Letting yields the GKSL master equation , the most general generator of a continuous, Markovian, completely positive semigroup. Why: the Kraus rank becomes the number of jump operators, and the Kraus unitary freedom becomes the freedom to redefine the — the same gauge, now continuous. *Note: the first-order cancellation in Step 2 holds term-by-term, confirming that trace preservation fixes the anticommutator coefficient uniquely.*
Limiting cases
The representation degenerates gracefully: fixing the Kraus rank or the operator structure recovers every familiar dynamics, from reversible gates to full decoherence.
| Case | Result | Meaning |
|---|---|---|
| Unitary (closed) evolution | Kraus rank 1, single operator with ; no environment entanglement, fully reversible. | |
| Projective measurement, outcome discarded | Operators are orthogonal projectors, ; this is pure dephasing / decoherence in the measured basis. | |
| Maximal Kraus rank | The completely depolarizing channel saturates the bound; its Choi matrix is full rank. | |
| Short-time / differential limit | First order in reproduces the Lindblad generator with jump operators . |
Worked examples
1 · Amplitude damping acting on a superposition (fully worked)
A qubit undergoes amplitude damping with (probability of decay). Take the input . Find the output, verify trace preservation, and describe the Bloch-vector motion.
Step 1. Write the operators. , . With , and .
Step 2. The "no-decay" branch scales the coherence by and the excited population by .
Step 3. The "decay" branch — decayed population lands in the ground state.
Step 4. Sum and check. , with and , a valid state. The Bloch vector moves from to : coherence shrank by , and the vector tilted toward the ground pole by . Output , Bloch , trace 1.
2 · Choi matrix and Kraus rank of amplitude damping (numbers)
Build the Choi matrix of the amplitude-damping channel and read off its Kraus rank from the eigenvalues.
Step 1. Compute the channel on the basis dyads. With : , , and (with the conjugate for ).
Step 2. Assemble in the basis :
Step 3. Diagonalize. The nonzero action lives in the block , with trace and determinant , so its eigenvalues are and . With the isolated on the diagonal, the full spectrum is .
Step 4. Read the rank. Two eigenvalues are nonzero, so : the Kraus rank is 2, matching . Their eigenvectors, rescaled by and and unvectorized, are the canonical Kraus set — a unitary mixing of the textbook pair. Choi spectrum , Kraus rank 2, well below the bound .
3 · The Kraus set is a gauge choice (non-uniqueness)
The bit-flip channel with has the natural Kraus set , . Mix them by a Hadamard, , .
Step 1. Expanding , the cross terms and carry opposite signs and cancel, leaving — the original channel exactly (confirmed numerically). The full-matrix primed set and the sparse original describe one channel; only the Choi matrix is unique.
Physics of the portrait
The operator-sum representation is where the algebra of completely positive maps became the everyday toolkit of quantum information — and it carries the name of the physicist who assembled its language.
Origins · 1 minKarl Kraus and how this was discovered
Karl Kraus was a German theoretical physicist who worked on the mathematical foundations of quantum theory in the tradition of Günther Ludwig's operational approach at Marburg. Where earlier authors treated measurement and open-system evolution case by case, Kraus asked what the most general admissible state change could be, subject only to probabilities staying non-negative and normalized even when the system is entangled with a reference. His 1971 papers with Klaus-Ernst Hellwig formalized "operations" and "effects", and his 1983 volume States, Effects, and Operations laid out the operator-sum decomposition so cleanly that the operators have carried his name ever since. The mathematics underneath was older — Stinespring's 1955 dilation theorem and Choi's 1975 theorem — but it was Kraus who translated that functional analysis into the language physicists use for noise, measurement, and decoherence.
Going further
Texts. Nielsen and Chuang, Quantum Computation and Quantum Information, Ch. 8 (Quantum Noise and Quantum Operations) · Preskill, Lecture Notes for Physics 219, Ch. 3 (Foundations II: Measurement and Evolution) · Watrous, The Theory of Quantum Information, Ch. 2 and Ch. 4 (Quantum Channels) · Wilde, Quantum Information Theory, Ch. 4 (The Noisy Quantum Theory) · Kitaev, Shen and Vyalyi, Classical and Quantum Computation, §11 (Quantum operations) · Mermin, Quantum Computer Science, Ch. 6 · Choi, "Completely positive linear maps on complex matrices", Lin. Alg. Appl. 10 (1975) 285 · Kraus, States, Effects, and Operations, Lecture Notes in Physics 190 (1983) · Stinespring, "Positive functions on C*-algebras", Proc. AMS 6 (1955) 211. The key numerical checks are: for amplitude damping, the Choi spectrum at , and the bit-flip two-Kraus-set equality. No numerical constants beyond the explicit matrices and the values are asserted.
Prerequisites. Quantum Channels and Completely Positive Trace-Preserving Maps · Open Quantum Systems and Reduced Dynamics · Decoherence. Leads to. Lindblad / GKSL Master Equation · Process Tomography and the Choi–Jamiołkowski Isomorphism · Depolarizing Channel · Amplitude Damping Channel.
Ask the tutor: Ask me to build the Kraus operators for any noise model you name — depolarizing, phase damping, a custom Stinespring circuit — and I will check completeness, compute its Choi rank, and show you the unitary freedom that hides other equivalent operator sets.
Why isn't ordinary positivity enough — why demand complete positivity?
Because a channel rarely acts on an isolated system. If your qubit is entangled with an untouched reference, the physical evolution is , and that must send the joint state to a valid density matrix. Some maps preserve positivity on their own system but fail this larger test — the transpose maps every single-qubit state to a state, yet on half of a Bell pair it produces a negative eigenvalue, i.e. negative probabilities. Complete positivity is exactly the requirement that stay positive for a reference of any dimension, which the Kraus form guarantees since is a sum of positive terms.
Are the Kraus operators unique, and if not, does the ambiguity matter?
They are not unique. Any two minimal Kraus sets for the same channel are related by a unitary (or isometric) mixing , after padding the shorter set with zeros. The ambiguity reflects a real physical freedom — which basis you would measure the environment in before discarding it — so it is not a defect but information about unrealized measurements. Practically, never compare two channels operator-by-operator, and never attach physical meaning to an individual in isolation. The gauge-invariant summary is the Choi matrix; equal Choi matrices mean equal channels, full stop.
Is the Kraus picture a kind of measurement?
Yes, with a twist. The completeness relation makes a POVM, so applying the channel is formally a generalized measurement with the outcome thrown away. If you kept outcome , the state would collapse to with probability — a selective operation. Summing over without recording it is the deterministic channel. This is why the same mathematics describes both noise (outcome unknown) and measurement (outcome kept): the difference is entirely whether the index is retained.
What is the difference between the Kraus form and the Lindblad master equation?
The Kraus representation is a snapshot: the discrete map over a finite interval, with no assumption of continuous flow. The Lindblad (GKSL) master equation is the generator of a continuous, Markovian family of such maps — the differential version. They connect in the short-time limit: expand a Kraus family to first order, with and , and the difference quotient becomes the Lindblad dissipator. Use Kraus operators for a discrete gate or single noisy step; use Lindblad for continuous, memoryless coupling you want to integrate.
Is the environment in the Stinespring dilation physically real?
It need not be — that is the elegance of the theorem. The dilation guarantees that some environment and some global unitary reproduce any channel, but does not identify them with the actual bath in your lab. The minimal dilation uses an environment of dimension equal to the Kraus rank (), usually far smaller than the astronomically large real one. So the dilation certifies that the channel is physical — unitary evolution on a larger space — and is a computational convenience, not a claim about which degrees of freedom the system truly couples to; different environments can yield the same channel, mirroring the Kraus non-uniqueness.
How do I recover Kraus operators from experimental data?
Through process tomography and the Choi–Jamiołkowski isomorphism. You prepare input states, apply the unknown channel, measure the outputs, and reconstruct the Choi matrix . Because noise can make the raw estimate slightly non-positive, you project it onto the nearest matrix satisfying and trace preservation — a convex optimization. Diagonalizing the physical and setting gives a canonical minimal Kraus set; the count of nonzero eigenvalues is the effective Kraus rank of your device's noise.