Skip to content

Fidelity and Trace Distance

Trace distance measures the largest probability difference achievable by a bounded measurement effect. Fidelity compares the overlap of purifications. Both remain well-defined for infinite-dimensional density operators, and dimension-independent inequalities relate them. The definitions require care because “fidelity” is used for both a quantity and its square.

Helpful background. Trace-norm duality supplies norm estimates; purification in infinite dimensions supplies the ancillary construction.

For density operators ρ,σ\rho,\sigma on a separable Hilbert space, define

D(ρ,σ)=12∥ρ−σ∥1,f(ρ,σ)=∥ρσ∥1,F(ρ,σ)=f(ρ,σ)2.D(\rho,\sigma)=\tfrac12\|\rho-\sigma\|_1, \qquad f(\rho,\sigma)=\|\sqrt\rho\sqrt\sigma\|_1, \qquad F(\rho,\sigma)=f(\rho,\sigma)^2.

Here ff is root fidelity and FF is squared fidelity. Both conventions occur in the literature; every quoted bound must be translated accordingly.

The product ρσ\sqrt\rho\sqrt\sigma is trace class because both square roots are Hilbert–Schmidt. The product bound gives f≤∥ρ∥2∥σ∥2=1f\leq\|\sqrt\rho\|_2\|\sqrt\sigma\|_2=1. Both DD and ff lie in [0,1][0,1]. Equality D=0D=0 or f=1f=1 means ρ=σ\rho=\sigma; f=0f=0 means their supports are orthogonal. Trace distance is a metric, whereas fidelity itself is a similarity measure.

Set Δ=ρ−σ\Delta=\rho-\sigma. It is self-adjoint, trace class, and traceless. Its Jordan decomposition is Δ=Δ+−Δ−\Delta=\Delta_+-\Delta_- with orthogonal positive supports. Trace zero implies

Tr⁡Δ+=Tr⁡Δ−=12∥Δ∥1.\operatorname{Tr}\Delta_+ =\operatorname{Tr}\Delta_- =\tfrac12\|\Delta\|_1.

For an effect 0≤E≤I0\leq E\leq I,

−Tr⁡Δ−≤Tr⁡(EΔ)≤Tr⁡Δ+.-\operatorname{Tr}\Delta_- \leq\operatorname{Tr}(E\Delta) \leq\operatorname{Tr}\Delta_+.

The positive spectral projection of Δ\Delta attains the upper bound. Therefore

D(ρ,σ)=sup⁡0≤E≤I∣Tr⁡(E(ρ−σ))∣.D(\rho,\sigma) =\sup_{0\leq E\leq I} |\operatorname{Tr}(E(\rho-\sigma))|.

This proof applies in infinite dimension because the positive and negative parts are trace class and the optimizing projection is bounded. For equal prior probabilities, the optimal binary discrimination success probability is (1+D)/2(1+D)/2. No finite-dimensional matrix diagonalization is assumed by the theorem, although finite approximations may be needed to construct a measurement computationally.

Uhlmann’s characterization identifies f(ρ,σ)f(\rho,\sigma) with the supremum of absolute overlaps between purifications in a sufficiently large common ancillary space. The freedom is an ancillary isometry or partial isometry on occupied supports; it should not be replaced indiscriminately by a unitary on an arbitrarily fixed infinite-dimensional ancilla.

The Fuchs–van de Graaf bounds, written in the conventions above, are

1−f(ρ,σ)≤D(ρ,σ)≤1−f(ρ,σ)2.1-f(\rho,\sigma) \leq D(\rho,\sigma) \leq\sqrt{1-f(\rho,\sigma)^2}.

The upper bound follows by choosing purifications with overlap approaching ff, using the pure-state distance formula below, and applying partial-trace contractivity. The lower bound can be obtained from the positive-operator square-root inequality

∥ρ−σ∥22≤∥ρ−σ∥1.\|\sqrt\rho-\sqrt\sigma\|_2^2 \leq\|\rho-\sigma\|_1.

Indeed, its left side is 2−2Tr⁡(ρσ)2-2\operatorname{Tr}(\sqrt\rho\sqrt\sigma), and f≥Tr⁡(ρσ)f\geq\operatorname{Tr}(\sqrt\rho\sqrt\sigma). This gives 2(1−f)≤2D2(1-f)\leq2D. The cited fidelity treatments provide the square-root inequality and the infinite-dimensional extension.

