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 E(ρ)=∑kKkρKk†\mathcal{E}(\rho)=\sum_k K_k\rho K_k^\dagger. Closed systems evolve reversibly, ρ↦UρU†\rho\mapsto U\rho U^\dagger; 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 E\mathcal{E} 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 Kk=⟨ek∣U∣e0⟩K_k=\langle e_k|U|e_0\rangle. 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.

Key takeaways
  • A quantum channel is a completely positive, trace-preserving linear map on density operators; its Kraus form is E(ρ)=∑kKkρKk†\mathcal{E}(\rho)=\sum_k K_k\rho K_k^\dagger with the completeness relation ∑kKk†Kk=I\sum_k K_k^\dagger K_k=I.
  • Every channel is a unitary coupling to an environment followed by a partial trace — the Stinespring dilation E(ρ)=TrE[U(ρ⊗∣e0⟩⟨e0∣)U†]\mathcal{E}(\rho)=\mathrm{Tr}_E[U(\rho\otimes|e_0\rangle\langle e_0|)U^\dagger] — and Kk=⟨ek∣U∣e0⟩K_k=\langle e_k|U|e_0\rangle.
  • The Kraus operators are not unique: any two minimal sets are related by a unitary mixing Kj′=∑kWjkKkK_j'=\sum_k W_{jk}K_k, 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 d2d^2: 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 E(ρ)=∑kKkρKk†\mathcal{E}(\rho)=\sum_k K_k\rho K_k^\dagger with ∑kKk†Kk=I\sum_k K_k^\dagger K_k=I; equivalently, couple the system to an environment, apply a global unitary, and trace the environment out.
The core insight

A CPTP map E\mathcal{E} has the operator-sum form E(ρ)=∑kKkρKk†\mathcal{E}(\rho)=\sum_k K_k\rho K_k^\dagger with ∑kKk†Kk=I\sum_k K_k^\dagger K_k=I; 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 ∑kKkρKk†\sum_k K_k\rho K_k^\dagger 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 J⪰0J\succeq0 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 T1T_1 and T2T_2 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.

Figure
Stinespring dilation as a circuit: the system ρ and a fresh environment enter one global unitary U, then the environment is traced out. Each outcome eₖ picks off a Kraus operator Kₖ = ⟨eₖ U e₀⟩, and forgetting the outcome gives ℰ(ρ) = Σ Kₖ ρ Kₖ† obeying Σ Kₖ† Kₖ = I
Couple, evolve, discard — the Kraus operators are matrix elements of one unitary U U system ρ environment |e₀⟩ ℰ(ρ) = Σ Kₖ ρ Kₖ† trace out basis {|eₖ⟩} Kₖ = ⟨eₖ| U |e₀⟩ Σₖ Kₖ† Kₖ = I

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 (T1T_1 relaxation). For γ = 0.2, the Bloch vector of the plus state contracts and tilts toward the ground state.

Figure
Amplitude damping with γ = 0.2 acting on the plus state in the x–z plane of the Bloch sphere: population flows from excited to ground so the vector tilts up by γ = 0.2, and the coherence shrinks by √(1−γ) = 0.894, moving the Bloch vector from (1, 0, 0) to (0.894, 0, 0.2)
Amplitude damping (γ = 0.2): coherence ×√(1−γ) = 0.894, population tilts by γ x = ⟨X⟩ z (|0⟩) (|1⟩) |+⟩ (1, 0, 0) ℰ(|+⟩) (0.894, 0, 0.2) K₀ = ⎡1 0 ⎤ K₁ = ⎡0 √γ⎤ ⎣0 √(1−γ)⎦ ⎣0 0 ⎦ ρ = |+⟩⟨+| = ½[[1,1],[1,1]] ℰ(ρ) = [[0.6, 0.447], [0.447, 0.4]] Tr ℰ(ρ) = 1.0 (trace preserved) K₀†K₀ + K₁†K₁ = diag(1, 1−γ) + diag(0, γ) = I γ = 1 − e^(−t/T₁) ties this to relaxation

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".

