Skip to content

Choi Matrix

The Choi matrix represents a linear map on operators as a bipartite operator. It is one of the most useful ways to test whether a proposed map is a physical quantum operation.

For finite-dimensional channels, the Choi matrix turns several structural questions into matrix questions:

complete positivity⟺JΦ≥0,trace preservation⟺Tr⁡outJΦ=Iin,minimal Kraus number⟺rank⁡JΦ.\begin{array}{ccl} \text{complete positivity} &\Longleftrightarrow& J_\Phi\ge0,\\ \text{trace preservation} &\Longleftrightarrow& \operatorname{Tr}_{\mathrm{out}}J_\Phi=I_{\mathrm{in}},\\ \text{minimal Kraus number} &\Longleftrightarrow& \operatorname{rank}J_\Phi. \end{array}

This page uses the output-input convention:

JΦ∈B(Hout⊗Hin).J_\Phi\in \mathcal B(\mathcal H_{\mathrm{out}}\otimes\mathcal H_{\mathrm{in}}).

Other references sometimes reverse the two tensor factors. The formulas involving partial traces and transposes must then be adjusted.

For a small numerical notebook contract that tests this convention, see Simulating Quantum Channels.

Kraus, Choi, and Stinespring Views uses Choi factorization as one side of the focused unread-map and minimal-realization crosswalk; this page retains the Choi definition, convention-sensitive reconstruction, CP, TP, and TNI criteria, channel-state duality, and worked examples.

Let

Φ:B(Hin)→B(Hout)\Phi: \mathcal B(\mathcal H_{\mathrm{in}}) \to \mathcal B(\mathcal H_{\mathrm{out}})

be a linear map. Choose an orthonormal basis {∣i⟩}i=1din\{\lvert i\rangle\}_{i=1}^{d_{\mathrm{in}}} of Hin\mathcal H_{\mathrm{in}} and define the unnormalized maximally entangled vector

∣Ω⟩=∑i=1din∣i⟩in⊗∣i⟩R,\lvert\Omega\rangle = \sum_{i=1}^{d_{\mathrm{in}}} \lvert i\rangle_{\mathrm{in}} \otimes \lvert i\rangle_R,

where RR is a reference copy of the input space.

The Choi matrix is

JΦ=(Φ⊗idR)(∣Ω⟩⟨Ω∣).J_\Phi = (\Phi\otimes\mathrm{id}_R) \left( \lvert\Omega\rangle\langle\Omega\rvert \right).

Equivalently,

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

The first tensor factor is the output system; the second is the input-reference system.

The Choi matrix determines the map. For any input operator XX,

Φ(X)=Tr⁡in ⁣[JΦ(Iout⊗XT)],\Phi(X) = \operatorname{Tr}_{\mathrm{in}} \!\left[ J_\Phi \left( I_{\mathrm{out}}\otimes X^{\mathsf T} \right) \right],

where the transpose is taken in the same input basis used to define ∣Ω⟩\lvert\Omega\rangle.

This transpose is a common source of mistakes. It appears because the input matrix elements are read from the reference half of ∣Ω⟩\lvert\Omega\rangle.

To verify the formula, write

X=∑i,jXij∣i⟩⟨j∣.X=\sum_{i,j}X_{ij}\lvert i\rangle\langle j\rvert.

Then

Tr⁡in ⁣[(Φ(∣i⟩⟨j∣)⊗∣i⟩⟨j∣)(Iout⊗XT)]=XijΦ(∣i⟩⟨j∣),\operatorname{Tr}_{\mathrm{in}} \!\left[ \left( \Phi(\lvert i\rangle\langle j\rvert) \otimes \lvert i\rangle\langle j\rvert \right) \left( I_{\mathrm{out}}\otimes X^{\mathsf T} \right) \right] = X_{ij}\Phi(\lvert i\rangle\langle j\rvert),

and summing over i,ji,j gives Φ(X)\Phi(X).

Choi’s theorem states that, in finite dimensions,

Φ is completely positive⟺JΦ≥0.\Phi\ \text{is completely positive} \quad\Longleftrightarrow\quad J_\Phi\ge0.

One direction is immediate from the definition. If Φ\Phi is completely positive, then

(Φ⊗id)(∣Ω⟩⟨Ω∣)≥0,(\Phi\otimes\mathrm{id}) \left( \lvert\Omega\rangle\langle\Omega\rvert \right) \ge0,

because ∣Ω⟩⟨Ω∣\lvert\Omega\rangle\langle\Omega\rvert is positive.

Conversely, if JΦ≥0J_\Phi\ge0, diagonalize it as

JΦ=∑rλr∣vr⟩⟨vr∣,λr>0.J_\Phi = \sum_r \lambda_r \lvert v_r\rangle\langle v_r\rvert, \qquad \lambda_r>0.

