Skip to content

Trace Norm and Operator Norm

The operator norm controls the largest action on one unit vector, whereas the trace norm sums all singular-value weights. For quantum states, trace norm controls prediction errors uniformly over bounded observables. Infinite-dimensional operator-norm convergence alone can lose all normalization, even when every approximating operator is a valid state.

Helpful background. Trace-class operators introduces ∥⋅∥1\|\cdot\|_1 and the ideal bound; density operators supplies trace-one normalization.

For trace-class TT with singular values sns_n,

∥T∥=sup⁡nsn,∥T∥2=(∑nsn2)1/2,∥T∥1=∑nsn.\|T\|=\sup_ns_n,\qquad \|T\|_2=\left(\sum_ns_n^2\right)^{1/2},\qquad \|T\|_1=\sum_ns_n.

Consequently ∥T∥≤∥T∥2≤∥T∥1\|T\|\leq\|T\|_2\leq\|T\|_1. When rank⁡T≤r\operatorname{rank}T\leq r, Cauchy–Schwarz and the maximum bound give

∥T∥1≤r ∥T∥2≤r∥T∥.\|T\|_1\leq\sqrt r\,\|T\|_2\leq r\|T\|.

The constants depend on rank. There is no dimension-independent inequality bounding trace norm by a constant times operator norm on all trace-class operators. All norms are equivalent in a fixed finite-dimensional vector space, but the constants need not survive a growing cutoff.

The distinction matters when a numerical calculation reports a small matrix norm. A small largest matrix error can coexist with a large total error distributed over many levels. State errors should be interpreted using the norm tied to the desired observables.

The dual of the Banach space S1(H)\mathcal S_1(\mathcal H) is B(H)\mathcal B(\mathcal H) under the trace pairing. In particular,

∥T∥1=sup⁡∥A∥≤1∣Tr⁡(AT)∣.\|T\|_1 =\sup_{\|A\|\leq1}|\operatorname{Tr}(AT)|.

The ideal estimate proves the upper bound. For the lower bound, write T=V∣T∣T=V|T| by polar decomposition and choose A=V∗A=V^*. Since V∗VV^*V is the support projection of ∣T∣|T|, Tr⁡(V∗T)=Tr⁡∣T∣\operatorname{Tr}(V^*T)=\operatorname{Tr}|T|. The partial isometry V∗V^* is a contraction, so it is an admissible test operator.

It follows that

∣Tr⁡((ρ−σ)A)∣≤∥ρ−σ∥1∥A∥|\operatorname{Tr}((\rho-\sigma)A)| \leq\|\rho-\sigma\|_1\|A\|

for every bounded observable AA. For an effect, the sharper bound is 12∥ρ−σ∥1\tfrac12\|\rho-\sigma\|_1 because the difference is self-adjoint and has trace zero. The proof using its positive and negative parts appears in fidelity and trace distance.

This is uniform control over all bounded tests with the prescribed norm. Convergence of a few selected matrix elements gives less information. Even trace-norm convergence does not uniformly control unbounded energy, position, or particle number without an additional moment condition.

Probability mass escaping to higher dimensions

Section titled “Probability mass escaping to higher dimensions”

Let PNP_N project onto the first NN basis vectors in ℓ2(N)\ell^2(\mathbb N) and set ρN=PN/N\rho_N=P_N/N. Then

Tr⁡ρN=1,∥ρN∥=1N,∥ρN∥2=1N.\operatorname{Tr}\rho_N=1,\qquad \|\rho_N\|=\frac1N,\qquad \|\rho_N\|_2=\frac1{\sqrt N}.

Thus ρN→0\rho_N\to0 in both operator and Hilbert–Schmidt norms, while ∥ρN∥1=1\|\rho_N\|_1=1. The limiting operator has trace zero. This is not a contradiction: the trace is continuous in trace norm, not in operator norm on an unbounded-rank family.

For every fixed finite-rank projection PP, Tr⁡(ρNP)→0\operatorname{Tr}(\rho_NP)\to0, while the identity observable always has expectation one. Fixed finite-dimensional probes miss the probability spread across ever more states.

A related example is σn=(1−ϵn)P0+ϵnPn\sigma_n=(1-\epsilon_n)P_0+\epsilon_nP_n, with orthogonal rank-one projections and ϵn→0\epsilon_n\to0. Here ∥σn−P0∥1=2ϵn→0\|\sigma_n-P_0\|_1=2\epsilon_n\to0. If HPn=EnPnHP_n=E_nP_n, the energy excess is ϵn(En−E0)\epsilon_n(E_n-E_0) and can diverge when EnE_n grows sufficiently fast. Bounded-observable convergence and energy convergence are distinct promises.

A useful positive result restores many limit interchanges. If An→AA_n\to A strongly and sup⁡n∥An∥<∞\sup_n\|A_n\|<\infty, then

Tr⁡(TAn)⟶Tr⁡(TA)(T∈S1).\operatorname{Tr}(TA_n)\longrightarrow\operatorname{Tr}(TA) \qquad(T\in\mathcal S_1).

Approximate TT by a finite-rank FF in trace norm. The finite-rank pairing converges by strong convergence on finitely many vectors. The remaining error is bounded uniformly by ∥T−F∥1(sup⁡n∥An∥+∥A∥)\|T-F\|_1(\sup_n\|A_n\|+\|A\|). First choose FF, then take nn large. This order of limits is the rigorous reason a fixed normal state can evaluate strongly convergent bounded cutoff observables.

Simon develops the ideal duality behind these arguments; Holevo uses the resulting trace topology for state approximation.

  1. Take ρN=PN/N\rho_N=P_N/N and ρ2N=P2N/(2N)\rho_{2N}=P_{2N}/(2N). Compute their trace distance.
Solution

The difference has NN eigenvalues 1/(2N)1/(2N) and NN eigenvalues −1/(2N)-1/(2N). Its trace norm is one, so its trace distance is 1/21/2. These states are not trace-norm Cauchy, despite their common operator-norm limit.

  1. For a finite-dimensional density-matrix calculation with a rank-rr error Δ\Delta, the operator-norm error is at most δ\delta. What trace-distance guarantee follows?
Solution

One obtains 12∥Δ∥1≤rδ/2\tfrac12\|\Delta\|_1\leq r\delta/2. The bound can be poor when rr grows. Reporting δ\delta without the rank or another summability estimate does not provide a uniform probability-error guarantee.

  • Holevo, Alexander S., Quantum Systems, Channels, Information: A Mathematical Introduction, 2nd revised and expanded ed., De Gruyter, 2019 — trace topology and infinite-dimensional state approximation. Publisher.
  • Simon, Barry, Trace Ideals and Their Applications, 2nd ed., Mathematical Surveys and Monographs 120, American Mathematical Society, 2005 — duality, norm inequalities, and finite-rank approximation. Publisher.