Skip to content

Kraus Representation

A Kraus representation writes a completely positive map as a sum of ordinary operator conjugations. It is the most common working form of a finite-dimensional quantum channel:

Φ(ρ)=∑αKαρKα†.\Phi(\rho) = \sum_\alpha K_\alpha\rho K_\alpha^\dagger.

The representation is useful because complete positivity is automatic, trace conditions are easy to check, and many physical models of noise or unread measurement lead directly to Kraus operators.

The main warning is that Kraus operators are not unique. A channel is the map Φ\Phi; a Kraus representation is one way to write it.

For a validation-first notebook guide using Kraus completeness, Choi positivity, and common qubit channels, see Simulating Quantum Channels.

Kraus, Choi, and Stinespring Views compares Kraus families with Choi spectral factors and Stinespring realizations for QI compression and environment-record choices; this page retains the operator-sum theorem, trace conditions, minimal Kraus rank, isometric freedom, and Kraus-construction details.

Let the input Hilbert space be Hin\mathcal H_{\mathrm{in}} and the output Hilbert space be Hout\mathcal H_{\mathrm{out}}. A Kraus operator is a linear map

Kα:Hin→Hout.K_\alpha:\mathcal H_{\mathrm{in}}\to\mathcal H_{\mathrm{out}}.

The corresponding operator-sum map is

Φ(ρ)=∑αKαρKα†.\Phi(\rho) = \sum_\alpha K_\alpha\rho K_\alpha^\dagger.

For any positive operator X≥0X\ge0, each term

KαXKα†K_\alpha X K_\alpha^\dagger

is positive. The same remains true after tensoring with an idle reference system, so every Kraus map is completely positive.

In finite dimensions, the converse also holds: every completely positive map has at least one Kraus representation.

The trace of the output is

Tr⁡Φ(ρ)=Tr⁡[ρ∑αKα†Kα].\operatorname{Tr}\Phi(\rho) = \operatorname{Tr} \left[ \rho \sum_\alpha K_\alpha^\dagger K_\alpha \right].

Therefore Φ\Phi is trace preserving if and only if

∑αKα†Kα=Iin.\sum_\alpha K_\alpha^\dagger K_\alpha=I_{\mathrm{in}}.

It is trace nonincreasing if and only if

∑αKα†Kα≤Iin.\sum_\alpha K_\alpha^\dagger K_\alpha\le I_{\mathrm{in}}.

These are normalization conditions, not complete-positivity conditions. Complete positivity is already built into the operator-sum form.

For a map from a Hilbert space to itself, Φ\Phi is unital if

Φ(I)=I.\Phi(I)=I.

In Kraus form this is

∑αKαKα†=I.\sum_\alpha K_\alpha K_\alpha^\dagger=I.

This condition is often confused with trace preservation, but it is not the same equation. Trace preservation uses Kα†KαK_\alpha^\dagger K_\alpha; unitality uses KαKα†K_\alpha K_\alpha^\dagger.

A unitary channel is both trace preserving and unital. Amplitude damping is trace preserving but not unital. A selected measurement outcome is usually neither trace preserving nor unital before normalization.

For finite-dimensional matrix algebras, the following statements are equivalent:

  1. Φ\Phi is completely positive.
  2. Φ\Phi has a Kraus representation.
  3. The Choi matrix J(Φ)J(\Phi) is positive.

One way to see the connection is to use vectorization. For an operator

K:Hin→Hout,K:\mathcal H_{\mathrm{in}}\to\mathcal H_{\mathrm{out}},

define

∣K⟩⟩=∑a,iKai∣a⟩out⊗∣i⟩in.|K\rangle\rangle = \sum_{a,i} K_{ai}|a\rangle_{\mathrm{out}}\otimes |i\rangle_{\mathrm{in}}.

If

Φ(ρ)=∑αKαρKα†,\Phi(\rho) = \sum_\alpha K_\alpha\rho K_\alpha^\dagger,

then the Choi matrix can be written as

J(Φ)=∑α∣Kα⟩⟩⟨⟨Kα∣.J(\Phi) = \sum_\alpha |K_\alpha\rangle\rangle \langle\langle K_\alpha|.

Thus J(Φ)≥0J(\Phi)\ge0. Conversely, if

J(Φ)=∑ℓ=1rλℓ∣vℓ⟩⟨vℓ∣,λℓ>0,J(\Phi) = \sum_{\ell=1}^r \lambda_\ell |v_\ell\rangle\langle v_\ell|, \qquad \lambda_\ell>0,

then unvectorizing

λℓ ∣vℓ⟩\sqrt{\lambda_\ell}\,|v_\ell\rangle

gives a set of Kraus operators for Φ\Phi, up to the chosen vectorization convention.

The smallest possible number of Kraus operators in a representation of Φ\Phi is the Kraus rank. In finite dimensions,

Kraus rank of Φ=rank⁡J(Φ).\text{Kraus rank of }\Phi = \operatorname{rank}J(\Phi).

This rank is representation independent. It measures how many linearly independent noise alternatives are needed in a minimal operator-sum description.

