Trace-Preserving and Trace-Nonincreasing Maps
Trace preservation is the probability-conservation condition for deterministic quantum operations. Trace nonincrease is the corresponding condition for selected outcomes, filters, loss branches, and postselected operations.
For a normalized state ,
If a map is deterministic, the output should also have trace . If a map describes only one possible branch, the trace of the unnormalized output is the probability of that branch.
The guiding distinction is:
while
Trace Preservation
Section titled “Trace Preservation”Let
be a linear map on operators. The map is trace preserving if
for all operators in its domain.
For normalized input states, this gives
A completely positive trace-preserving map is a quantum channel. It may represent unitary evolution, noise, state preparation, discard-and-reprepare dynamics, or reduced dynamics after tracing out an environment.
Trace Nonincrease
Section titled “Trace Nonincrease”A map is trace nonincreasing on positive inputs if
For an input state , the branch probability is
The conditional output state, when the branch occurs, is
This normalization is nonlinear in because it conditions on a selected event. The underlying operation is the linear trace-nonincreasing map.
Kraus Trace Conditions
Section titled “Kraus Trace Conditions”For a completely positive map with Kraus representation
the trace is
Therefore is trace preserving exactly when
It is trace nonincreasing exactly when
The positive operator
is the effect associated with the selected operation:
The details of Kraus representations are developed in Kraus Representation.
Adjoint-Map Condition
Section titled “Adjoint-Map Condition”The adjoint map is defined by the trace pairing:
With this convention, is trace preserving exactly when
It is trace nonincreasing exactly when
This form is often the cleanest way to remember the relation between Schrödinger-picture states and Heisenberg-picture observables:
Choi Trace Condition
Section titled “Choi Trace Condition”With the Choi convention used in Choi Matrix, a map
is trace preserving exactly when
It is trace nonincreasing exactly when
Together with , these are semidefinite constraints. They are useful in channel tomography, optimization over operations, and physicality checks for fitted models.
Instruments and Missing Branches
Section titled “Instruments and Missing Branches”A quantum instrument is a family of operations whose sum is trace preserving:
Each individual operation is trace nonincreasing:
The total map is trace preserving because the probabilities of all outcomes sum to one:
If an analysis keeps only one outcome and renormalizes, it is doing postselection. The missing trace is not a mathematical defect; it is the probability assigned to the outcomes not retained.
Trace Preserving Is Not Unital
Section titled “Trace Preserving Is Not Unital”A map is unital if
Trace preserving and unital are different conditions. Trace preservation says normalized states keep total probability. Unitality says the identity operator is fixed by the Schrödinger-picture map.
For a channel , trace preservation is equivalent to unitality of the adjoint map:
But need not hold. Amplitude damping is trace preserving but not unital: it preserves total probability while relaxing excited-state population toward the ground state.
Loss: Two Equivalent Descriptions
Section titled “Loss: Two Equivalent Descriptions”Loss can be represented in two common ways.
First, if one keeps only the surviving subspace, the survival operation may be trace decreasing:
The trace is
Second, if one includes an explicit erasure flag , the full map can be trace preserving:
The two descriptions answer different modeling questions. The trace-decreasing map describes the selected survival branch. The flagged channel includes both survival and loss as outcomes. See Erasure and Loss Channels for the canonical channel-level treatment.
Common Mistakes
Section titled “Common Mistakes”Normalizing selected branches too early
Section titled “Normalizing selected branches too early”The map is conditional and nonlinear. The physical operation before conditioning is the trace-nonincreasing linear map .
Calling a selected outcome a channel
Section titled “Calling a selected outcome a channel”An individual measurement outcome is generally not trace preserving. The sum over all outcomes is the channel.
Confusing trace preserving with unital
Section titled “Confusing trace preserving with unital”Trace preserving keeps fixed. Unital keeps fixed. The two coincide only in special cases.
Forgetting hidden loss outcomes
Section titled “Forgetting hidden loss outcomes”A detector model that only describes successful clicks may be trace decreasing. To make a channel, include no-click, loss, or erasure outcomes.
Checking only normalized inputs
Section titled “Checking only normalized inputs”Trace conditions are linear statements. They should hold on the operator space or, at minimum, on all positive inputs, not just on one favorite normalized state.
Exercises
Section titled “Exercises”Kraus proof
Section titled “Kraus proof”Prove that a Kraus map
is trace preserving if and only if .
Solution
Using cyclicity of trace,
This equals for every exactly when
Projective measurement branches
Section titled “Projective measurement branches”Let be a projective measurement. Show that each branch is trace nonincreasing, while is trace preserving.
Solution
For one branch,
because .
For the sum,
Amplitude damping is not unital
Section titled “Amplitude damping is not unital”For the qubit amplitude-damping Kraus operators
with , show that the channel is trace preserving but not unital when .
Solution
First,
and
Therefore
so the channel is trace preserving.
For unitality, compute
This equals only when .
Cross-Links
Section titled “Cross-Links”- Quantum Operations
- Completely Positive Maps
- Kraus Representation
- Choi Matrix
- Quantum Instruments
- Selective and Nonselective Measurements
- Amplitude-Damping Channel
- Common Noise Channels
- Formula Sheet
- Glossary
References
Section titled “References”- 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, 10th anniversary edition (2010).
- J. Watrous, The Theory of Quantum Information, Cambridge University Press (2018).
- A. S. Holevo, Quantum Systems, Channels, Information: A Mathematical Introduction, De Gruyter (2012).
- M. M. Wolf, Quantum Channels and Operations: Guided Tour, lecture notes (2012).
- H.-P. Breuer and F. Petruccione, The Theory of Open Quantum Systems, Oxford University Press (2002).