Skip to content

Fidelity

This card uses squared Uhlmann fidelity:

F(ρ,σ)=[Tr⁡ρ σρ]2.F(\rho,\sigma) =\left[ \operatorname{Tr}\sqrt{\sqrt\rho\,\sigma\sqrt\rho} \right]^2.

Useful special cases are

F(∣ψ⟩⟨ψ∣,σ)=⟨ψ∣σ∣ψ⟩,F(|\psi\rangle\langle\psi|,\sigma) =\langle\psi|\sigma|\psi\rangle, F(∣ψ⟩,∣ϕ⟩)=∣⟨ψ∣ϕ⟩∣2,F(|\psi\rangle,|\phi\rangle)=|\langle\psi|\phi\rangle|^2,

and, for commuting eigenvalue distributions pi,qip_i,q_i,

F(ρ,σ)=(∑ipiqi)2.F(\rho,\sigma)=\left(\sum_i\sqrt{p_iq_i}\right)^2.

For qubit Bloch vectors r,s\mathbf r,\mathbf s,

F(ρ,σ)=12[1+r⋅s+(1−∥r∥2)(1−∥s∥2)].F(\rho,\sigma) =\frac12\left[ 1+\mathbf r\cdot\mathbf s +\sqrt{(1-\lVert\mathbf r\rVert^2) (1-\lVert\mathbf s\rVert^2)} \right].
  • ρ\rho and σ\sigma are normalized density operators on the same space.
  • Many sources call the square root F\sqrt F “fidelity.” Always state which convention is used.
  • Matrix square roots are the positive square roots from spectral calculus.
SymbolMeaning
F(ρ,σ)F(\rho,\sigma)squared fidelity, between 00 and 11
ρ\sqrt\rhopositive square root of ρ\rho
r,s\mathbf r,\mathbf squbit Bloch vectors
D(ρ,σ)D(\rho,\sigma)trace distance
  • F=1F=1 exactly when ρ=σ\rho=\sigma; orthogonal supports give F=0F=0.
  • Fidelity is not itself a metric.
  • It is multiplicative on tensor products and monotone upward under a common channel: processing makes states no less similar.
  • In this convention the Fuchs–van de Graaf inequalities are
1−F≤D≤1−F.1-\sqrt F\le D\le\sqrt{1-F}.
  • Do not silently clip substantial negative eigenvalues of an estimated state before reporting fidelity.

Purification meaning, operational comparison, commuting and qubit examples, channel behavior, numerical checks, exercises, and references are at Density Operators for Quantum Information.