Quantum entropy, trace distance, fidelity
How different are two quantum states? There is a precise answer, and it is operational: exactly as different as your best chance of telling them apart in a single shot. The trace distance captures it. A second measure, fidelity, captures how close they are, and an entropy captures how mixed each one is. These three quantities run through every later chapter on error correction, benchmarking and cryptography.
On the plate: two states in the Bloch ball, with their distance, fidelity and the best odds of distinguishing them.
Von Neumann entropy
The quantum analogue of Shannon’s entropy (Chapter 95) is , over the eigenvalues of . Pure states have ; the maximally mixed qubit has 1 bit. Benjamin Schumacher showed in 1995 that is the number of qubits per copy needed to compress a quantum source, as counts bits for a classical one. The relative entropy measures how distinguishable is from over many copies, and never increases under any channel. Established
Trace distance
Define , half the sum of the absolute eigenvalues of the difference. For qubits it is half the Euclidean distance between Bloch vectors. Its meaning: the best single-shot probability of telling them apart, given each with probability one half, is , the Helstrom bound of Chapter 101 in general form. Move the states: lengths 1.00 and 0.80, angle between them 60°. Trace distance can only shrink under a channel: noise makes states harder to tell apart, never easier.
Fidelity
Uhlmann’s fidelity, , reduces to for pure states. For qubits it has the closed form . Distance and fidelity bound each other, by the Fuchs–van de Graaf inequalities:
with the upper bound an equality for pure states. Gate and state fidelities quoted for hardware, 99.9% and so on, are these numbers (Chapter 150). Established
What you now have
Von Neumann and relative entropy, Schumacher compression, strong subadditivity, trace distance and its operational meaning, Uhlmann fidelity and the qubit formula, and the Fuchs–van de Graaf inequalities.
· · ·
Three questions to carry with you.
And one to work out. What is the trace distance between (Bloch vector up) and (along x)?
Sources: B. Schumacher, Phys. Rev. A 51, 2738 (1995). E. H. Lieb and M. B. Ruskai, J. Math. Phys. 14, 1938 (1973). A. Uhlmann, Rep. Math. Phys. 9, 273 (1976). C. A. Fuchs and J. van de Graaf, IEEE Trans. Inf. Theory 45, 1216 (1999). M. M. Wilde, Quantum Information Theory. J. Watrous, ch. 5. Checked by code: D = ½|r − s|; Uhlmann fidelity equals Tr(ρσ) + 2√(det ρ det σ) (e.g. 0.897 for r = (0,0,0.6), s = (0.5,0,0.2)); Fuchs–van de Graaf holds.