Skip to content

Kraus, Choi, and Stinespring Views

Kraus operators, a Choi matrix and a Stinespring realization describe the same quantum channel from three useful perspectives: how to apply it, how to test it, and where information can go when an environment is included. Their common rank determines the smallest pure auxiliary space needed for an exact realization. It does not determine a physical bath’s size or a circuit’s cost.

We work in finite dimensions. Besides deterministic channels, we consider nonzero selected operations whose output trace is a success probability. The distinction matters whenever an environment is measured rather than discarded.

Helpful background. Quantum channels for QI introduces Kraus operators and the output–input Choi convention. Spectral decomposition supplies positive-matrix factorization, and partial trace explains the subsystem reductions below. The general representation theorems are developed in the open-systems volume.

Let KaK_a be dout×dind_{\rm out}\times d_{\rm in} matrices. They define

Φ(A)=∑a=1mKaAKa†.\Phi(A)=\sum_{a=1}^mK_aAK_a^\dagger.

For a channel, ∑aKa†Ka=I\sum_aK_a^\dagger K_a=I; for a selected operation it is ⪯I\preceq I. Complete positivity alone does not distinguish these cases. For a state ρ\rho, a selected output Φ(ρ)\Phi(\rho) remains subnormalized until its trace has been saved as the event probability.

We use the unnormalized Choi operator

JΦ=∑i,jΦ(∣i⟩⟨j∣)⊗∣i⟩⟨j∣,J_\Phi=\sum_{i,j}\Phi(|i\rangle\langle j|)\otimes|i\rangle\langle j|,

with output first, input second. Define

∣Ka⟩ ⁣⟩=∑μ,i(Ka)μi∣μ⟩out∣i⟩in.|K_a\rangle\!\rangle=\sum_{\mu,i}(K_a)_{\mu i} |\mu\rangle_{\rm out}|i\rangle_{\rm in}.

Flattening here orders entries as (μ,i)(\mu,i), with input index fastest. It differs from column stacking, which puts the input factor first. This small ordering distinction matters for complex or rectangular matrices.

Choose an orthonormal auxiliary basis {∣a⟩E}\{|a\rangle_E\} and construct

V∣ψ⟩=∑aKa∣ψ⟩⊗∣a⟩E.V|\psi\rangle=\sum_aK_a|\psi\rangle\otimes|a\rangle_E.

The three descriptions then satisfy

JΦ=∑a∣Ka⟩ ⁣⟩⟨ ⁣⟨Ka∣,Φ(ρ)=Tr⁡E(VρV†).\begin{aligned} J_\Phi&=\sum_a|K_a\rangle\!\rangle\langle\!\langle K_a|,\\ \Phi(\rho)&=\operatorname{Tr}_E(V\rho V^\dagger). \end{aligned}

The first expression is positive by construction. In the second, tracing the orthonormal environment states removes the cross terms and leaves the Kraus sum. Finally, V†V=∑aKa†KaV^\dagger V=\sum_aK_a^\dagger K_a: a channel gives an isometry, whereas a trace-nonincreasing operation gives a contraction. A contraction alone is not deterministic closed-system evolution. It describes a selected branch that must be accompanied by a failure branch in a full experiment. See the formal Kraus, Choi and Stinespring treatments for the general statements (Kraus; Choi; Stinespring; Watrous).

Put the flattened Kraus operators into columns:

A=[∣K1⟩ ⁣⟩⋯∣Km⟩ ⁣⟩].A=\begin{bmatrix}|K_1\rangle\!\rangle&\cdots&|K_m\rangle\!\rangle\end{bmatrix}.

The two Gram matrices are

J=AA†,G=A†A,Gab=Tr⁡(Ka†Kb).\begin{aligned} J&=AA^\dagger,\qquad G=A^\dagger A,\\ G_{ab}&=\operatorname{Tr}(K_a^\dagger K_b). \end{aligned}

They have the same nonzero eigenvalues: the squared singular values of AA. Their sizes can differ, so their numbers of zero eigenvalues can differ. For a nonzero CP map,

r=rank⁡J=rank⁡A=rank⁡Gr=\operatorname{rank}J=\operatorname{rank}A=\operatorname{rank}G

is the smallest exact Kraus-list length and the smallest auxiliary dimension in a pure-environment realization. A displayed list can be longer because its operators are dependent or zero. For the zero operation, the matrix rank is zero; it can be written with an empty Kraus sum, or a zero contraction using an ordinary nonzero-dimensional auxiliary space. The rank–dimension statement above avoids that degenerate convention issue.

