Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fixed-resource SRM fidelity and coding lower bounds

Open
QAlgorithms.Papers.Independent.Intakenext100.P53.srm_fidelity_lower_bound

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

prove2quantum

Let N≥1N\ge1N≥1 and d≥2d\ge2d≥2 be integers. Alice and Bob have NNN ordered ddd-dimensional ports, and the input register CCC has dimension ddd. Write s=(d−1)/2s=(d-1)/2s=(d−1)/2 and ∣S⟩=d−1/2∑m=−ss(−1)s−m∣s,m⟩∣s,−m⟩|S\rangle=d^{-1/2}\sum_{m=-s}^s(-1)^{s-m}|s,m\rangle|s,-m\rangle∣S⟩=d−1/2∑m=−ss​(−1)s−m∣s,m⟩∣s,−m⟩. Put Pi=∣S⟩⟨S∣AiC⊗IAˉiP_i=|S\rangle\langle S|_{A_iC}\otimes I_{\bar A_i}Pi​=∣S⟩⟨S∣Ai​C​⊗IAˉi​​, σi=d−(N−1)Pi\sigma_i=d^{-(N-1)}P_iσi​=d−(N−1)Pi​, and ρ=∑iσi\rho=\sum_i\sigma_iρ=∑i​σi​. A resource filter OOO gives ∣ΨO⟩=(OA⊗IB)∣S⟩⊗N|\Psi_O\rangle=(O_A\otimes I_B)|S\rangle^{\otimes N}∣ΨO​⟩=(OA​⊗IB​)∣S⟩⊗N and obeys tr⁡(O†O)=dN\operatorname{tr}(O^\dagger O)=d^Ntr(O†O)=dN. Alice measures ACACAC; Bob selects the reported port and discards the others. Entanglement fidelities are tested against a normalized reference-input singlet, with no correction on the selected port.

Take O=IO=IO=I and the completed SRM Πi=ρ−1/2σiρ−1/2+(I−supp⁡ρ)/N\Pi_i=\rho^{-1/2}\sigma_i\rho^{-1/2}+(I-\operatorname{supp}\rho)/NΠi​=ρ−1/2σi​ρ−1/2+(I−suppρ)/N. These effects form a deterministic POVM. Its actual entanglement fidelity and every correct port-coding probability satisfy

F≥NN+d2−1,qk∣k=d2FN≥d2N+d2−1.F\ge\frac{N}{N+d^2-1},\qquad q_{k|k}=\frac{d^2F}{N}\ge\frac{d^2}{N+d^2-1}.F≥N+d2−1N​,qk∣k​=Nd2F​≥N+d2−1d2​.

The source independently rederives this fixed-resource measurement bound in Appendix C. It is not an inequality for arbitrary measurements. At N=1N=1N=1, F=d−2F=d^{-2}F=d−2 and qk∣k=1q_{k|k}=1qk∣k​=1.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P53
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P53

open scoped Classical ComplexConjugate ComplexOrder Matrix Matrix.Norms.L2Operator

-- Accepted generic matrix and positive-operator interfaces. The support is the
-- orthogonal range projection; all uses below are on positive physical rho.

open QAlgorithms.Papers.Independent.Information100.P21 (Op)

open QAlgorithms.Papers.Independent.Information100.P07 (support)

open QAlgorithms.Papers.Independent.Next46.P39 (inverseSqrt)

/-- PDF p.5, Eqs.(29)-(30), p.7: fixed maximally entangled resource, completed
SRM, and every port's physical coding probability. -/
theorem srm_fidelity_lower_bound (d N : ℕ) (hd : 2 ≤ d) (hN : 1 ≤ N) :
    DeterministicPOVM (completedSRM d N) ∧
    pbtFidelity (1 : Op (Ports d N)) (completedSRM d N) ≥
      (N : ℝ) / ((N : ℝ) + (d : ℝ) ^ 2 - 1) ∧
    ∀ k : Fin N,
      codingProbability (1 : Op (Ports d N)) (completedSRM d N k) k =
        (d : ℝ) ^ 2 * pbtFidelity (1 : Op (Ports d N)) (completedSRM d N) / N ∧
      codingProbability (1 : Op (Ports d N)) (completedSRM d N k) k ≥
        (d : ℝ) ^ 2 / ((N : ℝ) + (d : ℝ) ^ 2 - 1) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P53

