Trace distance is a concept from quantum information theory that quantifies the distinguishability between two quantum states, represented by density matrices. It is a useful measure for analyzing how different two quantum states are and has applications in quantum computing, quantum cryptography, and quantum mechanics in general.
Articles by others on the same topic
How different can two preparations look to someone who can perform any measurement in quantum mechanics? The trace distance answers this question for density operators on the same finite-dimensional vector space:Here is the absolute value of an operator, and is its trace norm. Because is Hermitian, its trace norm is the sum of the absolute values of its eigenvalues; it is not the sum of the absolute values of its matrix entries. The factor givesThe trace distance is a metric: it is symmetric, vanishes exactly when , and obeys the triangle inequality. Identical preparations have trace distance zero; preparations with orthogonal occupied eigenspaces have trace distance one and can be identified perfectly in a single measurement in quantum mechanics.
Operationally, the trace distance is the largest total variation distance between the outcome probability distributions obtainable by a POVM. Equivalently, the variational characterization of trace distance says it is the largest possible probability gap for one event in a binary measurement in quantum mechanics. For one copy of either known preparation, each chosen with prior probability , the Holevo–Helstrom theorem givesThus trace distance zero leaves only guessing, while trace distance one permits perfect quantum state discrimination. The optimum ranges over measurements; different measurement bases can expose different amounts of distinguishability. [ref]
https://cs.uwaterloo.ca/~watrous/TQI/TQI.3.pdf. Watrous, The Theory of Quantum Information, §3.1, Theorem 3.4 and Proposition 3.5
For a worked example with commuting density operators, take a qubit withTheir difference has eigenvalues , so . Measuring in the computational basis produces outcome probability distributions and , whose total variation distance is also . Guessing on outcome zero and on outcome one succeeds with probability . A projective measurement in the Hadamard basis instead produces for both preparations and gives no discrimination advantage.
The trace-distance contraction under quantum channels ensures that a common quantum channel, including the partial trace, cannot increase the trace distance. This makes trace distance a useful error measure: if , every event in every measurement in quantum mechanics has a probability gap at most . Losing access to a subsystem can hide distinguishability, but cannot create more of it.