Examples:

  • a unitary channel Φ(ρ)=UρU†\Phi(\rho)=U\rho U^\dagger has Kraus rank 11;
  • a nontrivial dephasing channel usually has Kraus rank 22;
  • a completely depolarizing channel on a dd-dimensional system has Kraus rank d2d^2 in a minimal full-rank Choi representation.

The number of Kraus operators in a nonminimal representation may be larger than the Kraus rank.

Kraus representations are not unique. If

Φ(ρ)=∑α=1rKαρKα†,\Phi(\rho) = \sum_{\alpha=1}^r K_\alpha\rho K_\alpha^\dagger,

and uβαu_{\beta\alpha} is a unitary matrix, then

Lβ=∑α=1ruβαKαL_\beta = \sum_{\alpha=1}^r u_{\beta\alpha}K_\alpha

gives another representation of the same map:

Φ(ρ)=∑β=1rLβρLβ†.\Phi(\rho) = \sum_{\beta=1}^r L_\beta\rho L_\beta^\dagger.

If two representations have different numbers of operators, one can pad the shorter list with zero operators and then use a unitary mixing on the padded list. Equivalently, a nonminimal representation can be obtained from a minimal one by an isometry on the Kraus-label space.

This freedom is why an individual Kraus operator should not automatically be assigned direct physical meaning.

A trace-preserving Kraus map can be represented by an isometry

V:Hin→Hout⊗HEV:\mathcal H_{\mathrm{in}} \to \mathcal H_{\mathrm{out}}\otimes\mathcal H_E

defined by

V∣ψ⟩=∑αKα∣ψ⟩⊗∣α⟩E.V|\psi\rangle = \sum_\alpha K_\alpha|\psi\rangle\otimes|\alpha\rangle_E.

The trace-preserving condition gives

V†V=∑αKα†Kα=Iin.V^\dagger V = \sum_\alpha K_\alpha^\dagger K_\alpha =I_{\mathrm{in}}.

The channel is recovered by tracing out the environment:

Φ(ρ)=Tr⁡E(VρV†).\Phi(\rho) = \operatorname{Tr}_E \left( V\rho V^\dagger \right).

If the environment is measured in the basis {∣α⟩E}\{|\alpha\rangle_E\}, the Kraus label can become an observed record. If the environment is ignored, the same formula is just an unread noise channel.

This is the conceptual bridge between channels, quantum instruments, and reduced dynamics. The channel-side environment construction is developed in Stinespring Representation.

Suppose an environment starts in a pure state ∣e0⟩|e_0\rangle, the joint system evolves with a unitary UU, and the environment is later ignored. Choose an environment basis {∣α⟩}\{|\alpha\rangle\}. Define

Kα=⟨α∣U∣e0⟩.K_\alpha = \langle\alpha|U|e_0\rangle.

Here the bracket is taken only in the environment Hilbert space, leaving an operator from system input to system output. Then

Φ(ρ)=Tr⁡E[U(ρ⊗∣e0⟩⟨e0∣)U†]=∑αKαρKα†.\Phi(\rho) = \operatorname{Tr}_E \left[ U(\rho\otimes |e_0\rangle\langle e_0|)U^\dagger \right] = \sum_\alpha K_\alpha\rho K_\alpha^\dagger.

Changing the environment basis changes the Kraus representation without changing the channel. This is the physical origin of unitary freedom in many examples.

A closed-system unitary evolution has one Kraus operator:

K1=U,Φ(ρ)=UρU†.K_1=U, \qquad \Phi(\rho)=U\rho U^\dagger.

The trace-preserving condition is U†U=IU^\dagger U=I.

An unread projective measurement with projectors {Pa}\{P_a\} has

Φ(ρ)=∑aPaρPa.\Phi(\rho) = \sum_a P_a\rho P_a.

The Kraus operators are Ka=PaK_a=P_a, and

∑aPa†Pa=∑aPa=I.\sum_a P_a^\dagger P_a = \sum_a P_a =I.

This channel removes coherences between the measured eigenspaces. It is the channel version of a nonselective projective measurement.

If unitary UjU_j is applied with classical probability pjp_j, then

Φ(ρ)=∑jpjUjρUj†.\Phi(\rho) = \sum_j p_j U_j\rho U_j^\dagger.

A Kraus representation is

Kj=pj Uj.K_j=\sqrt{p_j}\,U_j.

Random unitary channels are trace preserving and unital. Not every channel is random unitary.

Channel Kraus Operators Versus Measurement Kraus Operators

Section titled “Channel Kraus Operators Versus Measurement Kraus Operators”

The same algebraic formula appears in two related settings:

SettingObjectMeaning of Kraus labels
channelΦ(ρ)=∑αKαρKα†\Phi(\rho)=\sum_\alpha K_\alpha\rho K_\alpha^\daggerunobserved alternatives in a nonselective map
instrumentIm(ρ)=∑αKmαρKmα†\mathcal I_m(\rho)=\sum_\alpha K_{m\alpha}\rho K_{m\alpha}^\daggerhidden alternatives inside reported outcome mm

