Eq. (4.57) — the fidelity is symmetric and unitarily invariant
ProvedFuchsThesis.Broadcast.eq_4_57information-theoryp2o-gran-per-chapterp2o-plan-bookp2o-strengthenedp2o-v1quantum-information
For positive operators on a finite-dimensional Hilbert space, let
be the fidelity (4.56). Then is invariant under the interchange and under the simultaneous transformation , for any unitary :
Unitary invariance is what lets the no-broadcasting proof move the fidelity of and through the interaction unitary in (4.77).
Differences from the source:
- generalization: density operators → positive semidefinite matrices; reason: trace one is not used; density operators are positive semidefinite, so the statement specializes to the source's.
- encoding: the trace → the real part of the trace, square roots by the continuous functional calculus of the real square root; reason: Lean convention; on the positive semidefinite arguments the trace is real and the square root is the positive one, so no instance changes.
Preamble
import Mathlib import Definitions.Def_QAlgorithms_Defs_QuantumInformation open scoped Matrix ComplexOrder
Formal statement
namespace FuchsThesis.Broadcast
/-- Fuchs, *Distinguishability and Accessible Information in Quantum Theory*,
arXiv:quant-ph/9601020v1, §4.3, eq. (4.57), p.115 (PDF p.124): the fidelity
`F(ρ₀, ρ₁) = tr √(ρ₀^{1/2} ρ₁ ρ₀^{1/2})` (4.56) is invariant under the interchange `0 ↔ 1` and
under `ρ₀ → U ρ₀ U†`, `ρ₁ → U ρ₁ U†` for any unitary `U`.
**Formalization Note.** `F` is `QAlgorithms.rootFidelity`, which is (4.56) verbatim with square
roots `cfc Real.sqrt` (the positive square root on positive semidefinite matrices). The states are
positive semidefinite matrices on an arbitrary finite index type; the source states it for density
operators (trace one is not needed). -/
theorem eq_4_57 {ι : Type} [Fintype ι] [DecidableEq ι] (ρ0 ρ1 : Matrix ι ι ℂ)
(hρ0 : ρ0.PosSemidef) (hρ1 : ρ1.PosSemidef) (U : Matrix ι ι ℂ)
(hU : U ∈ Matrix.unitaryGroup ι ℂ) :
QAlgorithms.rootFidelity ρ1 ρ0 = QAlgorithms.rootFidelity ρ0 ρ1 ∧
QAlgorithms.rootFidelity (U * ρ0 * Uᴴ) (U * ρ1 * Uᴴ) = QAlgorithms.rootFidelity ρ0 ρ1 := by sorry
end FuchsThesis.Broadcast
Source
Fuchs, Distinguishability and Accessible Information in Quantum Theory, arXiv:quant-ph/9601020v1, §4.3, eq. (4.57) with (4.56), p.115 (PDF p.124)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.