105
Part Three · A · Foundations of quantum information

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 S(ρ)=−Tr ρlog⁡2ρ=−∑λilog⁡2λiS(\rho) = -\mathrm{Tr}\,\rho\log_2\rho = -\sum\lambda_i\log_2\lambda_i, over the eigenvalues of ρ\rho. Pure states have S=0S = 0; the maximally mixed qubit has 1 bit. Benjamin Schumacher showed in 1995 that SS is the number of qubits per copy needed to compress a quantum source, as HH counts bits for a classical one. The relative entropy S(ρ∥σ)=Tr ρ(log⁡ρ−log⁡σ)S(\rho\|\sigma) = \mathrm{Tr}\,\rho(\log\rho - \log\sigma) measures how distinguishable ρ\rho is from σ\sigma over many copies, and never increases under any channel. Established

DeeperStrong subadditivity, S(ρABC)+S(ρB)≤S(ρAB)+S(ρBC)S(\rho_{ABC}) + S(\rho_B) \le S(\rho_{AB}) + S(\rho_{BC}), proved by Elliott Lieb and Mary Beth Ruskai in 1973, is the deepest inequality in quantum information. It follows from the monotonicity of relative entropy under partial trace, applied to ρABC\rho_{ABC} against ρA⊗ρBC\rho_A\otimes\rho_{BC}.

Trace distance

Define D(ρ,σ)=12∥ρ−σ∥1D(\rho, \sigma) = \tfrac12\|\rho - \sigma\|_1, 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 12(1+D)\tfrac12(1 + D), 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, F(ρ,σ)=(Trρ σρ)2F(\rho, \sigma) = \left(\mathrm{Tr}\sqrt{\sqrt\rho\,\sigma\sqrt\rho}\right)^2, reduces to ∣⟨ψ∣ϕ⟩∣2|\langle\psi|\phi\rangle|^2 for pure states. For qubits it has the closed form Tr(ρσ)+2det⁡ρdet⁡σ\mathrm{Tr}(\rho\sigma) + 2\sqrt{\det\rho\det\sigma}. Distance and fidelity bound each other, by the Fuchs–van de Graaf inequalities:

1−F  ≤  D  ≤  1−F1 - \sqrt F \;\le\; D \;\le\; \sqrt{1 - F}

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.

What does trace distance mean operationally?tap
The best single-shot discrimination probability is ½(1 + D).
Can a channel increase trace distance?tap
No; it is contractive under every CPTP map.
What does von Neumann entropy count?tap
Qubits per copy needed to compress a quantum source (Schumacher).

And one to work out. What is the trace distance between ∣0⟩|0\rangle (Bloch vector up) and ∣+⟩|+\rangle (along x)?

D =

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.

Next · Chapter 106
Entanglement theory: measures, distillation, monotones

Entanglement is a currency. Local operations can spend it or concentrate it, but never create it.

Turn the page