If J=∑α=1rλα∣vα⟩⟨vα∣J=\sum_{\alpha=1}^r\lambda_\alpha |v_\alpha\rangle\langle v_\alpha| with positive eigenvalues, a minimal family is obtained by reshaping λα∣vα⟩\sqrt{\lambda_\alpha}|v_\alpha\rangle in the stated output–input order. Degenerate eigenspaces can be rotated, and individual vectors can acquire phases. These changes alter the displayed operators but not the channel.

For a channel, Tr⁡J=Tr⁡G=din\operatorname{Tr}J=\operatorname{Tr}G=d_{\rm in}. Neither JJ nor GG is generally a normalized density operator. The trace-preserving condition is stronger than this scalar trace: it requires Tr⁡outJ=Iin\operatorname{Tr}_{\rm out}J=I_{\rm in}.

The environment contains a complementary output

Section titled “The environment contains a complementary output”

Tracing the system output instead of the environment gives

Φ~(ρ)=∑a,bTr⁡(Kb†Kaρ)∣a⟩⟨b∣E.\widetilde\Phi(\rho) =\sum_{a,b}\operatorname{Tr}(K_b^\dagger K_a\rho) |a\rangle\langle b|_E.

This is the complementary channel for the chosen isometric realization. It is a quantum state, including coherences between the environment labels, not just a list of classical probabilities. For a selected contraction the same expression is subnormalized, with the selected event’s probability.

A purification explains the connection to GG. Introduce a reference RR and the unnormalized vector ∣Ω⟩=∑i∣i⟩∣i⟩|\Omega\rangle=\sum_i|i\rangle|i\rangle. Then

∣Γ⟩=(V⊗IR)∣Ω⟩=∑a,μ,i(Ka)μi∣μ⟩out∣a⟩E∣i⟩R.\begin{aligned} |\Gamma\rangle&=(V\otimes I_R)|\Omega\rangle\\ &=\sum_{a,\mu,i}(K_a)_{\mu i}|\mu\rangle_{ \rm out}|a\rangle_E|i\rangle_R. \end{aligned}

Its subsystem reductions, in this order, are

Tr⁡E∣Γ⟩⟨Γ∣=J,Tr⁡out,R∣Γ⟩⟨Γ∣=GT.\operatorname{Tr}_E|\Gamma\rangle\langle\Gamma|=J, \qquad \operatorname{Tr}_{{\rm out},R}|\Gamma\rangle\langle\Gamma|=G^{\mathsf T}.

The transpose follows from the coefficient Tr⁡(Kb†Ka)=Gba\operatorname{Tr}(K_b^\dagger K_a)=G_{ba}. For a channel, divide both reductions by dind_{\rm in} to obtain density operators. In particular, Φ~(I/din)=GT/din\widetilde\Phi(I/d_{\rm in})=G^{\mathsf T}/d_{\rm in}. The Schmidt rank of ∣Γ⟩|\Gamma\rangle across (out,R)∣E({\rm out},R)\mid E is rr, which explains the minimal auxiliary dimension.

Starting from a minimal family of length rr, let WW be an m×rm\times r isometry, W†W=IrW^\dagger W=I_r, and set

Lb=∑aWbaKa.L_b=\sum_aW_{ba}K_a.

Summing the unread branch maps gives the original channel because ∑bWbaWbc∗=δac\sum_bW_{ba}W_{bc}^*=\delta_{ac}. For the column factors and dilations,

B=AWT,VL=(Iout⊗W)VK.B=AW^{\mathsf T},\qquad V_L=(I_{\rm out}\otimes W)V_K.

The transpose in BB follows from mixing columns; it is not an adjoint. Two minimal realizations are related by an environment unitary. Longer lists are isometric embeddings of the same minimal space. Compare their Choi matrices or actions on an operator basis, not their first Kraus operators.

Complementary outputs transform as Φ~L(ρ)=WΦ~K(ρ)W†\widetilde\Phi_L(\rho)=W\widetilde\Phi_K(\rho)W^\dagger. With unrestricted coherent access to the auxiliary space, these isometric descriptions contain equivalent information about the input. A fixed measurement in the laboratory can nevertheless give different probabilities after that rotation. Distinguish changing coordinates, actively rotating the environment, and changing what is measured.

Worked example: dephasing with two environment measurements

Section titled “Worked example: dephasing with two environment measurements”

