Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact optimal classical teleportation fidelity

Open
QAlgorithms.Papers.Independent.Intakenext100.P18.classical_benchmark

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d≥1d\ge1d≥1 and use the normalized uniform Haar distribution of pure ddd-dimensional inputs. For any finite POVM (Mi)i=1k(M_i)_{i=1}^k(Mi​)i=1k​ with Mi⪰0M_i\succeq0Mi​⪰0 and ∑iMi=I\sum_iM_i=I∑i​Mi​=I, and any density operators τi\tau_iτi​, the classical measure-and-prepare channel is C(X)=∑iTr⁡(MiX)τiC(X)=\sum_i\operatorname{Tr}(M_iX)\tau_iC(X)=∑i​Tr(Mi​X)τi​. Its average squared survival fidelity obeys

f(C)≤2d+1.f(C)\le\frac2{d+1}.f(C)≤d+12​.

The channel C0(X)=∑i=0d−1Xii∣i⟩⟨i∣C_0(X)=\sum_{i=0}^{d-1}X_{ii}|i\rangle\langle i|C0​(X)=∑i=0d−1​Xii​∣i⟩⟨i∣, implemented by computational-basis measurement, classical communication and preparation of the reported basis state, attains equality. Equivalently, every separable bipartite density operator has fixed plus overlap at most 1/d1/d1/d, and some separable density attains 1/d1/d1/d.

Thus 2/(d+1)2/(d+1)2/(d+1) is the achieved classical optimum. The statement includes explicit membership of C0C_0C0​ in the measure-and-prepare class and does not rely on a default-valued real supremum.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P18
Formal statement
noncomputable section

open QAlgorithms MeasureTheory

open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator

namespace QAlgorithms.Papers.Independent.Intakenext100.P18

open QAlgorithms.Papers.Independent.Claimed50.P28 (maximallyEntangledDensity)

open QAlgorithms.Papers.Independent.Support50.P11 (choiState teleportWeyl bellKet)

open QAlgorithms.Papers.Independent.Renew46.P40 (initialJoint)

/-- PDF p.8, section IV: optimal purely classical fidelity, with a named
achiever as well as the upper bound against every measure/prepare channel.
The equivalent singlet bound is stated for every separable density. -/
theorem classical_benchmark (d : ℕ) (hd : 0 < d) :
    letI : Nonempty (Fin d) := ⟨⟨0, hd⟩⟩;
    (∀ k : ℕ, ∀ M tau : Fin k → Matrix (Fin d) (Fin d) ℂ,
      IsPOVM M → (∀ i, IsDensityMatrix (tau i)) →
      QuditFidelity.averageFidelity d hd ((fun X => ∑ i, (M i * X).trace • tau i)) ≤ 2 / (d + 1 : ℝ)) ∧
    (∃ k : ℕ, ∃ M tau : Fin k → Matrix (Fin d) (Fin d) ℂ,
      IsPOVM M ∧ (∀ i, IsDensityMatrix (tau i)) ∧ (fun X => ∑ i, (M i * X).trace • tau i) = basisClassical d) ∧
    IsChannel (basisClassical d) ∧
    QuditFidelity.averageFidelity d hd (basisClassical d) = 2 / (d + 1 : ℝ) ∧
    (∀ rho : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ,
        Entanglement.IsSeparableDensity rho → effectProb (maximallyEntangledDensity d) rho ≤ 1 / (d : ℝ)) ∧
    (∃ rho : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ,
      Entanglement.IsSeparableDensity rho ∧ effectProb (maximallyEntangledDensity d) rho = 1 / (d : ℝ)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P18

end
Source
General teleportation channel, singlet fraction and quasi-distillation, arXiv:quant-ph/9807091v2, PDF p. 8, §IV, unnumbered: optimal purely classical teleportation fidelity
Read-back

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

For every positive integer ddd, define Fav(E)=∫Re⁡tr⁡[PUE(PU)] dUF_{\rm av}(\mathcal E)=\int\operatorname{Re}\operatorname{tr}[P_U\mathcal E(P_U)]\,dUFav​(E)=∫Retr[PU​E(PU​)]dU, where PU=∣U0⟩⟨U0∣P_U=|U0\rangle\langle U0|PU​=∣U0⟩⟨U0∣ and dUdUdU is normalized Haar measure on the unitary group. For every natural number kkk, every family of positive semidefinite d×dd\times dd×d matrices M0,…,Mk−1M_0,\ldots,M_{k-1}M0​,…,Mk−1​ satisfying ∑iMi=Id\sum_iM_i=I_d∑i​Mi​=Id​, and every family of positive semidefinite trace-one matrices τ0,…,τk−1\tau_0,\ldots,\tau_{k-1}τ0​,…,τk−1​, the map E(X)=∑itr⁡(MiX)τi\mathcal E(X)=\sum_i\operatorname{tr}(M_iX)\tau_iE(X)=∑i​tr(Mi​X)τi​ satisfies Fav(E)≤2/(d+1)F_{\rm av}(\mathcal E)\le2/(d+1)Fav​(E)≤2/(d+1). There exist such k,Mi,τik,M_i,\tau_ik,Mi​,τi​ for which this map equals Δ(X)ij=1i=jXii\Delta(X)_{ij}=\mathbf1_{i=j}X_{ii}Δ(X)ij​=1i=j​Xii​ for every XXX; moreover, Δ\DeltaΔ admits a finite Kraus representation Δ(X)=∑ℓKℓXKℓ†\Delta(X)=\sum_\ell K_\ell X K_\ell^\daggerΔ(X)=∑ℓ​Kℓ​XKℓ†​ with ∑ℓKℓ†Kℓ=Id\sum_\ell K_\ell^\dagger K_\ell=I_d∑ℓ​Kℓ†​Kℓ​=Id​, and Fav(Δ)=2/(d+1)F_{\rm av}(\Delta)=2/(d+1)Fav​(Δ)=2/(d+1). Let Φd\Phi_dΦd​ be the outer product of d−1/2∑j∣j,j⟩d^{-1/2}\sum_j|j,j\rangled−1/2∑j​∣j,j⟩ with itself. Every separable density matrix ρ\rhoρ, meaning a finite sum ρ=∑jwjAj⊗Bj\rho=\sum_jw_jA_j\otimes B_jρ=∑j​wj​Aj​⊗Bj​ with wj≥0w_j\ge0wj​≥0, ∑jwj=1\sum_jw_j=1∑j​wj​=1, and each Aj,BjA_j,B_jAj​,Bj​ positive semidefinite of trace 111, satisfies Re⁡tr⁡(Φdρ)≤1/d\operatorname{Re}\operatorname{tr}(\Phi_d\rho)\le1/dRetr(Φd​ρ)≤1/d; at least one such separable density matrix attains equality. The universal quantification includes k=0k=0k=0, whose requirement ∑iMi=Id\sum_iM_i=I_d∑i​Mi​=Id​ cannot hold for positive ddd, and includes d=1d=1d=1.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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