Completely Positive Maps
A map that sends density operators to density operators had better send positive operators to positive operators — otherwise it could produce "states" with negative probabilities. But ordinary positivity is not enough to be a physical channel. The correct requirement is the stronger complete positivity, and the gap between the two is one of the most instructive facts in quantum information.
Positive maps
A linear map on operators is positive if it maps positive semidefinite operators to positive semidefinite operators:
This guarantees that if you feed a valid state of system in isolation, you get a valid (unnormalized) state of . The catch is the phrase "in isolation."
Why positivity is not enough: the partial transpose
Quantum systems are not isolated — your system may be entangled with a reference that the channel does not touch. The physically meaningful map is then , and it must also be positive. A map can be positive yet fail this test.
The canonical example is the transpose . Transposition preserves eigenvalues, so is positive: . Now apply to half of a two-qubit maximally entangled state . The result is the partial transpose of , which equals times the SWAP operator. SWAP has eigenvalues (symmetric subspace) and (antisymmetric subspace), so has eigenvalues — it is not positive. Transposition is positive but not completely positive, hence not a physical channel. (This negativity is exactly the basis of the PPT entanglement criterion you may meet later.)
Complete positivity
A linear map is completely positive (CP) if
where is the identity on an -dimensional ancilla. Equivalently, attaching any reference system and applying to one side never produces a negative operator. This is the property that makes safe to use as a subroutine inside a larger quantum process.
Choi's theorem: a finite test
Checking "for every " sounds impossible, but in finite dimensions there is a single, finite criterion. Let be a basis of and form the (unnormalized) maximally entangled vector . The Choi operator of is
Choi's theorem. is completely positive if and only if .
So an infinite family of conditions collapses to: form one operator and check that it is positive semidefinite. The transpose map fails precisely because its Choi operator is (proportional to) the SWAP, which has a negative eigenvalue. We devote a later lesson to this Choi–Jamiołkowski correspondence; here the point is that it gives complete positivity a concrete, checkable meaning.
Equivalent characterizations
Complete positivity has several faces, all equivalent in finite dimension:
- (Choi's criterion).
- for some operators (the Kraus form).
- for some unitary (the Stinespring dilation).
Each of the next lessons makes one of these concrete. Adding trace preservation on top turns a CP map into a full quantum channel.
The takeaway
Complete positivity is positivity that survives the presence of an untouched reference system: must be positive for all . The transpose shows the requirement has teeth — it is positive but not completely positive, and so is not a channel. Choi's theorem reduces the infinite test to a single positive-semidefinite check on the Choi operator, and CP maps are exactly those expressible in Kraus form or as a dilation.
Sign in on the full site to ask questions and join the discussion.