Take K0=3/4 IK_0=\sqrt{3/4}\,I and K1=1/4 ZK_1=\sqrt{1/4}\,Z. The channel preserves populations and halves the off-diagonal entries. Its Choi eigenvalues are 3/2,1/2,0,03/2,1/2,0,0, so a two-dimensional auxiliary space is minimal. For an input with Bloch component rzr_z, its complementary output is

Φ~(ρ)=(3/43 rz/43 rz/41/4).\widetilde\Phi(\rho)= \begin{pmatrix}3/4&\sqrt3\,r_z/4\\ \sqrt3\,r_z/4&1/4\end{pmatrix}.

The diagonals do not depend on rzr_z, but the off-diagonal entry does. This information becomes visible in a different measurement basis:

Environment measurement Branch operators Probabilities
computational basis K0,K1K_0,K_1 3/4, 1/43/4,\ 1/4
Hadamard basis L±=(K0±K1)/2L_\pm=(K_0\pm K_1)/\sqrt2 p±=1/2±3 rz/4p_\pm=1/2\pm\sqrt3\,r_z/4

For r=(1/5,−2/5,3/5)\boldsymbol r=(1/5,-2/5,3/5), the second probabilities are 1/2±33/201/2\pm3\sqrt3/20. In either measurement, discarding the outcome gives the same system output with Bloch vector (1/10,−1/5,3/5)(1/10,-1/5,3/5). An instrument contains the outcome-dependent operations, so these are different instruments sharing one unread channel.

More generally, measuring an orthonormal environment basis ∣μ⟩|\mu\rangle produces Lμ=E⟨μ∣VL_\mu={}_E\langle\mu|V. General measurements and coarse-grained outcomes can require several operators per outcome. A spectral Kraus decomposition alone does not show that any such measurement occurred, or define a time-resolved physical trajectory.

Worked example: reset transfers information

Section titled “Worked example: reset transfers information”

The reset channel is

R(ρ)=∣0⟩⟨0∣Tr⁡ρ,K0=∣0⟩⟨0∣,K1=∣0⟩⟨1∣.\begin{aligned} \mathcal R(\rho)&=|0\rangle\langle0|\operatorname{Tr}\rho,\\ K_0&=|0\rangle\langle0|,\quad K_1=|0\rangle\langle1|. \end{aligned}

Its Choi operator is diag⁡(1,1,0,0)\operatorname{diag}(1,1,0,0) and has rank two. The associated isometry is particularly simple:

V∣ψ⟩=∣0⟩S∣ψ⟩E.V|\psi\rangle=|0\rangle_S|\psi\rangle_E.

One realization swaps the input qubit with an auxiliary qubit prepared in ∣0⟩|0\rangle. The system output is fixed, while the complementary output is exactly ρ\rho. If the input was entangled with a reference, those correlations move to the auxiliary qubit as well; they have not been destroyed by a global unitary.

A SWAP resets the system to zero and transfers its unknown state to an auxiliary qubit; alternative Z or X measurements of that qubit read different input statistics

Reset from the system’s perspective is information transfer in this pure auxiliary realization. Measuring EE in the ZZ or XX basis gives different classical records; these are alternative experiments. Discarding either record leaves the system in ∣0⟩|0\rangle.

For the input used above, measuring EE in the computational basis gives probabilities (4/5,1/5)(4/5,1/5), while its Hadamard-basis measurement gives (3/5,2/5)(3/5,2/5). Both instruments leave the system reset. The choice of accessible environment and measurement must be specified before asking what information an observer receives.

Exact compression and approximate truncation

Section titled “Exact compression and approximate truncation”

Composing channels with Kraus lists {Ka}\{K_a\} and {Lb}\{L_b\} produces operators LbKaL_bK_a. Their number is only an upper bound on the resulting Choi rank. For two dephasing channels with probabilities 1/41/4 and 1/31/3, the four products are proportional to I,Z,Z,II,Z,Z,I, with squared coefficients

12,16,14,112.\frac12,\quad\frac16,\quad\frac14,\quad\frac1{12}.

Combining like directions gives the exact two-operator family {7/12 I,5/12 Z}\{\sqrt{7/12}\,I,\sqrt{5/12}\,Z\}. No approximation was made.

Dropping a nonzero Choi eigenmode is different. For a channel with exact positive JJ, retaining only some spectral terms gives a CP, trace- nonincreasing map, because the omitted part is itself CP. It generally fails to preserve trace. If the omitted Kraus operators are DaD_a, define

Fdrop=∑aDa†Da.F_{\rm drop}=\sum_aD_a^\dagger D_a.