Unvectorizing

λr ∣vr⟩\sqrt{\lambda_r}\,\lvert v_r\rangle

gives Kraus operators KrK_r such that

Φ(ρ)=∑rKrρKr†.\Phi(\rho)=\sum_rK_r\rho K_r^\dagger.

Thus Φ\Phi is completely positive.

With the output-input convention, trace preservation is

Φ trace preserving⟺Tr⁡outJΦ=Iin.\Phi\ \text{trace preserving} \quad\Longleftrightarrow\quad \operatorname{Tr}_{\mathrm{out}}J_\Phi=I_{\mathrm{in}}.

Proof:

Tr⁡outJΦ=∑i,jTr⁡ ⁣[Φ(∣i⟩⟨j∣)]∣i⟩⟨j∣.\operatorname{Tr}_{\mathrm{out}}J_\Phi = \sum_{i,j} \operatorname{Tr} \!\left[ \Phi(\lvert i\rangle\langle j\rvert) \right] \lvert i\rangle\langle j\rvert.

If Φ\Phi is trace preserving, then

Tr⁡ ⁣[Φ(∣i⟩⟨j∣)]=Tr⁡(∣i⟩⟨j∣)=δij,\operatorname{Tr} \!\left[ \Phi(\lvert i\rangle\langle j\rvert) \right] = \operatorname{Tr}(\lvert i\rangle\langle j\rvert) = \delta_{ij},

so the partial trace is IinI_{\mathrm{in}}.

Trace nonincrease is the inequality

Tr⁡outJΦ≤Iin.\operatorname{Tr}_{\mathrm{out}}J_\Phi \le I_{\mathrm{in}}.

This is the Choi form of a selected measurement branch or probabilistic operation.

For a map from Hin\mathcal H_{\mathrm{in}} to the same output dimension, unitality means

Φ(Iin)=Iout.\Phi(I_{\mathrm{in}})=I_{\mathrm{out}}.

In Choi form,

Φ(Iin)=Tr⁡inJΦ.\Phi(I_{\mathrm{in}}) = \operatorname{Tr}_{\mathrm{in}}J_\Phi.

Therefore

Φ unital⟺Tr⁡inJΦ=Iout.\Phi\ \text{unital} \quad\Longleftrightarrow\quad \operatorname{Tr}_{\mathrm{in}}J_\Phi=I_{\mathrm{out}}.

Do not confuse this with trace preservation. Trace preservation traces out the output factor of JΦJ_\Phi; unitality traces out the input factor.

If

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

then

JΦ=∑α=1r∣Kα⟩ ⁣⟩⟨ ⁣⟨Kα∣,J_\Phi = \sum_{\alpha=1}^r \lvert K_\alpha\rangle\!\rangle \langle\!\langle K_\alpha\rvert,

where

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

The minimal number of Kraus operators in any representation is

rmin⁡=rank⁡JΦ.r_{\min} = \operatorname{rank}J_\Phi.

This is the same number as the minimal environment dimension in a finite-dimensional Stinespring representation.

For the identity channel id\mathrm{id} on a dd-dimensional Hilbert space,

id(∣i⟩⟨j∣)=∣i⟩⟨j∣.\mathrm{id}(\lvert i\rangle\langle j\rvert) = \lvert i\rangle\langle j\rvert.

Thus

Jid=∑i,j∣i⟩⟨j∣⊗∣i⟩⟨j∣=∣Ω⟩⟨Ω∣.J_{\mathrm{id}} = \sum_{i,j} \lvert i\rangle\langle j\rvert \otimes \lvert i\rangle\langle j\rvert = \lvert\Omega\rangle\langle\Omega\rvert.

The identity channel has Choi rank 11, matching its single Kraus operator K=IK=I.

Since ∣Ω⟩\lvert\Omega\rangle is unnormalized,

Tr⁡Jid=d.\operatorname{Tr}J_{\mathrm{id}}=d.

The normalized state associated with the identity channel is Jid/dJ_{\mathrm{id}}/d.

For the completely depolarizing channel on a dd-dimensional system,

Δ(ρ)=Tr⁡(ρ)Id.\Delta(\rho) = \operatorname{Tr}(\rho)\frac{I}{d}.

Since

Δ(∣i⟩⟨j∣)=δijId,\Delta(\lvert i\rangle\langle j\rvert) = \delta_{ij}\frac{I}{d},

the Choi matrix is

JΔ=Id⊗I.J_\Delta = \frac{I}{d}\otimes I.

It is positive, trace preserving, and full rank. Its minimal Kraus rank is d2d^2.

The interpolating Depolarizing Channel has Choi matrix

