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:
This page uses the output-input convention:
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.
Definition
Section titled “Definition”Let
be a linear map. Choose an orthonormal basis of and define the unnormalized maximally entangled vector
where is a reference copy of the input space.
The Choi matrix is
Equivalently,
The first tensor factor is the output system; the second is the input-reference system.
Recovering the Map
Section titled “Recovering the Map”The Choi matrix determines the map. For any input operator ,
where the transpose is taken in the same input basis used to define .
This transpose is a common source of mistakes. It appears because the input matrix elements are read from the reference half of .
To verify the formula, write
Then
and summing over gives .
Complete Positivity Test
Section titled “Complete Positivity Test”Choi’s theorem states that, in finite dimensions,
One direction is immediate from the definition. If is completely positive, then
because is positive.
Conversely, if , diagonalize it as
Unvectorizing
gives Kraus operators such that
Thus is completely positive.
Trace Preservation and Trace Nonincrease
Section titled “Trace Preservation and Trace Nonincrease”With the output-input convention, trace preservation is
Proof:
If is trace preserving, then
so the partial trace is .
Trace nonincrease is the inequality
This is the Choi form of a selected measurement branch or probabilistic operation.
Unital Maps
Section titled “Unital Maps”For a map from to the same output dimension, unitality means
In Choi form,
Therefore
Do not confuse this with trace preservation. Trace preservation traces out the output factor of ; unitality traces out the input factor.
Kraus Rank
Section titled “Kraus Rank”If
then
where
The minimal number of Kraus operators in any representation is
This is the same number as the minimal environment dimension in a finite-dimensional Stinespring representation.
Identity Channel
Section titled “Identity Channel”For the identity channel on a -dimensional Hilbert space,
Thus
The identity channel has Choi rank , matching its single Kraus operator .
Since is unnormalized,
The normalized state associated with the identity channel is .
Completely Depolarizing Channel
Section titled “Completely Depolarizing Channel”For the completely depolarizing channel on a -dimensional system,
Since
the Choi matrix is
It is positive, trace preserving, and full rank. Its minimal Kraus rank is .
The interpolating Depolarizing Channel has Choi matrix
which gives the complete-positivity interval .
Transpose Map
Section titled “Transpose Map”The transpose map
has Choi matrix
This is the swap operator:
The swap operator has eigenvalue on the symmetric subspace and eigenvalue on the antisymmetric subspace. Therefore is not positive when , and the transpose map is not completely positive.
This example is the Choi-matrix version of the standard partial-transpose test.
Qubit Dephasing Example
Section titled “Qubit Dephasing Example”Let
In the ordered output-input basis
the Choi matrix is
Its nonzero block has eigenvalues
Therefore
This is exactly the complete-positivity condition for the phase-damping channel.
Qubit Amplitude-Damping Example
Section titled “Qubit Amplitude-Damping Example”For the Amplitude-Damping Channel with decay probability , the Choi matrix in the same output-input convention is
Its nonzero eigenvalues are and , so the channel is completely positive for and has Kraus rank when .
Channel-State Duality
Section titled “Channel-State Duality”If the normalized maximally entangled state is
then applying to half of it gives
Thus is a bipartite density operator exactly when is a channel from a -dimensional input:
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.
Process Tomography and Optimization
Section titled “Process Tomography and Optimization”In process tomography, estimating a channel can be formulated as estimating subject to physical constraints:
These are semidefinite constraints. Many channel-optimization problems become semidefinite programs because probabilities and expectation values are linear functions of .
For example, if an experiment prepares input states and measures output effects , the probability is
Using the reconstruction formula, this is a linear function of .
Process Tomography develops the prepare-and-measure and ancilla-assisted protocols, identifiability, physical estimators, SPAM limits, validation, and scaling built on this formula.
Common Mistakes
Section titled “Common Mistakes”Mixing normalized and unnormalized conventions
Section titled “Mixing normalized and unnormalized conventions”This page uses . If a source uses , its Choi matrix differs by a factor of .
Reversing the tensor factors
Section titled “Reversing the tensor factors”Some references define on input–output rather than output–input. Then the trace-preservation and reconstruction formulas look different.
Forgetting the transpose
Section titled “Forgetting the transpose”The recovery formula uses in the chosen input basis:
Dropping the transpose silently changes the convention.
Checking only trace preservation
Section titled “Checking only trace preservation”Trace preservation is not enough. A trace-preserving linear map is a channel only if its Choi matrix is also positive.
Exercises
Section titled “Exercises”Trace-preservation condition
Section titled “Trace-preservation condition”Starting from
prove that if is trace preserving.
Solution
Taking the partial trace over the output system gives
Trace preservation implies
Therefore
Choi matrix of the identity channel
Section titled “Choi matrix of the identity channel”Show that and compute its rank.
Solution
For the identity channel,
Thus
This is a rank-one positive operator, so the identity channel has Kraus rank .
Complete positivity of dephasing
Section titled “Complete positivity of dephasing”Use the dephasing Choi matrix to show that is completely positive if and only if .
Solution
The only nonzero block of is
Its eigenvalues are
The full Choi matrix is positive exactly when both are nonnegative, which is equivalent to
References
Section titled “References”- 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).