E(ρ)=∑kKk ρ Kk†(1)\mathcal{E}(\rho)=\sum_{k} K_k\,\rho\,K_k^{\dagger} \qquad (1)

where: E\mathcal{E} — the quantum channel, a CPTP linear map on density operators; ρ\rho — input density operator, ρ⪰0\rho\succeq 0, Tr ρ=1\mathrm{Tr}\,\rho=1; KkK_k — Kraus elements, bounded operators on the system Hilbert space; kk — index over the operators, 1≤k≤rKraus1\le k\le r_{\mathrm{Kraus}}. Each KkρKk†K_k\rho K_k^\dagger 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.

∑kKk†Kk=I(2)\sum_{k} K_k^{\dagger} K_k = I \qquad (2)

where: II — identity on the system Hilbert space; Kk†K_k^\dagger — Hermitian adjoint of the kk-th operator. Equivalently {Kk†Kk}\{K_k^\dagger K_k\} is a POVM; relaxing to ∑kKk†Kk⪯I\sum_k K_k^\dagger K_k\preceq I 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.

E(ρ)=TrE ⁣[ U (ρ⊗∣e0⟩⟨e0∣) U†](3)\mathcal{E}(\rho)=\mathrm{Tr}_E\!\big[\,U\,(\rho\otimes|e_0\rangle\langle e_0|)\,U^{\dagger}\big] \qquad (3)

where: UU — unitary on the joint space HS⊗HE\mathcal{H}_S\otimes\mathcal{H}_E; ∣e0⟩|e_0\rangle — fixed pure initial environment state; TrE\mathrm{Tr}_E — partial trace over the environment, of dimension ≤rKraus≤d2\le r_{\mathrm{Kraus}}\le d^2. Expanding that partial trace in an orthonormal environment basis extracts the operators: the kk-th Kraus operator is the block of UU mapping input ∣e0⟩|e_0\rangle to output slice ∣ek⟩|e_k\rangle.

Kk=⟨ek∣ U ∣e0⟩(4)K_k=\langle e_k|\,U\,|e_0\rangle \qquad (4)

where: {∣ek⟩}\{|e_k\rangle\} — orthonormal basis of HE\mathcal{H}_E; the bra and ket act on the environment only, so KkK_k is a system operator. Unitarity U†U=IU^\dagger U=I 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 WW re-mixes them without changing the channel, so a Kraus list is a gauge choice; compare gauge-invariant data, not raw operator lists.

Kj′=∑kWjk Kk,W†W=I(5)K_j' = \sum_{k} W_{jk}\,K_k,\qquad W^\dagger W = I \qquad (5)

where: WW — isometry/unitary mixing matrix (pad the shorter set with zeros to make it square); Kj′K_j' — a physically identical Kraus set. Two Kraus sets describe the same channel iff such a WW exists. Complete positivity — that the map stays physical even acting on half of an entangled pair — is automatic here, since (E⊗id)(σ)=∑k(Kk⊗I) σ (Kk⊗I)†(\mathcal{E}\otimes\mathrm{id})(\sigma)=\sum_k (K_k\otimes I)\,\sigma\,(K_k\otimes I)^{\dagger} is a sum of terms AσA†⪰0A\sigma A^\dagger\succeq0, hence positive on any positive σ\sigma 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.

J(E)=(E⊗id)(∣Ω⟩⟨Ω∣)=∑k∣Kk⟩⟩⟨⟨Kk∣,rKraus=rank J≤d2(6)J(\mathcal{E})=(\mathcal{E}\otimes\mathrm{id})\big(|\Omega\rangle\langle\Omega|\big)=\sum_k |K_k\rangle\rangle\langle\langle K_k|,\qquad r_{\mathrm{Kraus}}=\mathrm{rank}\,J\le d^2 \qquad (6)

