Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 11: recycling fidelity upper bound

Proved
QAlgorithms.Papers.Independent.Extend50.P04.nonoptimal_le_one

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

prove2quantum

Let N≥1N\ge1N≥1 be the number of ports and d≥2d\ge2d≥2 their local dimension. Each initial port is the normalized Bell vector d−1/2∑i=1d∣ii⟩d^{-1/2}\sum_{i=1}^d|ii\rangled−1/2∑i=1d​∣ii⟩. On Alice's NNN ports and input, let σa=d−(N−1)Iaˉ⊗Pa0+\sigma_a=d^{-(N-1)}I_{\bar a}\otimes P^+_{a0}σa​=d−(N−1)Iaˉ​⊗Pa0+​, ρ=∑aσa\rho=\sum_a\sigma_aρ=∑a​σa​, Πa=ρ−1/2σaρ−1/2\Pi_a=\rho^{-1/2}\sigma_a\rho^{-1/2}Πa​=ρ−1/2σa​ρ−1/2 (inverse zero on the kernel), Δ=I−∑aΠa\Delta=I-\sum_a\Pi_aΔ=I−∑a​Πa​, and Π~a=Πa+Δ/N\widetilde\Pi_a=\Pi_a+\Delta/NΠa​=Πa​+Δ/N. Write Va′V_a^\primeVa′​ for the swap of port aaa and input, transposed only on input in the computational basis. Here FrecF_{\rm rec}Frec​ is the Born-weighted average of the unsquared absolute overlaps of normalized whole output branches with the ideal state, retaining the teleported Bell pair and all unused ports. The measurement instrument is Π~a\sqrt{\widetilde\Pi_a}Πa​​; FnonF_{\rm non}Fnon​ uses identity resource operations. The one-round unoptimized recycling fidelity satisfies

Fnon(N,d)≤1.F_{\rm non}(N,d)\le1.Fnon​(N,d)≤1.

The uniform full-effect trace used in the source proof is a consequence, not an assumption.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P04
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Extend50.P04

open QAlgorithms

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable

/-- PDF pp.14-15, Remark 11, (77): the actual operational fidelity is at most one.
Uniform POVM traces are derived by the paper, not assumed as a hypothesis. -/
theorem nonoptimal_le_one (d n : ℕ) (hd : 2 ≤ d) :
    nonoptimalFidelity d n ≤ 1 := by sorry

end QAlgorithms.Papers.Independent.Extend50.P04

end
Source
Square-root measurements and degradation of the resource state in port-based teleportation scheme, arXiv:2105.14886v4, PDF p. 14, Remark 11: recycling fidelity upper bound
Read-back

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

For every pair of natural numbers d,nd,nd,n satisfying d≥2d\ge2d≥2, put N=n+1N=n+1N=n+1 and index matrices by pairs (x,u)(x,u)(x,u), where x:{0,…,N−1}→{0,…,d−1}x:\{0,\ldots,N-1\}\to\{0,\ldots,d-1\}x:{0,…,N−1}→{0,…,d−1} and u∈{0,…,d−1}u\in\{0,\ldots,d-1\}u∈{0,…,d−1}. Define

(Ta)(x,u),(y,v)=1{x(a)=u, y(a)=v, ∀i≠a, x(i)=y(i)},Sa=d−(N−1)(d−1Ta),(T_a)_{(x,u),(y,v)} =\mathbf1_{\{x(a)=u,\ y(a)=v,\ \forall i\ne a,\ x(i)=y(i)\}}, \qquad S_a=d^{-(N-1)}(d^{-1}T_a),(Ta​)(x,u),(y,v)​=1{x(a)=u, y(a)=v, ∀i=a, x(i)=y(i)}​,Sa​=d−(N−1)(d−1Ta​), H=∑aSa,R=f(H),Ea=RSaR,Fa=Ea+1N(I−∑bEb),H=\sum_aS_a,\quad R=f(H),\quad E_a=RS_aR,\quad F_a=E_a+\frac1N\left(I-\sum_bE_b\right),H=a∑​Sa​,R=f(H),Ea​=RSa​R,Fa​=Ea​+N1​(I−b∑​Eb​),

where f(t)=(t)−1f(t)=(\sqrt t)^{-1}f(t)=(t​)−1 is applied by real continuous functional calculus. Define vectors on the product of two copies of this index set by

Ω(x,u),(y,v)=1{u=v, x=y}dN+1,(Ξa)(x,u),(y,v)=1{x(a)=u, y(a)=v, ∀i≠a, x(i)=y(i)}ddn,\Omega_{(x,u),(y,v)} =\frac{\mathbf1_{\{u=v,\ x=y\}}}{\sqrt{d^{N+1}}}, \qquad (\Xi_a)_{(x,u),(y,v)} =\frac{\mathbf1_{\{x(a)=u,\ y(a)=v,\ \forall i\ne a,\ x(i)=y(i)\}}} {d\sqrt{d^n}},Ω(x,u),(y,v)​=dN+1​1{u=v, x=y}​​,(Ξa​)(x,u),(y,v)​=ddn​1{x(a)=u, y(a)=v, ∀i=a, x(i)=y(i)}​​,

and put ba=(Fa⊗I)Ωb_a=(\sqrt{F_a}\otimes I)\Omegaba​=(Fa​​⊗I)Ω, with matrix square root given by continuous functional calculus with the real square-root function. The theorem asserts

∑a=0N−1∥ba∥2∣⟨Ξa,∥ba∥−1ba⟩∣≤1.\sum_{a=0}^{N-1}\|b_a\|^2 \left|\left\langle\Xi_a,\|b_a\|^{-1}b_a\right\rangle\right| \le1.a=0∑N−1​∥ba​∥2​⟨Ξa​,∥ba​∥−1ba​⟩​≤1.

The norms are Euclidean norms, and the inner-product factor is its complex modulus rather than its squared modulus. All reciprocals are total with 0−1=00^{-1}=00−1=0, so a zero branch contributes zero; real square root is zero on negative arguments. The assertion includes n=0n=0n=0.

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

    Confirmed by the moderator at approval.

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