end
Source
Some remarks on port-based teleportation, arXiv:1506.01555v2, PDF p. 5, VII Eqs.(29)-(30), Appendix C: rederived SRM fidelity and coding probability lower bounds
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 with d≥2d\ge2d≥2 and N≥1N\ge1N≥1, let P={0,…,d−1}{0,…,N−1}P=\{0,\ldots,d-1\}^{\{0,\ldots,N-1\}}P={0,…,d−1}{0,…,N−1}, H=P×{0,…,d−1}H=P\times\{0,\ldots,d-1\}H=P×{0,…,d−1}, and define

s(a,c)=(−1)ad1{c=d−1−a},Σ=ss†,Ji((x,c),r)=s(xi,c)1{x∣j≠i=r},σi=JiJi†dN−1,ρ=∑iσi.s(a,c)=\frac{(-1)^a}{\sqrt d}\mathbf1_{\{c=d-1-a\}}, \quad \Sigma=ss^\dagger, \quad J_i((x,c),r)=s(x_i,c)\mathbf1_{\{x|_{j\ne i}=r\}}, \quad \sigma_i=\frac{J_iJ_i^\dagger}{d^{N-1}}, \quad \rho=\sum_i\sigma_i.s(a,c)=d​(−1)a​1{c=d−1−a}​,Σ=ss†,Ji​((x,c),r)=s(xi​,c)1{x∣j=i​=r}​,σi​=dN−1Ji​Ji†​​,ρ=i∑​σi​.

Here rrr ranges over assignments to the ports other than iii. Let KKK be the functional-calculus value of x↦(x)−1x\mapsto(\sqrt x)^{-1}x↦(x​)−1 at ρ\rhoρ, with 0−1=00^{-1}=00−1=0, let Πρ\Pi_\rhoΠρ​ be the orthogonal projection onto its range, and put Xi=KσiK+N−1(IH−Πρ)X_i=K\sigma_iK+N^{-1}(I_H-\Pi_\rho)Xi​=Kσi​K+N−1(IH​−Πρ​). To specify the quantities in the conclusion, define the identity-resource coefficients Ψ(x,y)=∏js(xj,yj)\Psi(x,y)=\prod_js(x_j,y_j)Ψ(x,y)=∏j​s(xj​,yj​) and

(BA)(a,x),(b,y)=∑u,v,c,eA(v,e),(u,c)Ψ(u,x)Ψ(v,y)‾s(a,c)s(b,e)‾,(B_A)_{(a,x),(b,y)} =\sum_{u,v,c,e}A_{(v,e),(u,c)} \Psi(u,x)\overline{\Psi(v,y)}s(a,c)\overline{s(b,e)},(BA​)(a,x),(b,y)​=u,v,c,e∑​A(v,e),(u,c)​Ψ(u,x)Ψ(v,y)​s(a,c)s(b,e)​, (QkBA)(a,c),(b,e)=∑r(BA)(a,ins⁡k(c,r)),(b,ins⁡k(e,r)),(Ck)(x,c),(y,e)=∑rΨ(x,ins⁡k(c,r))Ψ(y,ins⁡k(e,r))‾,(Q_kB_A)_{(a,c),(b,e)} =\sum_r(B_A)_{(a,\operatorname{ins}_k(c,r)),(b,\operatorname{ins}_k(e,r))}, \qquad (C_k)_{(x,c),(y,e)} =\sum_r\Psi(x,\operatorname{ins}_k(c,r)) \overline{\Psi(y,\operatorname{ins}_k(e,r))},(Qk​BA​)(a,c),(b,e)​=r∑​(BA​)(a,insk​(c,r)),(b,insk​(e,r))​,(Ck​)(x,c),(y,e)​=r∑​Ψ(x,insk​(c,r))Ψ(y,insk​(e,r))​,

where ins⁡k\operatorname{ins}_kinsk​ inserts the specified value at port kkk. Set F=∑iRe⁡tr⁡(ΣQiBXi)F=\sum_i\operatorname{Re}\operatorname{tr}(\Sigma Q_iB_{X_i})F=∑i​Retr(ΣQi​BXi​​). The theorem asserts that every XiX_iXi​ is positive semidefinite, ∑iXi=IH\sum_iX_i=I_H∑i​Xi​=IH​, and

F≥NN+d2−1.F\ge\frac{N}{N+d^2-1}.F≥N+d2−1N​.

It also asserts, for every port k<Nk<Nk<N, both

Re⁡tr⁡(XkCk)=d2FNandRe⁡tr⁡(XkCk)≥d2N+d2−1.\operatorname{Re}\operatorname{tr}(X_kC_k)=\frac{d^2F}{N} \qquad\text{and}\qquad \operatorname{Re}\operatorname{tr}(X_kC_k)\ge \frac{d^2}{N+d^2-1}.Retr(Xk​Ck​)=Nd2F​andRetr(Xk​Ck​)≥N+d2−1d2​.
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