where: ∣Ω⟩=∑i∣i⟩∣i⟩|\Omega\rangle=\sum_i|i\rangle|i\rangle — unnormalized maximally entangled state; J(E)J(\mathcal{E}) — Choi operator, J⪰0  ⟺  EJ\succeq0\iff\mathcal{E} CP; ∣Kk⟩⟩|K_k\rangle\rangle — column-stacked vectorization of KkK_k; the eigenvectors of JJ, rescaled by λk\sqrt{\lambda_k} and unvectorized, are the canonical minimal Kraus set (at most four for a qubit, nine for a qutrit).

Derivation AKraus theorem from the Stinespring dilation

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 {Kk}\{K_k\} with ∑kKk†Kk=I\sum_k K_k^\dagger K_k=I and define V∣ψ⟩:=∑k(Kk∣ψ⟩)⊗∣ek⟩V|\psi\rangle:=\sum_k (K_k|\psi\rangle)\otimes|e_k\rangle into HS⊗HE\mathcal{H}_S\otimes\mathcal{H}_E with {∣ek⟩}\{|e_k\rangle\} orthonormal. Then ⟨Vϕ∣Vψ⟩=∑k⟨ϕ∣Kk†Kk∣ψ⟩=⟨ϕ∣ψ⟩\langle V\phi|V\psi\rangle=\sum_{k}\langle\phi|K_k^\dagger K_k|\psi\rangle=\langle\phi|\psi\rangle, so V†V=IV^\dagger V=I: VV 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 UU with V∣ψ⟩=U(∣ψ⟩⊗∣e0⟩)V|\psi\rangle=U(|\psi\rangle\otimes|e_0\rangle), provided dim⁡HE≥rKraus\dim\mathcal{H}_E\ge r_{\mathrm{Kraus}}: define UU on HS⊗∣e0⟩\mathcal{H}_S\otimes|e_0\rangle by VV 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: TrE[VρV†]=∑k,k′KkρKk′† ⟨ek′∣ek⟩=∑kKkρKk†\mathrm{Tr}_E[V\rho V^\dagger]=\sum_{k,k'}K_k\rho K_{k'}^\dagger\,\langle e_{k'}|e_k\rangle=\sum_k K_k\rho K_k^\dagger, using ⟨ek′∣ek⟩=δkk′\langle e_{k'}|e_k\rangle=\delta_{kk'}. Since VρV†=U(ρ⊗∣e0⟩⟨e0∣)U†V\rho V^\dagger=U(\rho\otimes|e_0\rangle\langle e_0|)U^\dagger, 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 Kk:=⟨ek∣U∣e0⟩K_k:=\langle e_k|U|e_0\rangle; unitarity gives ∑kKk†Kk=⟨e0∣U†U∣e0⟩=I\sum_k K_k^\dagger K_k=\langle e_0|U^\dagger U|e_0\rangle=I, so completeness holds and the KkK_k reproduce E\mathcal{E}. 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 V†V=∑kKk†Kk=IV^\dagger V=\sum_k K_k^\dagger K_k=I holds explicitly for the amplitude-damping operators.*

Go deeper · Derivation B · 1 minComplete positivity forces the operator-sum structure, via Choi
Derivation BComplete 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: E\mathcal{E} 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 J(E)=(E⊗id)(∣Ω⟩⟨Ω∣)J(\mathcal{E})=(\mathcal{E}\otimes\mathrm{id})(|\Omega\rangle\langle\Omega|) and ∣Ω⟩⟨Ω∣⪰0|\Omega\rangle\langle\Omega|\succeq0, complete positivity for a reference of dimension dd gives J⪰0J\succeq0 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 J=∑kλk∣vk⟩⟨vk∣J=\sum_k\lambda_k|v_k\rangle\langle v_k| with λk≥0\lambda_k\ge0. Set Kk=λk unvec(∣vk⟩)K_k=\sqrt{\lambda_k}\,\mathrm{unvec}(|v_k\rangle); the reconstruction identity E(ρ)=Tr2[J (I⊗ρT)]\mathcal{E}(\rho)=\mathrm{Tr}_2[J\,(I\otimes\rho^{T})] then expands into ∑kKkρKk†\sum_k K_k\rho K_k^\dagger. Why: eigenvectors of JJ are automatically orthogonal Kraus operators, Tr(Kj†Kk)=λkδjk\mathrm{Tr}(K_j^\dagger K_k)=\lambda_k\delta_{jk} — the canonical minimal set, exactly rank J\mathrm{rank}\,J of them.

Step 3. The Kraus form implies CP. For any reference and any σ⪰0\sigma\succeq0, (E⊗id)(σ)=∑k(Kk⊗I)σ(Kk⊗I)†(\mathcal{E}\otimes\mathrm{id})(\sigma)=\sum_k(K_k\otimes I)\sigma(K_k\otimes I)^\dagger is a sum of positive operators, hence positive. This closes the loop CP ⇔J⪰0⇔\Leftrightarrow J\succeq0\Leftrightarrow Kraus. Why: the operator-sum form turns complete positivity into a one-line consequence of "a sum of AσA†A\sigma A^\dagger is positive".

Step 4. The sharp counterexample. The transpose T:ρ↦ρTT:\rho\mapsto\rho^{T} is positive — it maps every density matrix to a density matrix. Yet (T⊗id)(∣Ω⟩⟨Ω∣)(T\otimes\mathrm{id})(|\Omega\rangle\langle\Omega|) is the swap operator, whose eigenvalues are ±1\pm1; the −1-1 makes J(T)J(T) indefinite, so TT 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 −1-1 (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
Derivation CDifferential limit from Kraus operators to the Lindblad generator

The goal is to show that a one-parameter family of channels over an infinitesimal time dt\mathrm{d}t, 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: K0=I−(iH+12∑jLj†Lj)dtK_0=I-\big(iH+\tfrac12\sum_j L_j^\dagger L_j\big)\mathrm{d}t and Kj=dt LjK_j=\sqrt{\mathrm{d}t}\,L_j, with HH Hermitian and LjL_j the jump operators. The dt\sqrt{\mathrm{d}t} scaling is forced: a jump contributes at first order only if its amplitude is order dt\sqrt{\mathrm{d}t}. Why: this split is the quantum-trajectory unravelling — K0K_0 is the smooth evolution between random jumps KjK_j.

Step 2. Completeness to first order. Compute ∑kKk†Kk=K0†K0+∑jKj†Kj=(I−∑jLj†Lj dt)+∑jLj†Lj dt+O(dt2)=I\sum_k K_k^\dagger K_k=K_0^\dagger K_0+\sum_j K_j^\dagger K_j=\big(I-\sum_j L_j^\dagger L_j\,\mathrm{d}t\big)+\sum_j L_j^\dagger L_j\,\mathrm{d}t+O(\mathrm{d}t^2)=I. The anticommutator piece of K0†K0K_0^\dagger K_0 exactly cancels the jump contribution. Why: this cancellation is the whole reason the 12{Lj†Lj,⋅}\tfrac12\{L_j^\dagger L_j,\cdot\} "damping" term must appear in K0K_0 — trace preservation fixes it uniquely.

Step 3. Difference quotient. Assemble Edt(ρ)=K0ρK0†+∑jKjρKj†\mathcal{E}_{\mathrm{d}t}(\rho)=K_0\rho K_0^\dagger+\sum_j K_j\rho K_j^\dagger, keep terms linear in dt\mathrm{d}t, and form Edt(ρ)−ρdt=−i[H,ρ]+∑j(LjρLj†−12{Lj†Lj,ρ})+O(dt)\dfrac{\mathcal{E}_{\mathrm{d}t}(\rho)-\rho}{\mathrm{d}t}=-i[H,\rho]+\sum_j\big(L_j\rho L_j^\dagger-\tfrac12\{L_j^\dagger L_j,\rho\}\big)+O(\mathrm{d}t). Why: the K0ρK0†K_0\rho K_0^\dagger cross terms give the Hamiltonian commutator plus half the anticommutator, and the jumps supply LjρLj†L_j\rho L_j^\dagger — together the Lindblad dissipator.

Step 4. Limit. Letting dt→0\mathrm{d}t\to0 yields the GKSL master equation ρ˙=−i[H,ρ]+∑j(LjρLj†−12{Lj†Lj,ρ})\dot\rho=-i[H,\rho]+\sum_j\big(L_j\rho L_j^\dagger-\tfrac12\{L_j^\dagger L_j,\rho\}\big), 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 LjL_j — 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.

CaseResultMeaning
Unitary (closed) evolutionE(ρ)=UρU†\mathcal{E}(\rho)=U\rho U^\daggerKraus rank 1, single operator K1=UK_1=U with U†U=IU^\dagger U=I; no environment entanglement, fully reversible.
Projective measurement, outcome discardedE(ρ)=∑kPkρPk\mathcal{E}(\rho)=\sum_k P_k\rho P_kOperators are orthogonal projectors, ∑kPk=I\sum_k P_k=I; this is pure dephasing / decoherence in the measured basis.
Maximal Kraus rankrKraus=d2r_{\mathrm{Kraus}}=d^2The completely depolarizing channel E(ρ)=I/d\mathcal{E}(\rho)=I/d saturates the bound; its Choi matrix is full rank.
Short-time / differential limitK0≈I−(iH+12∑jLj†Lj)dt, Kj≈dt LjK_0\approx I-\big(iH+\tfrac12\sum_j L_j^\dagger L_j\big)\mathrm{d}t,\ K_j\approx\sqrt{\mathrm{d}t}\,L_jFirst order in dt\mathrm{d}t reproduces the Lindblad generator with jump operators LjL_j.

Worked examples

1 · Amplitude damping acting on a superposition (fully worked)

A qubit undergoes amplitude damping with γ=0.2\gamma=0.2 (probability of ∣1⟩→∣0⟩|1\rangle\to|0\rangle decay). Take the input ρ=∣+⟩⟨+∣=12(1111)\rho=|+\rangle\langle+|=\tfrac12\begin{pmatrix}1&1\\1&1\end{pmatrix}. Find the output, verify trace preservation, and describe the Bloch-vector motion.

Step 1. Write the operators. K0=(1001−γ)K_0=\begin{pmatrix}1&0\\0&\sqrt{1-\gamma}\end{pmatrix}, K1=(0γ00)K_1=\begin{pmatrix}0&\sqrt{\gamma}\\0&0\end{pmatrix}. With γ=0.2\gamma=0.2, 1−γ=0.894\sqrt{1-\gamma}=\mathbf{0.894} and γ=0.447\sqrt{\gamma}=0.447.

Step 2. The "no-decay" branch K0ρK0†=(0.50.4470.4470.4)K_0\rho K_0^\dagger=\begin{pmatrix}0.5&0.447\\0.447&0.4\end{pmatrix} scales the coherence by 1−γ\sqrt{1-\gamma} and the excited population by 1−γ1-\gamma.

Step 3. The "decay" branch K1ρK1†=(γρ11000)=(0.1000)K_1\rho K_1^\dagger=\begin{pmatrix}\gamma\rho_{11}&0\\0&0\end{pmatrix}=\begin{pmatrix}0.1&0\\0&0\end{pmatrix} — decayed population lands in the ground state.

Step 4. Sum and check. E(ρ)=(0.60.4470.4470.4)\mathcal{E}(\rho)=\begin{pmatrix}0.6&0.447\\0.447&0.4\end{pmatrix}, with Tr=1.0\mathrm{Tr}=\mathbf{1.0} and det⁡=0.04≥0\det=0.04\ge0, a valid state. The Bloch vector moves from (1,0,0)(1,0,0) to (1−γ,0,γ)=(0.894,0,0.2)\big(\sqrt{1-\gamma},0,\gamma\big)=\mathbf{(0.894,0,0.2)}: coherence shrank by 1−γ\sqrt{1-\gamma}, and the vector tilted toward the ground pole by γ\gamma. Output (0.60.4470.4470.4)\begin{pmatrix}0.6&0.447\\0.447&0.4\end{pmatrix}, Bloch (0.894,0,0.2)(0.894,0,0.2), trace 1.

2 · Choi matrix and Kraus rank of amplitude damping (numbers)

Build the Choi matrix of the γ=0.2\gamma=0.2 amplitude-damping channel and read off its Kraus rank from the eigenvalues.

Step 1. Compute the channel on the basis dyads. With s=1−γ=0.894s=\sqrt{1-\gamma}=0.894: E(∣0⟩⟨0∣)=∣0⟩⟨0∣\mathcal{E}(|0\rangle\langle0|)=|0\rangle\langle0|, E(∣1⟩⟨1∣)=γ∣0⟩⟨0∣+(1−γ)∣1⟩⟨1∣\mathcal{E}(|1\rangle\langle1|)=\gamma|0\rangle\langle0|+(1-\gamma)|1\rangle\langle1|, and E(∣0⟩⟨1∣)=s ∣0⟩⟨1∣\mathcal{E}(|0\rangle\langle1|)=s\,|0\rangle\langle1| (with the conjugate for ∣1⟩⟨0∣|1\rangle\langle0|).

Step 2. Assemble J=∑ij∣i⟩⟨j∣⊗E(∣i⟩⟨j∣)J=\sum_{ij}|i\rangle\langle j|\otimes\mathcal{E}(|i\rangle\langle j|) in the basis {∣00⟩,∣01⟩,∣10⟩,∣11⟩}\{|00\rangle,|01\rangle,|10\rangle,|11\rangle\}:

J=(100s000000γ0s001−γ)=(1000.8940000000.200.894000.8).J=\begin{pmatrix}1&0&0&s\\0&0&0&0\\0&0&\gamma&0\\s&0&0&1-\gamma\end{pmatrix}=\begin{pmatrix}1&0&0&0.894\\0&0&0&0\\0&0&0.2&0\\0.894&0&0&0.8\end{pmatrix}.

Step 3. Diagonalize. The nonzero action lives in the {∣00⟩,∣11⟩}\{|00\rangle,|11\rangle\} block (1ss1−γ)\begin{pmatrix}1&s\\s&1-\gamma\end{pmatrix}, with trace 2−γ2-\gamma and determinant (1−γ)−s2=0(1-\gamma)-s^2=0, so its eigenvalues are 00 and 2−γ=1.82-\gamma=1.8. With the isolated γ=0.2\gamma=0.2 on the ∣10⟩|10\rangle diagonal, the full spectrum is {1.8,0.2,0,0}\{1.8,0.2,0,0\}.

Step 4. Read the rank. Two eigenvalues are nonzero, so rank J=2\mathrm{rank}\,J=2: the Kraus rank is 2, matching K0,K1K_0,K_1. Their eigenvectors, rescaled by 1.8\sqrt{1.8} and 0.2\sqrt{0.2} and unvectorized, are the canonical Kraus set — a unitary mixing of the textbook pair. Choi spectrum {1.8,0.2,0,0}\{1.8,0.2,0,0\}, Kraus rank 2, well below the bound d2=4d^2=4.

3 · The Kraus set is a gauge choice (non-uniqueness)

The bit-flip channel with p=0.3p=0.3 has the natural Kraus set K0=1−p IK_0=\sqrt{1-p}\,I, K1=p XK_1=\sqrt{p}\,X. Mix them by a Hadamard, K0′=12(K0+K1)K_0'=\tfrac1{\sqrt2}(K_0+K_1), K1′=12(K0−K1)K_1'=\tfrac1{\sqrt2}(K_0-K_1).

Step 1. Expanding K0′ρK0′†+K1′ρK1′†=12[(K0+K1)ρ(K0+K1)†+(K0−K1)ρ(K0−K1)†]K_0'\rho K_0'^\dagger+K_1'\rho K_1'^\dagger=\tfrac12\big[(K_0+K_1)\rho(K_0+K_1)^\dagger+(K_0-K_1)\rho(K_0-K_1)^\dagger\big], the cross terms K0ρK1†K_0\rho K_1^\dagger and K1ρK0†K_1\rho K_0^\dagger carry opposite signs and cancel, leaving K0ρK0†+K1ρK1†K_0\rho K_0^\dagger+K_1\rho K_1^\dagger — 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
KK
Karl Kraus
1938–1988 · the axiomatics of quantum operations and effects

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 KkK_k 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.

History
1955
— Stinespring proves the dilation theorem for completely positive maps on C*-algebras
1961
— Sudarshan, Mathews and Rau give the dynamical-map description of open-system evolution
1971
— Hellwig and Kraus formalize operations and effects operationally
1975
— Choi shows every completely positive map on matrices has an operator-sum form
1976
— Gorini, Kossakowski, Sudarshan and Lindblad derive the GKSL master equation
1983
— Kraus publishes States, Effects, and Operations, fixing the modern operator-sum language

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: ∑kKk†Kk=diag(1,1)\sum_k K_k^\dagger K_k=\mathrm{diag}(1,1) for amplitude damping, the Choi spectrum {1.8,0.2,0,0}\{1.8,0.2,0,0\} at γ=0.2\gamma=0.2, and the bit-flip two-Kraus-set equality. No numerical constants beyond the explicit 2×22\times2 matrices and the γ=0.2\gamma=0.2 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 E⊗id\mathcal{E}\otimes\mathrm{id}, 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 E⊗id\mathcal{E}\otimes\mathrm{id} stay positive for a reference of any dimension, which the Kraus form guarantees since ∑k(Kk⊗I)σ(Kk⊗I)†\sum_k(K_k\otimes I)\sigma(K_k\otimes I)^\dagger 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 Kj′=∑kWjkKkK_j'=\sum_k W_{jk}K_k, 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 KkK_k 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 {Kk†Kk}\{K_k^\dagger K_k\} a POVM, so applying the channel is formally a generalized measurement with the outcome thrown away. If you kept outcome kk, the state would collapse to KkρKk†/pkK_k\rho K_k^\dagger/p_k with probability pk=Tr(KkρKk†)p_k=\mathrm{Tr}(K_k\rho K_k^\dagger) — a selective operation. Summing over kk 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 kk is retained.

What is the difference between the Kraus form and the Lindblad master equation?

The Kraus representation is a snapshot: the discrete map ρ↦E(ρ)\rho\mapsto\mathcal{E}(\rho) 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 K0≈I−(iH+12∑jLj†Lj)dtK_0\approx I-(iH+\tfrac12\sum_j L_j^\dagger L_j)\mathrm{d}t and Kj≈dt LjK_j\approx\sqrt{\mathrm{d}t}\,L_j, 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 (≤d2\le d^2), 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 J(E)J(\mathcal{E}). Because noise can make the raw estimate slightly non-positive, you project it onto the nearest matrix satisfying J⪰0J\succeq0 and trace preservation — a convex optimization. Diagonalizing the physical J=∑kλk∣vk⟩⟨vk∣J=\sum_k\lambda_k|v_k\rangle\langle v_k| and setting Kk=λk unvec(∣vk⟩)K_k=\sqrt{\lambda_k}\,\mathrm{unvec}(|v_k\rangle) gives a canonical minimal Kraus set; the count of nonzero eigenvalues is the effective Kraus rank of your device's noise.

Before this

Where this leads