Trace, Norms & Operator Distances
Hilbert–Schmidt, trace norm and operator norm: how we measure errors.
Your gate is "almost" a gate. How almost? Error budgets, thresholds and approximation theorems all need distances, and in quantum information three matrix norms do nearly all of the work.
What you’ll learn
- Use the trace, its cyclicity and the Hilbert–Schmidt inner product, including Pauli expansions.
- Define Schatten -norms via singular values and relate the trace, Frobenius and operator norms.
- Derive the pure-state trace distance and state its operational meaning (Helstrom).
- Bound accumulated gate error by telescoping, accounting for global phase.
- Explain what the diamond norm adds, and why average fidelity can understate worst-case error.
Trace and the Hilbert–Schmidt inner product
The trace is basis-independent and cyclic: , hence . Cyclic is not the same as symmetric: in general .
The matrices form a -dimensional Hilbert space under the Hilbert–Schmidt inner product . The Pauli strings are orthogonal, , so they form a basis:
Think first Is ? Try , , .
, so . But , so . Only cyclic permutations preserve the trace.
Schatten norms: one family, three workhorses
Every has a singular value decomposition ; the singular values are the eigenvalues of . The Schatten -norm is the norm of the singular values:
| Norm | Also called | Natural use |
|---|---|---|
| trace norm, nuclear norm | distances between states: | |
| Hilbert–Schmidt, Frobenius | easy algebra, least-squares tomography, average-case errors | |
| operator, spectral norm | worst-case error of an operation on any input; Hamiltonian bounds |
is an orthogonal projector of rank on . What is ?
Show the answer
B.
The singular values of are ones and zeros, so , and . The chain shows the ordering inequalities are tight.
Distances between states
The trace distance is the operationally right distance between states. By duality, : the largest possible difference in the probability of any measurement outcome.
Let . It has rank at most and trace , so its non-zero eigenvalues are .
Compute two ways:
So and
For qubits, has eigenvalues , so the trace distance is half the Euclidean distance between Bloch vectors, pure or mixed.
The Fuchs–van de Graaf inequalities tie to the fidelity , with equality on the right for pure states. And is contractive: for every channel . Processing never makes states more distinguishable.
You receive or with equal probability. What is the best possible probability, in percent, of identifying which one you got?
Show the answer
85 %
, so and . The optimal measurement is along the Bloch axis , at from each state.
Distances between operations
For unitaries the operator norm gives the worst case over inputs, , and it is unchanged by tensoring with an identity on an ancilla. Errors then accumulate at most additively:
Compare ideal gates with implementations (all unitary). Insert and subtract hybrid products:
Each term has the error in one slot and unitaries (norm ) elsewhere. Use the triangle inequality and submultiplicativity:
So gates, each -accurate, give a -accurate circuit, and every outcome probability moves by at most . This is why bits of precision per gate suffice (Bernstein–Vazirani).
Global phase. and are the same gate, so compare . For versus : , but with the optimal phase the distance drops to .
Channels. Noisy operations are channels, not unitaries. The right worst-case distance is the diamond norm, which lets the input be entangled with an ancilla:
An ancilla of the same dimension always suffices, and for general channels it can be strictly necessary. The optimal probability of telling from in one use is , and rigorous fault-tolerance thresholds are typically stated in this norm.
Key takeaways
- The trace is cyclic, not symmetric; makes matrices a Hilbert space with the Pauli strings as an orthogonal basis.
- Schatten norms: for states, for algebra and averages, for worst-case operations, with .
- sets the optimal guessing probability (Helstrom); for pure states , for qubits half the Bloch distance.
- Gate errors add at most linearly (telescoping); compare unitaries up to global phase, and channels in the diamond norm.
- For coherent errors the diamond distance scales like the square root of the average infidelity.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
Which quantity bounds the error of an implemented unitary (intended ) on every input, including when it acts on part of an entangled state?
Show the answer
B.
and for every unit vector, so it is a worst-case bound that survives adding ancillas. The trace-based quantities measure average behavior.
A circuit has gates, each within operator-norm distance of ideal. What is the best general upper bound on the whole circuit's operator-norm error?
- ; no better general bound exists
Show the answer
C.
Telescoping gives , and coherent errors that all push the same way essentially reach it. growth is typical for random, incoherent errors but is not a worst-case guarantee.
What is the trace distance between and the maximally mixed state ?
Show the answer
D.
, so . Equivalently, half the Bloch distance from the north pole to the center: .
Which expression equals for all matrices ?
Show the answer
A.
Cyclicity: with , . Non-cyclic reorderings fail: but .
Further reading
- J. Watrous, The Theory of Quantum Information, chs. 1 and 3 (Cambridge, 2018).
- C. W. Helstrom, Quantum Detection and Estimation Theory (Academic Press, 1976).
- C. A. Fuchs & J. van de Graaf, "Cryptographic distinguishability measures for quantum-mechanical states," IEEE Trans. Inf. Theory (1999).
- A. Yu. Kitaev, "Quantum computations: algorithms and error correction," Russian Math. Surveys (1997).
- R. Kueng, D. M. Long, A. C. Doherty & S. T. Flammia, "Comparing experiments to the fault-tolerance threshold," Phys. Rev. Lett. (2016).