JDλ=λ∣Ω⟩⟨Ω∣+1−λdI⊗I,J_{\mathcal D_\lambda} = \lambda\lvert\Omega\rangle\langle\Omega\rvert + \frac{1-\lambda}{d}I\otimes I,

which gives the complete-positivity interval −1/(d2−1)≤λ≤1-1/(d^2-1)\le\lambda\le1.

The transpose map

T(X)=XTT(X)=X^{\mathsf T}

has Choi matrix

JT=∑i,j∣j⟩⟨i∣⊗∣i⟩⟨j∣.J_T = \sum_{i,j} \lvert j\rangle\langle i\rvert \otimes \lvert i\rangle\langle j\rvert.

This is the swap operator:

JT=S.J_T=S.

The swap operator has eigenvalue +1+1 on the symmetric subspace and eigenvalue −1-1 on the antisymmetric subspace. Therefore JTJ_T is not positive when d≥2d\ge2, and the transpose map is not completely positive.

This example is the Choi-matrix version of the standard partial-transpose test.

Let

Φη((ρ00ρ01ρ10ρ11))=(ρ00ηρ01η∗ρ10ρ11).\Phi_\eta \left( \begin{pmatrix} \rho_{00} & \rho_{01}\\ \rho_{10} & \rho_{11} \end{pmatrix} \right) = \begin{pmatrix} \rho_{00} & \eta\rho_{01}\\ \eta^*\rho_{10} & \rho_{11} \end{pmatrix}.

In the ordered output-input basis

∣00⟩,∣01⟩,∣10⟩,∣11⟩,\lvert00\rangle,\lvert01\rangle,\lvert10\rangle,\lvert11\rangle,

the Choi matrix is

JΦη=(100η00000000η∗001).J_{\Phi_\eta} = \begin{pmatrix} 1 & 0 & 0 & \eta\\ 0 & 0 & 0 & 0\\ 0 & 0 & 0 & 0\\ \eta^* & 0 & 0 & 1 \end{pmatrix}.

Its nonzero block has eigenvalues

1+∣η∣,1−∣η∣.1+|\eta|, \qquad 1-|\eta|.

Therefore

JΦη≥0⟺∣η∣≤1.J_{\Phi_\eta}\ge0 \quad\Longleftrightarrow\quad |\eta|\le1.

This is exactly the complete-positivity condition for the phase-damping channel.

For the Amplitude-Damping Channel with decay probability γ\gamma, the Choi matrix in the same output-input convention is

JAγ=(1001−γ0γ0000001−γ001−γ).J_{\mathcal A_\gamma} = \begin{pmatrix} 1&0&0&\sqrt{1-\gamma}\\ 0&\gamma&0&0\\ 0&0&0&0\\ \sqrt{1-\gamma}&0&0&1-\gamma \end{pmatrix}.

Its nonzero eigenvalues are 2−γ2-\gamma and γ\gamma, so the channel is completely positive for 0≤γ≤10\le\gamma\le1 and has Kraus rank 22 when γ>0\gamma>0.

If the normalized maximally entangled state is

∣ΩN⟩=1d∑i=1d∣i⟩⊗∣i⟩,\lvert\Omega_N\rangle = \frac{1}{\sqrt d} \sum_{i=1}^d \lvert i\rangle\otimes\lvert i\rangle,

then applying Φ\Phi to half of it gives

(Φ⊗id)(∣ΩN⟩⟨ΩN∣)=1dJΦ.(\Phi\otimes\mathrm{id}) \left( \lvert\Omega_N\rangle\langle\Omega_N\rvert \right) = \frac{1}{d}J_\Phi.

Thus JΦ/dJ_\Phi/d is a bipartite density operator exactly when Φ\Phi is a channel from a dd-dimensional input:

JΦ≥0,Tr⁡outJΦ=Iin.J_\Phi\ge0, \qquad \operatorname{Tr}_{\mathrm{out}}J_\Phi=I_{\mathrm{in}}.

This is the channel-state correspondence. It underlies process tomography, teleportation-based channel simulation, and semidefinite optimization over channels.

For the normalized bipartite-state viewpoint, marginal constraints, and identity/depolarizing/amplitude-damping examples, see Channel-State Duality.

The correspondence is basis dependent in its formula because of the transpose in the reconstruction rule, but the underlying relation is invariant once a convention is fixed.

In process tomography, estimating a channel can be formulated as estimating JΦJ_\Phi subject to physical constraints:

JΦ≥0,Tr⁡outJΦ=Iin.J_\Phi\ge0, \qquad \operatorname{Tr}_{\mathrm{out}}J_\Phi=I_{\mathrm{in}}.

These are semidefinite constraints. Many channel-optimization problems become semidefinite programs because probabilities and expectation values are linear functions of JΦJ_\Phi.

