Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.2, equations (26)–(28): optimized entanglement fidelity

Proved
QAlgorithms.Papers.Independent.Support50.P41.processedFano

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

prove2quantum

For a density matrix ρ\rhoρ, CPTP map Φ\PhiΦ on dimension d≥1d\ge1d≥1, and normalized purification ψ\psiψ, the maximum F^e=max⁡UFe(ψ,Ad⁡U∘Φ)\widehat F_e=\max_U F_e(\psi,\operatorname{Ad}_U\circ\Phi)Fe​=maxU​Fe​(ψ,AdU​∘Φ) over system unitaries is attained. Its value is independent of the purification, and

F^e≥Fe,Se(ρ,Φ)≤h(F^e)+(1−F^e)log⁡2(d2−1),Se(ρ,Φ)≤1+2(1−F^e)log⁡2d.\widehat F_e\ge F_e,\qquad S_e(\rho,\Phi)\le h(\widehat F_e)+(1-\widehat F_e)\log_2(d^2-1),\qquad S_e(\rho,\Phi)\le1+2(1-\widehat F_e)\log_2d.Fe​≥Fe​,Se​(ρ,Φ)≤h(Fe​)+(1−Fe​)log2​(d2−1),Se​(ρ,Φ)≤1+2(1−Fe​)log2​d.

The logarithmic bound is for d≥2d\ge2d≥2; at d=1d=1d=1, F^e=1\widehat F_e=1Fe​=1 and Se=0S_e=0Se​=0. These bounds retain the original channel's entropy because the processing is unitary.

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.27--28, (26)--(28): attained unitary-processing maximum and Fano with original entropy. -/
theorem processedFano {d a : ℕ} [NeZero d]
    (Phi : Superop (Fin d) (Fin d)) (hPhi : IsChannel Phi)
    (rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho)
    (psi : EuclideanSpace ℂ (Fin a × Fin d)) (hpsi : IsPurification rho psi) :
    ∃ U : Matrix.unitaryGroup (Fin d) ℂ,
      let f := purificationFidelity psi (conjSuperop (U : Matrix (Fin d) (Fin d) ℂ) ∘ Phi)
      (∀ V : Matrix.unitaryGroup (Fin d) ℂ,
        purificationFidelity psi (conjSuperop (V : Matrix (Fin d) (Fin d) ℂ) ∘ Phi) ≤ f) ∧
      purificationFidelity psi Phi ≤ f ∧
      (∀ b (phi : EuclideanSpace ℂ (Fin b × Fin d)), IsPurification rho phi →
        ∀ V : Matrix.unitaryGroup (Fin d) ℂ,
          purificationFidelity phi (conjSuperop (V : Matrix (Fin d) (Fin d) ℂ) ∘ Phi) =
          purificationFidelity psi (conjSuperop (V : Matrix (Fin d) (Fin d) ℂ) ∘ Phi)) ∧
      (d = 1 → f = 1 ∧ entropyExchange Phi rho = 0) ∧
      (2 ≤ d → entropyExchange Phi rho ≤ binEntropy2 f + (1-f)*Real.logb 2 ((d : ℝ)^2-1)) ∧
      entropyExchange Phi rho ≤ 1+2*(1-f)*Real.logb 2 d := by sorry

end QAlgorithms.Papers.Independent.Support50.P41

end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 28, §6.2, equations (26)–(28): optimized entanglement fidelity
Read-back

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