The lost probability on input ρ\rho is Tr⁡(Fdropρ)\operatorname{Tr}(F_{\rm drop}\rho), with maximum ∥Fdrop∥∞\|F_{\rm drop}\|_\infty. This is a direct physical measure of the truncation, unlike an unexplained numerical rank threshold. Renormalizing each surviving output can make a nonlinear conditional rule, not a repaired channel. If a new trace-preserving approximation is needed, construct it explicitly and compare its predictions with the original.

Numerical work must still check Hermiticity, eigenvalue tolerances and trace conditions: inaccurate factorization is not the same as exact spectral truncation. Compare degenerate subspaces rather than arbitrary eigenvector phases. The channel-coordinate example gives a compact executable check using complete matrix-unit action.

Minimal dimension does not determine the physical environment

Section titled “Minimal dimension does not determine the physical environment”

Choi rank gives the smallest auxiliary dimension for an exact pure realization. A mixed laboratory environment can be purified by adding another system; which systems are actually accessible is a separate question. A low Choi rank neither identifies the bath nor guarantees an inexpensive circuit. State preparation, interactions, routing, reset and approximation accuracy all affect implementation cost.

Nor does a one-use realization specify what happens on reuse. Resetting the environment between uses and retaining it produce different multitime experiments. Initial correlations and restricted preparation procedures can also prevent a common channel from describing every input. These questions require the appropriate open-system model and memory analysis, rather than another Kraus-basis change. Formal continuity results compare nearby channels through suitable dilations, but do not by themselves give a hardware synthesis cost (Kretschmann, Schlingemann and Werner).

Let K0=diag⁡(1,1−γ)K_0=\operatorname{diag}(1,\sqrt{1-\gamma}) and K1=γ∣0⟩⟨1∣K_1=\sqrt\gamma|0\rangle\langle1|, with 0<γ<10<\gamma<1. These are orthogonal spectral Kraus directions. If K1K_1 is dropped, find the trace deficit on an arbitrary input and its maximum. Show explicitly that normalizing the retained output need not preserve mixtures.

Solution

Fdrop=γ∣1⟩⟨1∣F_{\rm drop}=\gamma|1\rangle\langle1|, so the deficit is γρ11≤γ\gamma\rho_{11}\leq\gamma. The retained operation is CP-TNI, not TP. Its normalized outputs on ∣0⟩|0\rangle and ∣1⟩|1\rangle are those same pure states. However, the normalized output on their equal mixture is

diag⁡(1,1−γ)2−γ,\frac{\operatorname{diag}(1,1-\gamma)}{2-\gamma},

which is not I/2I/2. At γ=1/2\gamma=1/2 it is diag⁡(2/3,1/3)\operatorname{diag}(2/3,1/3). Conditioning has changed the mixing weights.

2. Compare the Choi and Kraus Gram spectra

Section titled “2. Compare the Choi and Kraus Gram spectra”

For a rectangular Kraus-column matrix AA, prove that AA†AA^\dagger and A†AA^\dagger A have the same nonzero spectrum, and deduce the common minimal dimension.

Solution

If A†Ay=λyA^\dagger Ay=\lambda y with λ>0\lambda>0, then Ay≠0Ay\ne0 and AA†(Ay)=λ(Ay)AA^\dagger(Ay)=\lambda(Ay). Conversely, AA†x=λxAA^\dagger x=\lambda x implies that A†x≠0A^\dagger x\ne0 is a λ\lambda eigenvector of A†AA^\dagger A. The maps preserve multiplicities on every positive eigenspace, equivalently giving the squared nonzero singular values of AA. Hence rank⁡(AA†)=rank⁡A=rank⁡(A†A)=r\operatorname{rank}(AA^\dagger)=\operatorname{rank}A=\operatorname{rank}(A^\dagger A)=r. Exactly rr independent Kraus columns are necessary and sufficient, and the Schmidt form of the associated purification needs exactly rr environment dimensions.

Apply the Hadamard label rotation to the dephasing family and derive the branch probabilities for an input with Bloch component rzr_z. Explain the physical limitation.

Solution

L±=(K0±K1)/2L_\pm=(K_0\pm K_1)/\sqrt2 and ∑±L±ρL±†=∑aKaρKa†\sum_\pm L_\pm\rho L_\pm^\dagger=\sum_aK_a\rho K_a^\dagger. Moreover, L±†L±=I/2±(3/4)ZL_\pm^\dagger L_\pm=I/2\pm(\sqrt3/4)Z, so p±=1/2±3rz/4p_\pm=1/2\pm\sqrt3 r_z/4. At rz=3/5r_z=3/5 these become 1/2±33/201/2\pm3\sqrt3/20. Both effects sum to II, rechecking completeness. The rotated and unrotated branch families are different instruments with one unread channel; neither label is a physical detector event unless a corresponding environment measurement has been specified.