For measurement outcomes, see Kraus Operators. For channels, the Kraus label usually represents an environment basis, a noise alternative, or a mathematical decomposition. It becomes an observed result only after a specific monitoring scheme is chosen.

The finite-dimensional Kraus theorem is the right default for qubits, finite spin systems, finite-level atoms, and finite-dimensional quantum information models. In infinite-dimensional Hilbert spaces, analogous operator-sum or integral representations exist under additional technical hypotheses, but domains, convergence, normality, and trace-class continuity matter.

For most quantum-mechanics applications, one first builds intuition with the finite-dimensional theorem and then checks the functional-analytic assumptions when working with unbounded operators or continuous-variable systems.

  • Treating a Kraus representation as unique.
  • Confusing trace preservation with unitality.
  • Reading a physical trajectory from a Kraus label without specifying an environment measurement.
  • Forgetting that a selected outcome operation is trace nonincreasing before normalization.
  • Assuming every channel with many Kraus operators represents classical random unitary noise.
  • Using a nonminimal Kraus list to infer the minimal number of independent noise alternatives.
  • Ignoring the input–output Hilbert spaces when the channel changes dimension.
  • W. F. Stinespring, “Positive functions on C*-algebras,” Proceedings of the American Mathematical Society 6, 211-216 (1955).
  • E. C. G. Sudarshan, P. M. Mathews, and J. Rau, “Stochastic dynamics of quantum-mechanical systems,” Physical Review 121, 920-924 (1961).
  • K. Kraus, “General state changes in quantum theory,” Annals of Physics 64, 311-335 (1971).
  • M.-D. Choi, “Completely positive linear maps on complex matrices,” Linear Algebra and its Applications 10, 285-290 (1975).
  • K. Kraus, States, Effects, and Operations: Fundamental Notions of Quantum Theory, Springer (1983).
  • M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press (2010).
  • J. Watrous, The Theory of Quantum Information, Cambridge University Press (2018).
  1. Unitary mixing. Suppose Lβ=∑αuβαKαL_\beta=\sum_\alpha u_{\beta\alpha}K_\alpha, where uu is unitary. Show that ∑βLβρLβ†=∑αKαρKα†\sum_\beta L_\beta\rho L_\beta^\dagger=\sum_\alpha K_\alpha\rho K_\alpha^\dagger.
Solution

Substitute the definition:

∑βLβρLβ†=∑β,α,γuβαuβγ∗KαρKγ†.\sum_\beta L_\beta\rho L_\beta^\dagger = \sum_{\beta,\alpha,\gamma} u_{\beta\alpha}u_{\beta\gamma}^* K_\alpha\rho K_\gamma^\dagger.

Unitarity gives

∑βuβαuβγ∗=δαγ.\sum_\beta u_{\beta\alpha}u_{\beta\gamma}^* = \delta_{\alpha\gamma}.

Therefore

∑βLβρLβ†=∑αKαρKα†.\sum_\beta L_\beta\rho L_\beta^\dagger = \sum_\alpha K_\alpha\rho K_\alpha^\dagger.
  1. Isometry from Kraus operators. Let Φ\Phi be trace preserving, and define V∣ψ⟩=∑αKα∣ψ⟩⊗∣α⟩EV|\psi\rangle=\sum_\alpha K_\alpha|\psi\rangle\otimes|\alpha\rangle_E. Show that VV is an isometry.
Solution

For arbitrary ∣ψ⟩|\psi\rangle and ∣ϕ⟩|\phi\rangle,

⟨ϕ∣V†V∣ψ⟩=∑α⟨ϕ∣Kα†Kα∣ψ⟩.\langle\phi|V^\dagger V|\psi\rangle = \sum_\alpha \langle\phi|K_\alpha^\dagger K_\alpha|\psi\rangle.

Trace preservation gives ∑αKα†Kα=I\sum_\alpha K_\alpha^\dagger K_\alpha=I. Hence

⟨ϕ∣V†V∣ψ⟩=⟨ϕ∣ψ⟩\langle\phi|V^\dagger V|\psi\rangle = \langle\phi|\psi\rangle

for all vectors, so V†V=IV^\dagger V=I. Thus VV preserves inner products and is an isometry.

  1. Unitality check. Let Φ(ρ)=∑jpjUjρUj†\Phi(\rho)=\sum_j p_j U_j\rho U_j^\dagger, where ∑jpj=1\sum_jp_j=1 and each UjU_j is unitary. Show that Φ\Phi is both trace preserving and unital.
Solution

Use Kraus operators Kj=pjUjK_j=\sqrt{p_j}U_j. Then

∑jKj†Kj=∑jpjUj†Uj=∑jpjI=I,\sum_jK_j^\dagger K_j = \sum_j p_j U_j^\dagger U_j = \sum_jp_j I =I,

so the channel is trace preserving. Also,

Φ(I)=∑jpjUjIUj†=∑jpjI=I,\Phi(I) = \sum_jp_jU_jIU_j^\dagger = \sum_jp_jI =I,

so the channel is unital.