Let d>0d>0d>0 and a≥0a\ge0a≥0, let Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C) admit a finite representation Φ(X)=∑jEjXEj†\Phi(X)=\sum_jE_jXE_j^\daggerΦ(X)=∑j​Ej​XEj†​ with ∑jEj†Ej=Id\sum_jE_j^\dagger E_j=I_d∑j​Ej†​Ej​=Id​, let ρ≥0\rho\ge0ρ≥0 have trace 111, and let ψ∈Ca⊗Cd\psi\in\mathbb C^a\otimes\mathbb C^dψ∈Ca⊗Cd have norm 111 and partial trace Tr⁡Ca(ψψ†)=ρ\operatorname{Tr}_{\mathbb C^a}(\psi\psi^\dagger)=\rhoTrCa​(ψψ†)=ρ. Write Fχ(Λ)=Re⁡∑u,vχu‾[(id⁡⊗Λ)(χχ†)]uvχvF_\chi(\Lambda)=\operatorname{Re}\sum_{u,v}\overline{\chi_u}[(\operatorname{id}\otimes\Lambda)(\chi\chi^\dagger)]_{uv}\chi_vFχ​(Λ)=Re∑u,v​χu​​[(id⊗Λ)(χχ†)]uv​χv​, S(Z)=−Re⁡Tr⁡[xlog⁡2x (Z)]S(Z)=-\operatorname{Re}\operatorname{Tr}[x\log_2x\,(Z)]S(Z)=−ReTr[xlog2​x(Z)], and EΦ(ρ)=S((id⁡⊗Φ)(ΓρΓρ†))E_\Phi(\rho)=S((\operatorname{id}\otimes\Phi)(\Gamma_\rho\Gamma_\rho^\dagger))EΦ​(ρ)=S((id⊗Φ)(Γρ​Γρ†​)), where Γρ(i,j)=(ρ)ji\Gamma_\rho(i,j)=(\sqrt\rho)_{ji}Γρ​(i,j)=(ρ​)ji​; matrix functions use continuous functional calculus and zero logarithmic terms are zero. There exists a unitary U∈Md(C)U\in M_d(\mathbb C)U∈Md​(C) such that, with f=Fψ(X↦UΦ(X)U†)f=F_\psi(X\mapsto U\Phi(X)U^\dagger)f=Fψ​(X↦UΦ(X)U†), every unitary V∈Md(C)V\in M_d(\mathbb C)V∈Md​(C) satisfies Fψ(X↦VΦ(X)V†)≤fF_\psi(X\mapsto V\Phi(X)V^\dagger)\le fFψ​(X↦VΦ(X)V†)≤f, and Fψ(Φ)≤fF_\psi(\Phi)\le fFψ​(Φ)≤f; moreover, for every natural number bbb, every norm-one ϕ∈Cb⊗Cd\phi\in\mathbb C^b\otimes\mathbb C^dϕ∈Cb⊗Cd with Tr⁡Cb(ϕϕ†)=ρ\operatorname{Tr}_{\mathbb C^b}(\phi\phi^\dagger)=\rhoTrCb​(ϕϕ†)=ρ, and every such VVV, one has Fϕ(X↦VΦ(X)V†)=Fψ(X↦VΦ(X)V†)F_\phi(X\mapsto V\Phi(X)V^\dagger)=F_\psi(X\mapsto V\Phi(X)V^\dagger)Fϕ​(X↦VΦ(X)V†)=Fψ​(X↦VΦ(X)V†). The same fff satisfies

d=1 ⟹ f=1 and EΦ(ρ)=0,d≥2 ⟹ EΦ(ρ)≤h2(f)+(1−f)log⁡2(d2−1),EΦ(ρ)≤1+2(1−f)log⁡2d,d=1\ \Longrightarrow\ f=1\ \text{and}\ E_\Phi(\rho)=0,\qquad d\ge2\ \Longrightarrow\ E_\Phi(\rho)\le h_2(f)+(1-f)\log_2(d^2-1), \qquad E_\Phi(\rho)\le1+2(1-f)\log_2d,d=1 ⟹ f=1 and EΦ​(ρ)=0,d≥2 ⟹ EΦ​(ρ)≤h2​(f)+(1−f)log2​(d2−1),EΦ​(ρ)≤1+2(1−f)log2​d,

where h2(x)=(−xln⁡x−(1−x)ln⁡(1−x))/ln⁡2h_2(x)=(-x\ln x-(1-x)\ln(1-x))/\ln2h2​(x)=(−xlnx−(1−x)ln(1−x))/ln2. Zero reference dimensions aaa and bbb are included in the quantifiers, but cannot support the required norm-one purifications.

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