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 o u t J Φ = I i n , 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} complete positivity trace preservation minimal Kraus number ⟺ ⟺ ⟺ J Φ ≥ 0 , Tr out J Φ = I in , rank J Φ .
This page uses the output-input convention:
J Φ ∈ B ( H o u t ⊗ H i n ) . J_\Phi\in
\mathcal B(\mathcal H_{\mathrm{out}}\otimes\mathcal H_{\mathrm{in}}). J Φ ∈ B ( H out ⊗ H in ) .
Other references sometimes reverse the two tensor factors. The formulas involving partial traces and transposes must then be adjusted.
Simulating quantum channels implements this convention numerically.
Helpful background. Kraus representation supplies an operator-sum form; the partial trace reduces a bipartite matrix. Kraus, Choi, and Stinespring views compares these descriptions.
Let
Φ : B ( H i n ) → B ( H o u t ) \Phi:
\mathcal B(\mathcal H_{\mathrm{in}})
\to
\mathcal B(\mathcal H_{\mathrm{out}}) Φ : B ( H in ) → B ( H out )
be a linear map. Choose an orthonormal basis { ∣ i ⟩ } i = 1 d i n \{\lvert i\rangle\}_{i=1}^{d_{\mathrm{in}}} {∣ i ⟩ } i = 1 d in of H i n \mathcal H_{\mathrm{in}} H in and define the unnormalized maximally entangled vector
∣ Ω ⟩ = ∑ i = 1 d i n ∣ i ⟩ i n ⊗ ∣ i ⟩ R , \lvert\Omega\rangle
=
\sum_{i=1}^{d_{\mathrm{in}}}
\lvert i\rangle_{\mathrm{in}}
\otimes
\lvert i\rangle_R, ∣ Ω ⟩ = i = 1 ∑ d in ∣ i ⟩ in ⊗ ∣ i ⟩ R ,
where R R R is a reference copy of the input space.
The Choi matrix is
J Φ = ( Φ ⊗ i d R ) ( ∣ Ω ⟩ ⟨ Ω ∣ ) . J_\Phi
=
(\Phi\otimes\mathrm{id}_R)
\left(
\lvert\Omega\rangle\langle\Omega\rvert
\right). J Φ = ( Φ ⊗ id R ) ( ∣ Ω ⟩ ⟨ Ω ∣ ) .
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. J Φ = i , j ∑ Φ (∣ i ⟩ ⟨ j ∣) ⊗ ∣ i ⟩ ⟨ j ∣ .
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 X X X ,
Φ ( X ) = Tr i n [ J Φ ( I o u t ⊗ X T ) ] , \Phi(X)
=
\operatorname{Tr}_{\mathrm{in}}
\!\left[
J_\Phi
\left(
I_{\mathrm{out}}\otimes X^{\mathsf T}
\right)
\right], Φ ( X ) = Tr in [ J Φ ( I out ⊗ X T ) ] ,
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 , j X i j ∣ i ⟩ ⟨ j ∣ . X=\sum_{i,j}X_{ij}\lvert i\rangle\langle j\rvert. X = i , j ∑ X ij ∣ i ⟩ ⟨ j ∣ .
Then
Tr i n [ ( Φ ( ∣ i ⟩ ⟨ j ∣ ) ⊗ ∣ i ⟩ ⟨ j ∣ ) ( I o u t ⊗ X T ) ] = X i j Φ ( ∣ 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), Tr in [ ( Φ (∣ i ⟩ ⟨ j ∣) ⊗ ∣ i ⟩ ⟨ j ∣ ) ( I out ⊗ X T ) ] = X ij Φ (∣ i ⟩ ⟨ j ∣) ,
and summing over i , j i,j i , j gives Φ ( X ) \Phi(X) Φ ( X ) .
A sign-sensitive check is the identity channel acting on ∣ + y ⟩ = ( ∣ 0 ⟩ + i ∣ 1 ⟩ ) / 2 |+y\rangle=(|0\rangle+i|1\rangle)/\sqrt2 ∣ + y ⟩ = ( ∣0 ⟩ + i ∣1 ⟩) / 2 :
X = 1 2 ( 1 − i i 1 ) . X=\frac12\begin{pmatrix}1&-i\\i&1\end{pmatrix}. X = 2 1 ( 1 i − i 1 ) .
The formula returns X X X . Replacing X T X^{\mathsf T} X T with X X X would return X T = ∣ − y ⟩ ⟨ − y ∣ X^{\mathsf T}=|-y\rangle\langle-y| X T = ∣ − y ⟩ ⟨ − y ∣ , an orthogonal state. Real diagonal test inputs would miss this error.
Choi’s theorem states that, in finite dimensions,
Φ is completely positive ⟺ J Φ ≥ 0. \Phi\ \text{is completely positive}
\quad\Longleftrightarrow\quad
J_\Phi\ge0. Φ is completely positive ⟺ J Φ ≥ 0.
One direction is immediate from the definition. If Φ \Phi Φ is completely positive, then
( Φ ⊗ i d ) ( ∣ Ω ⟩ ⟨ Ω ∣ ) ≥ 0 , (\Phi\otimes\mathrm{id})
\left(
\lvert\Omega\rangle\langle\Omega\rvert
\right)
\ge0, ( Φ ⊗ id ) ( ∣ Ω ⟩ ⟨ Ω ∣ ) ≥ 0 ,
because ∣ Ω ⟩ ⟨ Ω ∣ \lvert\Omega\rangle\langle\Omega\rvert ∣ Ω ⟩ ⟨ Ω ∣ is positive.
Conversely, if J Φ ≥ 0 J_\Phi\ge0 J Φ ≥ 0 , diagonalize it as
J Φ = ∑ r λ r ∣ v r ⟩ ⟨ v r ∣ , λ r > 0. J_\Phi
=
\sum_r
\lambda_r
\lvert v_r\rangle\langle v_r\rvert,
\qquad
\lambda_r>0. J Φ = r ∑ λ r ∣ v r ⟩ ⟨ v r ∣ , λ r > 0.
Unvectorizing
λ r ∣ v r ⟩ \sqrt{\lambda_r}\,\lvert v_r\rangle λ r ∣ v r ⟩
gives Kraus operators K r K_r K r such that
Φ ( ρ ) = ∑ r K r ρ K r † . \Phi(\rho)=\sum_rK_r\rho K_r^\dagger. Φ ( ρ ) = r ∑ K r ρ K r † .
Thus Φ \Phi Φ is completely positive.
With the output-input convention, trace preservation is
Φ trace preserving ⟺ Tr o u t J Φ = I i n . \Phi\ \text{trace preserving}
\quad\Longleftrightarrow\quad
\operatorname{Tr}_{\mathrm{out}}J_\Phi=I_{\mathrm{in}}. Φ trace preserving ⟺ Tr out J Φ = I in .
Proof:
Tr o u t J Φ = ∑ i , j Tr [ Φ ( ∣ 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. Tr out J Φ = i , j ∑ Tr [ Φ (∣ i ⟩ ⟨ j ∣) ] ∣ i ⟩ ⟨ j ∣ .
If Φ \Phi Φ is trace preserving, then
Tr [ Φ ( ∣ i ⟩ ⟨ j ∣ ) ] = Tr ( ∣ i ⟩ ⟨ j ∣ ) = δ i j , \operatorname{Tr}
\!\left[
\Phi(\lvert i\rangle\langle j\rvert)
\right]
=
\operatorname{Tr}(\lvert i\rangle\langle j\rvert)
=
\delta_{ij}, Tr [ Φ (∣ i ⟩ ⟨ j ∣) ] = Tr (∣ i ⟩ ⟨ j ∣) = δ ij ,
so the partial trace is I i n I_{\mathrm{in}} I in .
Trace nonincrease is the inequality
Tr o u t J Φ ≤ I i n . \operatorname{Tr}_{\mathrm{out}}J_\Phi
\le
I_{\mathrm{in}}. Tr out J Φ ≤ I in .
Together with J Φ ≥ 0 J_\Phi\ge0 J Φ ≥ 0 , this describes a possible selected operation. More generally, Tr o u t J Φ = [ Φ † ( I ) ] T \operatorname{Tr}_{\mathrm{out}}J_\Phi=[\Phi^\dagger(I)]^{\mathsf T} Tr out J Φ = [ Φ † ( I ) ] T ; transposition preserves the operator inequality against I I I .
For a map from H i n \mathcal H_{\mathrm{in}} H in to the same output dimension, unitality means
Φ ( I i n ) = I o u t . \Phi(I_{\mathrm{in}})=I_{\mathrm{out}}. Φ ( I in ) = I out .
In Choi form,
Φ ( I i n ) = Tr i n J Φ . \Phi(I_{\mathrm{in}})
=
\operatorname{Tr}_{\mathrm{in}}J_\Phi. Φ ( I in ) = Tr in J Φ .
Therefore
Φ unital ⟺ Tr i n J Φ = I o u t . \Phi\ \text{unital}
\quad\Longleftrightarrow\quad
\operatorname{Tr}_{\mathrm{in}}J_\Phi=I_{\mathrm{out}}. Φ unital ⟺ Tr in J Φ = I out .
Do not confuse this with trace preservation. Trace preservation traces out the output factor of J Φ J_\Phi J Φ ; unitality traces out the input factor.
If
Φ ( ρ ) = ∑ α = 1 r K α ρ K α † , \Phi(\rho)
=
\sum_{\alpha=1}^r
K_\alpha\rho K_\alpha^\dagger, Φ ( ρ ) = α = 1 ∑ r K α ρ K α † ,
then
J Φ = ∑ α = 1 r ∣ K α ⟩ ⟩ ⟨ ⟨ K α ∣ , J_\Phi
=
\sum_{\alpha=1}^r
\lvert K_\alpha\rangle\!\rangle
\langle\!\langle K_\alpha\rvert, J Φ = α = 1 ∑ r ∣ K α ⟩ ⟩ ⟨ ⟨ K α ∣ ,
where
∣ K ⟩ ⟩ = ∑ a , i K a i ∣ a ⟩ o u t ⊗ ∣ i ⟩ i n . \lvert K\rangle\!\rangle
=
\sum_{a,i}
K_{ai}
\lvert a\rangle_{\mathrm{out}}
\otimes
\lvert i\rangle_{\mathrm{in}}. ∣ K ⟩ ⟩ = a , i ∑ K ai ∣ a ⟩ out ⊗ ∣ i ⟩ in .
The minimal number of Kraus operators in any representation is
r min = rank J Φ . r_{\min}
=
\operatorname{rank}J_\Phi. r m i n = rank J Φ .
This is the same number as the minimal environment dimension in a finite-dimensional isometric , or pure-environment, Stinespring representation .
For the identity channel i d \mathrm{id} id on a d d d -dimensional Hilbert space,
i d ( ∣ i ⟩ ⟨ j ∣ ) = ∣ i ⟩ ⟨ j ∣ . \mathrm{id}(\lvert i\rangle\langle j\rvert)
=
\lvert i\rangle\langle j\rvert. id (∣ i ⟩ ⟨ j ∣) = ∣ i ⟩ ⟨ j ∣ .
Thus
J i d = ∑ 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. J id = i , j ∑ ∣ i ⟩ ⟨ j ∣ ⊗ ∣ i ⟩ ⟨ j ∣ = ∣ Ω ⟩ ⟨ Ω ∣ .
The identity channel has Choi rank 1 1 1 , matching its single Kraus operator K = I K=I K = I .
Since ∣ Ω ⟩ \lvert\Omega\rangle ∣ Ω ⟩ is unnormalized,
Tr J i d = d . \operatorname{Tr}J_{\mathrm{id}}=d. Tr J id = d .
The normalized state associated with the identity channel is J i d / d J_{\mathrm{id}}/d J id / d .
For the completely depolarizing channel on a d d d -dimensional system,
Δ ( ρ ) = Tr ( ρ ) I d . \Delta(\rho)
=
\operatorname{Tr}(\rho)\frac{I}{d}. Δ ( ρ ) = Tr ( ρ ) d I .
Since
Δ ( ∣ i ⟩ ⟨ j ∣ ) = δ i j I d , \Delta(\lvert i\rangle\langle j\rvert)
=
\delta_{ij}\frac{I}{d}, Δ (∣ i ⟩ ⟨ j ∣) = δ ij d I ,
the Choi matrix is
J Δ = I d ⊗ I . J_\Delta
=
\frac{I}{d}\otimes I. J Δ = d I ⊗ I .
It is positive, trace preserving, and full rank. Its minimal Kraus rank is d 2 d^2 d 2 .
The interpolating Depolarizing Channel has Choi matrix
J D λ = λ ∣ Ω ⟩ ⟨ Ω ∣ + 1 − λ d I ⊗ I , J_{\mathcal D_\lambda}
=
\lambda\lvert\Omega\rangle\langle\Omega\rvert
+
\frac{1-\lambda}{d}I\otimes I, J D λ = λ ∣ Ω ⟩ ⟨ Ω ∣ + d 1 − λ I ⊗ I ,
For d ≥ 2 d\ge2 d ≥ 2 , the eigenvalue along ∣ Ω ⟩ |\Omega\rangle ∣Ω ⟩ is [ 1 + ( d 2 − 1 ) λ ] / d [1+(d^2-1)\lambda]/d [ 1 + ( d 2 − 1 ) λ ] / d , and each of the d 2 − 1 d^2-1 d 2 − 1 orthogonal eigenvalues is ( 1 − λ ) / d (1-\lambda)/d ( 1 − λ ) / d . Their nonnegativity gives − 1 / ( d 2 − 1 ) ≤ λ ≤ 1 -1/(d^2-1)\le\lambda\le1 − 1/ ( d 2 − 1 ) ≤ λ ≤ 1 .
The transpose map
T ( X ) = X T T(X)=X^{\mathsf T} T ( X ) = X T
has Choi matrix
J T = ∑ i , j ∣ j ⟩ ⟨ i ∣ ⊗ ∣ i ⟩ ⟨ j ∣ . J_T
=
\sum_{i,j}
\lvert j\rangle\langle i\rvert
\otimes
\lvert i\rangle\langle j\rvert. J T = i , j ∑ ∣ j ⟩ ⟨ i ∣ ⊗ ∣ i ⟩ ⟨ j ∣ .
This is the swap operator:
J T = S . J_T=S. J T = S .
The swap operator has eigenvalue + 1 +1 + 1 on the symmetric subspace and eigenvalue − 1 -1 − 1 on the antisymmetric subspace. Therefore J T J_T J T is not positive when d ≥ 2 d\ge2 d ≥ 2 , 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}. Φ η ( ( ρ 00 ρ 10 ρ 01 ρ 11 ) ) = ( ρ 00 η ∗ ρ 10 η ρ 01 ρ 11 ) .
In the ordered output-input basis
∣ 00 ⟩ , ∣ 01 ⟩ , ∣ 10 ⟩ , ∣ 11 ⟩ , \lvert00\rangle,\lvert01\rangle,\lvert10\rangle,\lvert11\rangle, ∣ 00 ⟩ , ∣ 01 ⟩ , ∣ 10 ⟩ , ∣ 11 ⟩ ,
the Choi matrix is
J Φ η = ( 1 0 0 η 0 0 0 0 0 0 0 0 η ∗ 0 0 1 ) . J_{\Phi_\eta}
=
\begin{pmatrix}
1 & 0 & 0 & \eta\\
0 & 0 & 0 & 0\\
0 & 0 & 0 & 0\\
\eta^* & 0 & 0 & 1
\end{pmatrix}. J Φ η = 1 0 0 η ∗ 0 0 0 0 0 0 0 0 η 0 0 1 .
Its nonzero block has eigenvalues
1 + ∣ η ∣ , 1 − ∣ η ∣ . 1+|\eta|,
\qquad
1-|\eta|. 1 + ∣ η ∣ , 1 − ∣ η ∣.
Therefore
J Φ η ≥ 0 ⟺ ∣ η ∣ ≤ 1. J_{\Phi_\eta}\ge0
\quad\Longleftrightarrow\quad
|\eta|\le1. J Φ η ≥ 0 ⟺ ∣ η ∣ ≤ 1.
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
J A γ = ( 1 0 0 1 − γ 0 γ 0 0 0 0 0 0 1 − γ 0 0 1 − γ ) . 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}. J A γ = 1 0 0 1 − γ 0 γ 0 0 0 0 0 0 1 − γ 0 0 1 − γ .
Its nonzero eigenvalues are 2 − γ 2-\gamma 2 − γ and γ \gamma γ , so the channel is completely positive for 0 ≤ γ ≤ 1 0\le\gamma\le1 0 ≤ γ ≤ 1 and has Kraus rank 2 2 2 when γ > 0 \gamma>0 γ > 0 .
If the normalized maximally entangled state is
∣ Ω N ⟩ = 1 d ∑ i = 1 d ∣ i ⟩ ⊗ ∣ i ⟩ , \lvert\Omega_N\rangle
=
\frac{1}{\sqrt d}
\sum_{i=1}^d
\lvert i\rangle\otimes\lvert i\rangle, ∣ Ω N ⟩ = d 1 i = 1 ∑ d ∣ i ⟩ ⊗ ∣ i ⟩ ,
then applying Φ \Phi Φ to half of it gives
( Φ ⊗ i d ) ( ∣ Ω N ⟩ ⟨ Ω N ∣ ) = 1 d J Φ . (\Phi\otimes\mathrm{id})
\left(
\lvert\Omega_N\rangle\langle\Omega_N\rvert
\right)
=
\frac{1}{d}J_\Phi. ( Φ ⊗ id ) ( ∣ Ω N ⟩ ⟨ Ω N ∣ ) = d 1 J Φ .
Every channel gives a density operator J Φ / d J_\Phi/d J Φ / d , but positivity and unit trace alone do not imply a channel. The necessary and sufficient conditions include the full marginal constraint:
J Φ ≥ 0 , Tr o u t J Φ = I i n . J_\Phi\ge0,
\qquad
\operatorname{Tr}_{\mathrm{out}}J_\Phi=I_{\mathrm{in}}. J Φ ≥ 0 , Tr out J Φ = I in .
For example, the qubit map E ( ρ ) = K ρ K † \mathcal E(\rho)=K\rho K^\dagger E ( ρ ) = K ρ K † with K = 2 ∣ 0 ⟩ ⟨ 0 ∣ K=\sqrt2|0\rangle\langle0| K = 2 ∣0 ⟩ ⟨ 0∣ has J E = 2 ∣ 00 ⟩ ⟨ 00 ∣ J_{\mathcal E}=2|00\rangle\langle00| J E = 2∣00 ⟩ ⟨ 00∣ . Dividing by two gives a valid bipartite density operator, but its reference marginal is ∣ 0 ⟩ ⟨ 0 ∣ |0\rangle\langle0| ∣0 ⟩ ⟨ 0∣ , not I / 2 I/2 I /2 . The map would assign trace two to input ∣ 0 ⟩ ⟨ 0 ∣ |0\rangle\langle0| ∣0 ⟩ ⟨ 0∣ , so it is not a physical operation.
The constrained channel-state correspondence underlies process tomography and optimization over channels. Some channel simulations also use Choi states, with additional operational conditions.
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 J Φ subject to physical constraints:
J Φ ≥ 0 , Tr o u t J Φ = I i n . J_\Phi\ge0,
\qquad
\operatorname{Tr}_{\mathrm{out}}J_\Phi=I_{\mathrm{in}}. J Φ ≥ 0 , Tr out J Φ = I in .
These are semidefinite constraints. Many channel-optimization problems become semidefinite programs because probabilities and expectation values are linear functions of J Φ J_\Phi J Φ .
For example, if an experiment prepares input states ρ k \rho_k ρ k and measures output effects M ℓ M_\ell M ℓ , the probability is
p ( ℓ ∣ k ) = Tr [ M ℓ Φ ( ρ k ) ] . p(\ell|k)
=
\operatorname{Tr}
\!\left[
M_\ell\,\Phi(\rho_k)
\right]. p ( ℓ ∣ k ) = Tr [ M ℓ Φ ( ρ k ) ] .
The reconstruction formula makes the dependence explicit:
p ( ℓ ∣ k ) = Tr [ ( M ℓ ⊗ ρ k T ) J Φ ] . p(\ell|k)=\operatorname{Tr}[(M_\ell\otimes\rho_k^{\mathsf T})J_\Phi]. p ( ℓ ∣ k ) = Tr [( M ℓ ⊗ ρ k T ) J Φ ] .
Thus the unknown Choi entries enter linearly. The input-first convention used in some measurement-tomography formulas swaps these tensor factors as well as those of the Choi matrix.
Process Tomography
develops the prepare-and-measure and ancilla-assisted protocols, identifiability,
physical estimators, SPAM limits, validation, and scaling built on this formula.
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, J Φ = i , j ∑ Φ (∣ i ⟩ ⟨ j ∣) ⊗ ∣ i ⟩ ⟨ j ∣ ,
prove that Tr o u t J Φ = I \operatorname{Tr}_{\mathrm{out}}J_\Phi=I Tr out J Φ = I if Φ \Phi Φ is trace preserving.
Solution
Taking the partial trace over the output system gives
Tr o u t J Φ = ∑ i , j Tr [ Φ ( ∣ 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. Tr out J Φ = i , j ∑ Tr [ Φ (∣ i ⟩ ⟨ j ∣) ] ∣ i ⟩ ⟨ j ∣ .
Trace preservation implies
Tr [ Φ ( ∣ i ⟩ ⟨ j ∣ ) ] = Tr ( ∣ i ⟩ ⟨ j ∣ ) = δ i j . \operatorname{Tr}
\!\left[
\Phi(\lvert i\rangle\langle j\rvert)
\right]
=
\operatorname{Tr}(\lvert i\rangle\langle j\rvert)
=
\delta_{ij}. Tr [ Φ (∣ i ⟩ ⟨ j ∣) ] = Tr (∣ i ⟩ ⟨ j ∣) = δ ij .
Therefore
Tr o u t J Φ = ∑ i ∣ i ⟩ ⟨ i ∣ = I . \operatorname{Tr}_{\mathrm{out}}J_\Phi
=
\sum_i\lvert i\rangle\langle i\rvert
=
I. Tr out J Φ = i ∑ ∣ i ⟩ ⟨ i ∣ = I .
Show that J i d = ∣ Ω ⟩ ⟨ Ω ∣ J_{\mathrm{id}}=\lvert\Omega\rangle\langle\Omega\rvert J id = ∣ Ω ⟩ ⟨ Ω ∣ and compute its rank.
Solution
For the identity channel,
i d ( ∣ i ⟩ ⟨ j ∣ ) = ∣ i ⟩ ⟨ j ∣ . \mathrm{id}(\lvert i\rangle\langle j\rvert)
=
\lvert i\rangle\langle j\rvert. id (∣ i ⟩ ⟨ j ∣) = ∣ i ⟩ ⟨ j ∣ .
Thus
J i d = ∑ 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. J id = i , j ∑ ∣ i ⟩ ⟨ j ∣ ⊗ ∣ i ⟩ ⟨ j ∣ = ∣ Ω ⟩ ⟨ Ω ∣ .
This is a rank-one positive operator, so the identity channel has Kraus rank 1 1 1 .
Use the dephasing Choi matrix to show that Φ η \Phi_\eta Φ η is completely positive if and only if ∣ η ∣ ≤ 1 |\eta|\le1 ∣ η ∣ ≤ 1 .
Solution
The only nonzero block of J Φ η J_{\Phi_\eta} J Φ η is
( 1 η η ∗ 1 ) . \begin{pmatrix}
1 & \eta\\
\eta^* & 1
\end{pmatrix}. ( 1 η ∗ η 1 ) .
Its eigenvalues are
1 + ∣ η ∣ , 1 − ∣ η ∣ . 1+|\eta|,
\qquad
1-|\eta|. 1 + ∣ η ∣ , 1 − ∣ η ∣.
The full Choi matrix is positive exactly when both are nonnegative, which is equivalent to
∣ η ∣ ≤ 1. |\eta|\le1. ∣ η ∣ ≤ 1.
M.-D. Choi, “Completely positive linear maps on complex matrices,” Linear Algebra and its Applications 10 , 285–290 (1975). Article .
A. Jamiołkowski, “Linear transformations which preserve trace and positive semidefiniteness of operators,” Reports on Mathematical Physics 3 , 275–278 (1972). Article .
J. Watrous, The Theory of Quantum Information , Cambridge University Press (2018), chapter 2. Author’s text .