Consequently D(ρn,ρ)→0D(\rho_n,\rho)\to0 exactly when f(ρn,ρ)→1f(\rho_n,\rho)\to1. This equivalence controls bounded-observable statistics. It does not imply entropy or energy convergence without further assumptions.

For ρ=Pψ\rho=P_\psi and σ=Pϕ\sigma=P_\phi, let c=∣⟨ψ,ϕ⟩∣c=|\langle\psi,\phi\rangle|. If c<1c<1, the difference Pψ−PϕP_\psi-P_\phi has eigenvalues ±1−c2\pm\sqrt{1-c^2} on their two-dimensional span; if c=1c=1, the projectors coincide and their difference is zero. Thus

f(Pψ,Pϕ)=c,D(Pψ,Pϕ)=1−c2.f(P_\psi,P_\phi)=c,\qquad D(P_\psi,P_\phi)=\sqrt{1-c^2}.

The upper bound is saturated. A pure state compared with a mixed state instead has F(Pψ,σ)=⟨ψ,σψ⟩F(P_\psi,\sigma)=\langle\psi,\sigma\psi\rangle, but generally does not saturate that bound.

For commuting diagonal states with probabilities (pn)(p_n) and (qn)(q_n),

D=12∑n∣pn−qn∣,f=∑npnqn.D=\tfrac12\sum_n|p_n-q_n|, \qquad f=\sum_n\sqrt{p_nq_n}.

The quantum quantities reduce to total variation distance and the classical overlap coefficient. Countably infinite sums are justified by absolute summability and Cauchy–Schwarz.

Processing cannot improve distinguishability

Section titled “Processing cannot improve distinguishability”

For a completely positive trace-preserving map on trace-class operators, the adjoint sends effects to effects. Applying the variational formula shows D(Φ(ρ),Φ(σ))≤D(ρ,σ)D(\Phi(\rho),\Phi(\sigma))\leq D(\rho,\sigma). The corresponding dilation and purification argument gives f(Φ(ρ),Φ(σ))≥f(ρ,σ)f(\Phi(\rho),\Phi(\sigma))\geq f(\rho,\sigma). Discarding information makes states harder to distinguish and can increase their overlap.

Watrous gives detailed finite-dimensional proofs and operational applications. Hou and Qi establish infinite-dimensional fidelity statements; the trace-class hypotheses here identify the setting in which those extensions apply.

  1. Compare ρ=P0\rho=P_0 with σ=(1−ϵ)P0+ϵP1\sigma=(1-\epsilon)P_0+\epsilon P_1 for orthogonal pure states. Which fidelity bound is saturated?
Solution

Here D=ϵD=\epsilon and f=1−ϵf=\sqrt{1-\epsilon}. For 0<ϵ<10<\epsilon<1, neither bound is generally saturated: 1−1−ϵ<ϵ<ϵ1-\sqrt{1-\epsilon}<\epsilon<\sqrt\epsilon. This distinguishes a classical mixture from the pure-state overlap calculation.

  1. If a normalized spectral truncation discards weight tt, compute its root fidelity with the original state.
Solution

The states commute. Summing the retained contributions gives f=∑n≤Npn/1−t=1−tf=\sum_{n\leq N}p_n/\sqrt{1-t}=\sqrt{1-t}. Their trace distance is tt. This supplies complementary error measures for density-matrix approximations.

  • Fuchs, Christopher A., and Jeroen van de Graaf, “Cryptographic distinguishability measures for quantum-mechanical states,” IEEE Transactions on Information Theory 45, 1216–1227, 1999 — comparison inequalities for distinguishability measures. Preprint.
  • Hou, Jinchuan, and Xiaofei Qi, “Fidelity of states in infinite-dimensional quantum systems,” Science China Physics, Mechanics & Astronomy 55, 1820–1827, 2012 — infinite-dimensional Uhlmann theorem and fidelity properties. Preprint; DOI.
  • Watrous, John, The Theory of Quantum Information, Cambridge University Press, 2018, Chapter 3 — discrimination, fidelity, and norm inequalities in finite dimension. Author manuscript.