§4.3: average ensemble fidelity is bounded below by F_e
ProvedQAlgorithms.Papers.Independent.Support50.P41.ensembleFidelityBoundLet be a countable probability law, unit vectors, and . Fix one CPTP map and a normalized purification of . The average squared fidelity converges and satisfies
No orthogonality of the component states is required. This extends entanglement preservation to every ensemble of the same density matrix.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P41
open QAlgorithms
open QAlgorithms.Entanglement (IsCompletelyPositive)
open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)
open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)
open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)
open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)
open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)
open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)
open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.
local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _
/-- PDF pp.17--19: any countable pure ensemble has average fidelity at least entanglement fidelity. -/
theorem ensembleFidelityBound {K : Type*} [Countable K] {d a : ℕ} [NeZero d]
(p : K → ℝ) (hp : ∀ k, 0 ≤ p k) (htotal : HasSum p 1)
(v : K → EuclideanSpace ℂ (Fin d)) (hv : ∀ k, IsState (v k))
(rho : Matrix (Fin d) (Fin d) ℂ)
(havg : HasSum (fun k => (p k : ℂ) • pureDensity (v k)) rho)
(psi : EuclideanSpace ℂ (Fin a × Fin d)) (hpsi : IsPurification rho psi)
(Phi : Superop (Fin d) (Fin d)) (hPhi : IsChannel Phi) :
Summable (fun k => p k * rootFidelity (pureDensity (v k)) (Phi (pureDensity (v k)))^2) ∧
purificationFidelity psi Phi ≤
∑' k, p k * rootFidelity (pureDensity (v k)) (Phi (pureDensity (v k)))^2 := by sorry
end QAlgorithms.Papers.Independent.Support50.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any countable type, let and be integers, and let have nonnegative values whose sum converges to one. Let have norm one for every , including indices of zero weight, and suppose the matrix series converges to a matrix . Let have norm one and satisfy . Let have a finite representation for every , with . Define
Then the real family is summable, and . Matrix square roots are spectral square roots, the partial trace sums over equal reference indices, and the amplification acts blockwise. The normalization hypotheses exclude empty and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.