Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.3: average ensemble fidelity is bounded below by F_e

Proved
QAlgorithms.Papers.Independent.Support50.P41.ensembleFidelityBound

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let pk≥0p_k\ge0pk​≥0 be a countable probability law, vkv_kvk​ unit vectors, and ρ=∑kpk∣vk⟩⟨vk∣\rho=\sum_k p_k|v_k\rangle\langle v_k|ρ=∑k​pk​∣vk​⟩⟨vk​∣. Fix one CPTP map Φ\PhiΦ and a normalized purification ψ\psiψ of ρ\rhoρ. The average squared fidelity converges and satisfies

Fe(ψ,Φ)≤F‾:=∑kpkF(∣vk⟩⟨vk∣,Φ(∣vk⟩⟨vk∣)).F_e(\psi,\Phi)\le\overline F:=\sum_k p_k F(|v_k\rangle\langle v_k|,\Phi(|v_k\rangle\langle v_k|)).Fe​(ψ,Φ)≤F:=k∑​pk​F(∣vk​⟩⟨vk​∣,Φ(∣vk​⟩⟨vk​∣)).

No orthogonality of the component states is required. This extends entanglement preservation to every ensemble of the same density matrix.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
Formal statement
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
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 19, §4.3: average ensemble fidelity is bounded below by F_e
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let KKK be any countable type, let d≥1d\ge1d≥1 and a≥0a\ge0a≥0 be integers, and let p:K→Rp:K\to\mathbb Rp:K→R have nonnegative values whose sum converges to one. Let vk∈Cdv_k\in\mathbb C^dvk​∈Cd have norm one for every kkk, including indices of zero weight, and suppose the matrix series ∑kpkvkvk†\sum_kp_kv_kv_k^\dagger∑k​pk​vk​vk†​ converges to a matrix ρ\rhoρ. Let ψ∈Ca⊗Cd\psi\in\mathbb C^a\otimes\mathbb C^dψ∈Ca⊗Cd have norm one and satisfy Tr⁡Ca(ψψ†)=ρ\operatorname{Tr}_{\mathbb C^a}(\psi\psi^\dagger)=\rhoTrCa​(ψψ†)=ρ. Let Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C) have a finite representation Φ(X)=∑jEjXEj†\Phi(X)=\sum_jE_jXE_j^\daggerΦ(X)=∑j​Ej​XEj†​ for every XXX, with ∑jEj†Ej=Id\sum_jE_j^\dagger E_j=I_d∑j​Ej†​Ej​=Id​. Define

fk=(Re⁡tr⁡vkvk† Φ(vkvk†) vkvk†)2.f_k=\left(\operatorname{Re}\operatorname{tr}\sqrt{\sqrt{v_kv_k^\dagger}\,\Phi(v_kv_k^\dagger)\,\sqrt{v_kv_k^\dagger}}\right)^2.fk​=(Retrvk​vk†​​Φ(vk​vk†​)vk​vk†​​​)2.

Then the real family (pkfk)k∈K(p_kf_k)_{k\in K}(pk​fk​)k∈K​ is summable, and Re⁡[ψ†(id⁡a⊗Φ)(ψψ†)ψ]≤∑kpkfk\operatorname{Re}[\psi^\dagger(\operatorname{id}_a\otimes\Phi)(\psi\psi^\dagger)\psi]\le\sum_kp_kf_kRe[ψ†(ida​⊗Φ)(ψψ†)ψ]≤∑k​pk​fk​. 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 KKK and a=0a=0a=0.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me