For example, if an experiment prepares input states ρk\rho_k and measures output effects MℓM_\ell, the probability is

p(ℓ∣k)=Tr⁡ ⁣[Mℓ Φ(ρk)].p(\ell|k) = \operatorname{Tr} \!\left[ M_\ell\,\Phi(\rho_k) \right].

Using the reconstruction formula, this is a linear function of JΦJ_\Phi.

Process Tomography develops the prepare-and-measure and ancilla-assisted protocols, identifiability, physical estimators, SPAM limits, validation, and scaling built on this formula.

Mixing normalized and unnormalized conventions

Section titled “Mixing normalized and unnormalized conventions”

This page uses ∣Ω⟩=∑i∣i⟩∣i⟩\lvert\Omega\rangle=\sum_i\lvert i\rangle\lvert i\rangle. If a source uses ∣ΩN⟩=d−1/2∑i∣i⟩∣i⟩\lvert\Omega_N\rangle=d^{-1/2}\sum_i\lvert i\rangle\lvert i\rangle, its Choi matrix differs by a factor of dd.

Some references define JΦJ_\Phi on input–output rather than output–input. Then the trace-preservation and reconstruction formulas look different.

The recovery formula uses XTX^{\mathsf T} in the chosen input basis:

Φ(X)=Tr⁡in ⁣[JΦ(I⊗XT)].\Phi(X) = \operatorname{Tr}_{\mathrm{in}} \!\left[ J_\Phi(I\otimes X^{\mathsf T}) \right].

Dropping the transpose silently changes the convention.

Trace preservation is not enough. A trace-preserving linear map is a channel only if its Choi matrix is also positive.

Starting from

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

prove that Tr⁡outJΦ=I\operatorname{Tr}_{\mathrm{out}}J_\Phi=I if Φ\Phi is trace preserving.

Solution

Taking the partial trace over the output system gives

Tr⁡outJΦ=∑i,jTr⁡ ⁣[Φ(∣i⟩⟨j∣)]∣i⟩⟨j∣.\operatorname{Tr}_{\mathrm{out}}J_\Phi = \sum_{i,j} \operatorname{Tr} \!\left[ \Phi(\lvert i\rangle\langle j\rvert) \right] \lvert i\rangle\langle j\rvert.

Trace preservation implies

Tr⁡ ⁣[Φ(∣i⟩⟨j∣)]=Tr⁡(∣i⟩⟨j∣)=δij.\operatorname{Tr} \!\left[ \Phi(\lvert i\rangle\langle j\rvert) \right] = \operatorname{Tr}(\lvert i\rangle\langle j\rvert) = \delta_{ij}.

Therefore

Tr⁡outJΦ=∑i∣i⟩⟨i∣=I.\operatorname{Tr}_{\mathrm{out}}J_\Phi = \sum_i\lvert i\rangle\langle i\rvert = I.

Show that Jid=∣Ω⟩⟨Ω∣J_{\mathrm{id}}=\lvert\Omega\rangle\langle\Omega\rvert and compute its rank.

Solution

For the identity channel,

id(∣i⟩⟨j∣)=∣i⟩⟨j∣.\mathrm{id}(\lvert i\rangle\langle j\rvert) = \lvert i\rangle\langle j\rvert.

Thus

Jid=∑i,j∣i⟩⟨j∣⊗∣i⟩⟨j∣=∣Ω⟩⟨Ω∣.J_{\mathrm{id}} = \sum_{i,j} \lvert i\rangle\langle j\rvert \otimes \lvert i\rangle\langle j\rvert = \lvert\Omega\rangle\langle\Omega\rvert.

This is a rank-one positive operator, so the identity channel has Kraus rank 11.

Use the dephasing Choi matrix to show that Φη\Phi_\eta is completely positive if and only if ∣η∣≤1|\eta|\le1.

Solution

The only nonzero block of JΦηJ_{\Phi_\eta} is

(1ηη∗1).\begin{pmatrix} 1 & \eta\\ \eta^* & 1 \end{pmatrix}.

Its eigenvalues are

1+∣η∣,1−∣η∣.1+|\eta|, \qquad 1-|\eta|.

The full Choi matrix is positive exactly when both are nonnegative, which is equivalent to

∣η∣≤1.|\eta|\le1.
  • M.-D. Choi, “Completely positive linear maps on complex matrices,” Linear Algebra and its Applications 10, 285–290 (1975).
  • A. Jamiołkowski, “Linear transformations which preserve trace and positive semidefiniteness of operators,” Reports on Mathematical Physics 3, 275–278 (1972).
  • E. C. G. Sudarshan, P. M. Mathews, and J. Rau, “Stochastic dynamics of quantum-mechanical systems,” Physical Review 121, 920–924 (1961).
  • 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).