Completely Positive Maps
Complete positivity ensures that a linear map preserves positivity even on entangled inputs. A physically allowed outcome operation must additionally be trace nonincreasing; complete positivity alone does not ensure valid probabilities. They appear in measurement theory, noise models, reduced dynamics, quantum information, and master equations.
For the broader operation/channel vocabulary, including trace-preserving and selected trace-nonincreasing branches, see Quantum Operations.
The key point is not just that a map should send density operators to density operators. It must remain physically valid when the system is part of a larger entangled system:
Here is a reference system that is not touched. Complete positivity is the requirement that this condition hold for every possible reference system.
Helpful background. Quantum operations defines the maps, and entangled states explains why testing a larger input is necessary. We use finite-dimensional input and output spaces throughout.
Positive maps and entangled inputs
Section titled “Positive maps and entangled inputs”Let be a linear map from operators on to operators on . The map is positive if
Positivity is necessary because a density operator is positive. If , then a valid output state should also be positive.
Positivity suffices for a separable joint state : applying to each positive leaves a positive sum. The extra difficulty is entanglement. A positive map can fail when the joint state cannot be written as such a mixture.
Complete Positivity
Section titled “Complete Positivity”For a positive integer , the map is -positive if
is positive on operators acting on .
The map is completely positive if it is -positive for every :
for every finite-dimensional reference system .
In finite dimensions, it is enough to test a reference system whose dimension equals the input dimension of . This is the content behind the Choi criterion.
Transpose Map Example
Section titled “Transpose Map Example”The transpose map
is positive. If , then because transposition preserves the spectrum of a Hermitian matrix.
However, is not completely positive. To see this, take the Bell state
Its density operator is
Apply transposition to the first qubit only:
In the ordered basis
this operator is
The middle block has eigenvalues and . The negative eigenvector is , so testing the proposed output with the valid projector would give probability . This is the physical contradiction, even though the output is Hermitian and still has trace one.
The transpose map is a perfectly useful mathematical operation, and partial transpose is an important entanglement diagnostic. But transposition is not a physical quantum channel acting locally on an unknown system.
Choi Positivity Test
Section titled “Choi Positivity Test”For a map , define the unnormalized maximally entangled vector
The Choi matrix of is
Choi’s theorem says that, in finite dimensions,
Here is ordered as output tensor input-reference, and is unnormalized. This is often the most practical test for complete positivity. It is also the bridge to process tomography, channel-state duality, semidefinite optimization, and minimal Kraus representations.
The normalized Bell-state output above is . The unnormalized Choi matrix is the swap operator, with eigenvalues on the symmetric subspace and on the antisymmetric subspace. The sign test is unchanged by normalization.
Kraus Maps Are Completely Positive
Section titled “Kraus Maps Are Completely Positive”Any map with a Kraus form
is completely positive. To see why, attach a reference :
If , then each term
is positive, and a sum of positive operators is positive. Therefore the extended map is positive for every .
This simple argument is one reason Kraus representations are so useful: complete positivity is automatic.
Trace Conditions Are Separate
Section titled “Trace Conditions Are Separate”Complete positivity controls positivity of the output. It does not by itself control normalization.
A completely positive map may be trace preserving:
as for a deterministic quantum channel. It may also be trace nonincreasing:
as for a selected measurement outcome.
In Kraus form, trace preservation is the condition
while trace nonincrease is
Thus the usual physical classes are:
| Map type | Positivity condition | Trace condition | Meaning |
|---|---|---|---|
| CP | completely positive | none specified | positive-output map; not necessarily a physical operation |
| CPTNI | completely positive | trace nonincreasing | possible selected outcome or postselected branch |
| CPTP | completely positive | trace preserving | deterministic channel or nonselective evolution |
Relation to Open Systems
Section titled “Relation to Open Systems”Complete positivity arises naturally from a system-environment model. Suppose
where is a fixed environment state and is unitary. This map is completely positive and trace preserving.
It is trace preserving because unitary evolution and partial trace preserve total trace. It is completely positive because the same construction remains positive after adding an untouched reference:
The displayed tensor factors are implicitly reordered so that acts on and , with untouched. Every step preserves positivity.
This is the reduced-dynamics origin of quantum channels. A closed unitary theory for a larger system becomes a completely positive map for a subsystem when inaccessible degrees of freedom are ignored. The channel-side representation is organized in Stinespring Representation.
When Complete Positivity Can Be Subtle
Section titled “When Complete Positivity Can Be Subtle”Complete positivity is the standard requirement for maps that act on arbitrary system states and are compatible with arbitrary reference systems. There are subtleties when a map is defined only on a restricted set of states, or when the system has fixed initial correlations with an environment.
In such cases, one must distinguish:
- a universally valid channel on all system states;
- an effective map on a restricted compatibility domain;
- a dynamical assignment that depends on initial system-environment correlations;
- a mathematical positive map used as a diagnostic rather than as a physical operation.
Most textbook noise models, measurement instruments, and Markovian master equations use completely positive maps because they are meant to apply independently of unknown entanglement with a reference.
Exercises
Section titled “Exercises”- Transpose is positive. Prove that if , then .
Solution
For any vector , let be the entrywise complex conjugate in the basis defining the transpose. Then
If , the right-hand side is nonnegative for every . Hence .
- A Kraus map is completely positive. Let . Show directly that is positive for every reference .
Solution
For any positive ,
If , then for every operator . Each summand is therefore positive, and the sum is positive. Since was arbitrary, is completely positive.
- Trace preservation in Kraus form. Show that is trace preserving for all if and only if .
Solution
Using cyclicity of the trace,
If , then .
Conversely, if this equality holds for all , then
for all density operators, and hence for all operators by linearity. Therefore .
References
Section titled “References”- M.-D. Choi, “Completely positive linear maps on complex matrices,” Linear Algebra and its Applications 10, 285–290 (1975). Article.
- W. F. Stinespring, “Positive functions on -algebras,” Proceedings of the American Mathematical Society 6, 211–216 (1955). Article.
- J. Watrous, The Theory of Quantum Information, Cambridge University Press (2018), chapter 2. Author’s text.