Compose dephasing probabilities p1=1/4p_1=1/4 and p2=1/3p_2=1/3, compress the four products, and check exact rank and TP.

Solution

The two II products have squared weights (1−p1)(1−p2)+p1p2=1/2+1/12=7/12(1-p_1)(1-p_2)+p_1p_2=1/2+1/12=7/12. The two ZZ products have total weight (1−p1)p2+p1(1−p2)=1/4+1/6=5/12(1-p_1)p_2+p_1(1-p_2)=1/4+1/6=5/12. Thus the minimal family is {7/12I,5/12Z}\{\sqrt{7/12}I,\sqrt{5/12}Z\}. Its completeness sum is II, its Choi eigenvalues are 7/67/6 and 5/65/6, and its exact rank is two. The original count four is only a redundant list length; numerical compression would additionally declare a tolerance and recheck TP after truncation.

Pad a minimal pair {K0,K1}\{K_0,K_1\} to {K0/2,K0/2,K1}\{K_0/\sqrt2,K_0/\sqrt2,K_1\} and exhibit the environment embedding.

Solution

Use

W=(1/201/2001),W†W=I2.W=\begin{pmatrix}1/\sqrt2&0\\1/\sqrt2&0\\0&1\end{pmatrix}, \qquad W^\dagger W=I_2.

Then Lb=∑aWbaKaL_b=\sum_aW_{ba}K_a gives the padded triple, B=AWTB=AW^{\mathsf T}, and BB†=AA†BB^\dagger=AA^\dagger. The corresponding dilation is VL=(I⊗W)VKV_L=(I\otimes W)V_K; its environment is three-dimensional but its occupied support and minimal dimension remain two. A second padded realization must first be embedded in the same ambient space before a unitary alignment is sought. Removing any nonzero direction would require new TP and action checks.

6. Retain and measure the reset environment

Section titled “6. Retain and measure the reset environment”

For the reset isometry, find the complementary output and the computational- and Hadamard-basis branch probabilities on the worked input with Bloch vector (1/5,−2/5,3/5)(1/5,-2/5,3/5).

Solution

V∣ψ⟩=∣0⟩∣ψ⟩V\lvert\psi\rangle=\lvert0\rangle\lvert\psi\rangle, so tracing the system gives R~(ρ)=ρ\widetilde{\mathcal R}(\rho)=\rho, while tracing EE gives ∣0⟩ ⁣⟨0∣\lvert0\rangle\!\langle0\rvert. Computational measurement uses K0,K1K_0,K_1 and reads the diagonal probabilities (4/5,1/5)(4/5,1/5). Hadamard measurement uses (K0±K1)/2(K_0\pm K_1)/\sqrt2 and reads (1±rx)/2=(3/5,2/5)(1\pm r_x)/2=(3/5,2/5). In each basis the subnormalized branch maps sum to R\mathcal R and their traces sum to one. These outcomes describe the specified environment measurements, not a unique trajectory inherent in the reset channel.

  • M.-D. Choi, “Completely Positive Linear Maps on Complex Matrices,” Linear Algebra and its Applications 10, 285–290 (1975), doi:10.1016/0024-3795(75)90075-0.
  • K. Kraus, “General State Changes in Quantum Theory,” Annals of Physics 64, 311–335 (1971), doi:10.1016/0003-4916(71)90108-4.
  • K. Kraus, States, Effects, and Operations: Fundamental Notions of Quantum Theory, Lecture Notes in Physics 190, Springer-Verlag, Berlin (1983), doi:10.1007/3-540-12732-1.
  • D. Kretschmann, D. Schlingemann, and R. F. Werner, “The Information-Disturbance Tradeoff and the Continuity of Stinespring’s Representation,” IEEE Transactions on Information Theory 54, 1708–1717 (2008), doi:10.1109/TIT.2008.917696.
  • W. F. Stinespring, “Positive Functions on C*-Algebras,” Proceedings of the American Mathematical Society 6, 211–216 (1955), doi:10.1090/S0002-9939-1955-0069403-4.
  • J. Watrous, The Theory of Quantum Information, Cambridge University Press, Cambridge (2018), doi:10.1017/9781316848142.