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.
Trace-preserving maps are included among trace-nonincreasing maps. A selected operation may happen with certainty on some inputs but with smaller probability on others. Both trace conditions must be combined with complete positivity to describe a physical operation.
Helpful background. Quantum operations explains why an unnormalized output retains a branch probability; Kraus operators provide concrete representations.
Trace Preservation
Section titled “Trace Preservation”Let
be a linear map between finite-dimensional operator spaces. 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
For a completely positive trace-nonincreasing operation and , the conditional output state is
This normalization is generally nonlinear because it conditions on an event with input-dependent probability. If the success probability is the same nonzero constant for every input, the normalized transformation can instead be a linear channel. 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”Using the unnormalized output-input Choi matrix, a map
is trace preserving exactly when
It is trace nonincreasing exactly when
More precisely, in the defining input basis. The transpose does not alter positivity or the identity, so the trace inequalities have the form above. A normalized Choi state instead has marginal . 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. If the input and output dimensions differ, a map cannot satisfy both conditions: taking the trace of would require .
Loss: Two Equivalent Descriptions
Section titled “Loss: Two Equivalent Descriptions”For state-independent loss that leaves a surviving encoded state unchanged, there are two useful descriptions. General loss need not have this form; unequal survival probabilities can filter the surviving state.
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 physical examples.
Checking every input without testing every state
Section titled “Checking every input without testing every state”A trace condition is an operator identity or inequality. For , the input survives with probability one, but survives with probability . Testing only would incorrectly suggest trace preservation.
Diagonalizing immediately shows that the map is trace nonincreasing but not trace preserving. The extremal eigenvalues of are the smallest and largest success probabilities over all normalized inputs. Checking all normalized states would be sufficient; checking one favored state is not.
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 .
References
Section titled “References”- K. Kraus, States, Effects, and Operations: Fundamental Notions of Quantum Theory, Lecture Notes in Physics 190, Springer (1983). Publisher.
- J. Watrous, The Theory of Quantum Information, Cambridge University Press (2018), chapter 2. Author’s text.