Eq. (4.80) — a broadcasting process preserves fidelity,
ProvedFuchsThesis.Broadcast.eq_4_80information-theoryp2o-gran-per-chapterp2o-plan-bookp2o-v1quantum-information
Let be density operators of an -dimensional system , and let a process (with , density operators of and and unitary on ) broadcast them: satisfies and for . Then
where and both denote the fidelity of (4.56); that is, . This is the elementary constraint on every broadcasting process.
Differences from the source:
- reading: the chain → the single equation ; reason: the source states that and denote "simply the fidelity " in two representations.
- encoding: auxiliary system → indices ; -dimensional spaces → an arbitrary finite index type; reason: Lean convention; covers every finite-dimensional system.
- encoding: the trace of (4.56) → the real part of the trace, square roots by the continuous functional calculus of the real square root; reason: Lean convention; on 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 import Definitions.Def_WildeQIT_IsDensityOperator import Definitions.Def_WildeQIT_partialTrace import Definitions.Def_FuchsThesis_Broadcast_ancillaProcess open scoped Kronecker
Formal statement
namespace FuchsThesis.Broadcast
/-- Fuchs, *Distinguishability and Accessible Information in Quantum Theory*,
arXiv:quant-ph/9601020v1, §4.3, eq. (4.80), p.117 (PDF p.126): the elementary constraint on
broadcasting. If a process `E` of the form (4.51) broadcasts `{ρ₀, ρ₁}`, i.e. `ρ̃ₛ = E(ρₛ ⊗ Σ)`
satisfies `tr_A ρ̃ₛ = ρₛ` and `tr_B ρ̃ₛ = ρₛ` for `s = 0, 1` (4.49), then
`F_A(ρ₀, ρ₁) = F(ρ̃₀, ρ̃₁) = F_B(ρ₀, ρ₁)`, where `F_A` and `F_B` are both the fidelity
`F(ρ₀, ρ₁)`; that is, `F(ρ̃₀, ρ̃₁) = F(ρ₀, ρ₁)`.
**Formalization Note.** `F` is `QAlgorithms.rootFidelity` = (4.56). `F_A(ρ₀, ρ₁)` and
`F_B(ρ₀, ρ₁)` are, in the source, `F(ρ₀, ρ₁)` written through an optimal POVM on `A` resp. `B`
("FA(ρ0, ρ1) denotes simply the fidelity F(ρ0, ρ1)", p.117), so both equalities of (4.80) are the
single equation `F(ρ̃₀, ρ̃₁) = F(ρ₀, ρ₁)`. Encoding as in `IsBroadcast`: `A`, `B` indexed by `n`,
`C` by `Fin k`, `tr_A`/`tr_B` the left/right partial traces, `E = ancillaProcess U Υ`. -/
theorem eq_4_80 {n : Type} [Fintype n] [DecidableEq n] {k : ℕ}
(ρ0 ρ1 Sig : Matrix n n ℂ) (Ups : Matrix (Fin k) (Fin k) ℂ)
(U : Matrix ((n × n) × Fin k) ((n × n) × Fin k) ℂ)
(hρ0 : WildeQIT.IsDensityOperator ρ0) (hρ1 : WildeQIT.IsDensityOperator ρ1)
(hSig : WildeQIT.IsDensityOperator Sig) (hUps : WildeQIT.IsDensityOperator Ups)
(hU : U ∈ Matrix.unitaryGroup ((n × n) × Fin k) ℂ)
(hbc : ∀ ρ ∈ ({ρ0, ρ1} : Set (Matrix n n ℂ)),
WildeQIT.partialTraceLeft (ancillaProcess U Ups (ρ ⊗ₖ Sig)) = ρ ∧
WildeQIT.partialTraceRight (ancillaProcess U Ups (ρ ⊗ₖ Sig)) = ρ) :
QAlgorithms.rootFidelity (ancillaProcess U Ups (ρ0 ⊗ₖ Sig))
(ancillaProcess U Ups (ρ1 ⊗ₖ Sig)) = 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.80), p.117 (PDF p.126)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.