Fidelity & Trace Distance
How close are two quantum states, operationally?
"99% fidelity" sounds nearly perfect, yet on its own it only guarantees that no measurement can shift any outcome probability by more than 10%. Trace distance and fidelity are the two standard yardsticks for quantum states. This lesson gives each an operational meaning and proves the inequalities that convert one into the other.
What you’ll learn
- Prove that trace distance equals the largest difference in outcome probabilities, and that it contracts under every channel.
- Define fidelity, compute it for qubits, and prove Uhlmann's theorem.
- Prove the Fuchs–van de Graaf inequalities and use them to convert between the two measures.
- Apply the bounds to many copies, to the gentle measurement lemma, and to reported gate fidelities.
Trace distance: the best possible bias
Split into its positive and negative parts ( with orthogonal supports). Since :
For any effect :
Equality holds for , the projector onto the support of , for which . For a POVM, group the outcomes with into a single effect ; then .
For qubits, has eigenvalues , so : half the Euclidean distance in the Bloch ball, with the optimal measurement along . With equal priors, the best single-shot guess between and succeeds with probability , the Helstrom bound.
Let and . What is ?
Show the answer
C.
The Bloch vectors are and , so . Directly: and .
Fidelity and Uhlmann's theorem
With , every purification on is the canonical one up to a unitary on (uniqueness of purifications):
Use the transpose trick :
As and range over unitaries, so does . For with polar decomposition , Hölder's inequality gives , with equality at . Hence
Think first The operator is not symmetric in and . Why is anyway?
Because and . Uhlmann's theorem makes it obvious as well: the overlap is symmetric.
Other properties follow just as quickly: iff ; is multiplicative, ; and can only increase under a channel . For the last, push optimal purifications through a Stinespring isometry of : they become purifications of and with the same overlap, so Uhlmann gives .
Fuchs–van de Graaf: converting between the two
Pure states. In the plane spanned by and , the traceless operator has determinant , hence eigenvalues :
Upper bound. By Uhlmann, pick purifications with . The partial trace is a channel, so contractivity gives
Lower bound. Fuchs and Caves showed that over all POVMs, with and . For a minimizing POVM, using :
A lab reports fidelity (squared convention) between its state and a pure target. What is the largest trace distance consistent with this?
Show the answer
0.1
, attained when the lab's state is also pure. The lower bound is twenty times smaller: fidelity and trace distance can differ by a square root.
| Property | Trace distance | Fidelity |
|---|---|---|
| Operational meaning | Best single-shot bias: for equal priors | Best overlap of purifications; is the smallest classical (Bhattacharyya) overlap over measurements |
| Under channels | Contracts: | Grows: |
| Tensor powers | Only bounds, e.g. | Multiplicative: |
| Qubits |
Multiplicativity makes fidelity the tool of choice for many copies. Combined with Fuchs–van de Graaf, it brackets the -copy trace distance:
Using the bounds
An outcome that is almost certain barely disturbs the state, and is the right scaling. This lemma powers sequential decoding in quantum Shannon theory and Aaronson's shadow tomography; Weak Measurement & the Zeno Effect develops it further.
Key takeaways
- is the largest difference in any outcome probability; it contracts under channels, and for qubits it is half the Bloch-ball distance.
- is the maximal overlap of purifications (Uhlmann); it is multiplicative and grows under channels. Check which convention, or , a paper uses.
- Fuchs–van de Graaf: , with equality on the right for pure states. A fidelity of 99% can still mean a trace distance of 10%.
- Gentle measurement: an outcome of probability at least disturbs the state by at most in trace distance.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
Two pure states have . What is their trace distance?
Show the answer
B.
For pure states exactly.
The same channel is applied to two states and . What is guaranteed?
- can only decrease and can only increase
- and are both unchanged
- can increase if is entanglement-breaking
- can decrease if is not unital
Show the answer
A. can only decrease and can only increase
Data processing: and for every CPTP map. Unitaries keep both unchanged; general channels can only make states harder to tell apart.
An outcome has . What upper bound does the gentle measurement lemma give for the trace distance between and the normalized post-measurement state ?
Show the answer
D.
Here , so and . The disturbance scales like the square root of the failure probability.
Which property makes fidelity especially convenient for -copy problems?
- It is a metric on states
- It is linear in
- It is multiplicative:
- It equals one minus the trace distance
Show the answer
C. It is multiplicative:
Multiplicativity follows from and . Trace distance has no such rule, so one bounds it through using Fuchs–van de Graaf.
Further reading
- C. A. Fuchs & J. van de Graaf, "Cryptographic distinguishability measures for quantum-mechanical states", IEEE Transactions on Information Theory 45, 1216 (1999).
- A. Uhlmann, "The 'transition probability' in the state space of a -algebra", Reports on Mathematical Physics 9, 273 (1976).
- R. Jozsa, "Fidelity for mixed quantum states", Journal of Modern Optics 41, 2315 (1994).
- J. Watrous, The Theory of Quantum Information, Ch. 3 (Cambridge, 2018).
- M. A. Nielsen & I. L. Chuang, Quantum Computation and Quantum Information, Ch. 9 (Cambridge, 2010).