Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The common SRM of three optimal qubit protocols

Open
QAlgorithms.Papers.Independent.Intakenext100.P53.common_optimal_srm

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

prove2quantum

Let N≥1N\ge1N≥1 and d=2d=2d=2, with the physical singlet signals σi\sigma_iσi​ and their sum ρ\rhoρ as in Eqs.(4)-(5). Put Si=ρ−1/2σiρ−1/2S_i=\rho^{-1/2}\sigma_i\rho^{-1/2}Si​=ρ−1/2σi​ρ−1/2 and P0=I−supp⁡ρP_0=I-\operatorname{supp}\rhoP0​=I−suppρ, using support inverses. For the parity-correct physical spins jjj of NNN qubits, let PA(j)P_A(j)PA​(j) be their actual spectral projectors and hN(j)=tr⁡PA(j)h_N(j)=\operatorname{tr}P_A(j)hN​(j)=trPA​(j). Define the normalized filters

Odet=∑j2N+2hN(j)(N+2)sin⁡π(2j+1)N+2 PA(j),O_{\mathrm{det}}=\sum_j\sqrt{\frac{2^{N+2}}{h_N(j)(N+2)}}\sin\frac{\pi(2j+1)}{N+2}\,P_A(j),Odet​=j∑​hN​(j)(N+2)2N+2​​sinN+2π(2j+1)​PA​(j), Oprob=2N∑j(2j+1)2∑j(2j+1)2hN(j)PA(j).O_{\mathrm{prob}}=\sqrt{\frac{2^N}{\sum_j(2j+1)^2}}\sum_j\sqrt{\frac{(2j+1)^2}{h_N(j)}}P_A(j).Oprob​=∑j​(2j+1)22N​​j∑​hN​(j)(2j+1)2​​PA​(j).

The completed effects Si+P0/NS_i+P_0/NSi​+P0​/N form a deterministic POVM. They maximize entanglement fidelity with fixed O=IO=IO=I, and with OdetO_{\mathrm{det}}Odet​ they attain the global maximum over normalized resources and deterministic POVMs. With OprobO_{\mathrm{prob}}Oprob​, the effects SiS_iSi​ and the separate failure effect P0P_0P0​ form an exact probabilistic PBT protocol attaining the global maximum success probability. Both lifted filters commute with ρ\rhoρ, and the support effects for OdetσiOdet†O_{\mathrm{det}}\sigma_iO_{\mathrm{det}}^\daggerOdet​σi​Odet†​ are again SiS_iSi​.

This is the coincidence of the physical measurements in the three cases, excluding fixed-resource probabilistic PBT. The Eq.(14) numerator is corrected from 2N+12^{N+1}2N+1 to 2N+22^{N+2}2N+2 using the source's intrinsic sector dimension.

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.3, Eqs.(12)-(15): the three optimal qubit protocols share SRM.
Each optimizer is constructed; optimality is a conclusion. The Eq.(14)
normalization is corrected to 2^(N+2) with intrinsic sector dimensions.
Fixed-resource probabilistic PBT is deliberately excluded. -/
theorem common_optimal_srm (N : ℕ) (hN : 1 ≤ N) :
    DeterministicPOVM (completedSRM 2 N) ∧
    (∀ E : Fin N → Op (AC 2 N), DeterministicPOVM E →
      pbtFidelity (1 : Op (Ports 2 N)) E ≤
        pbtFidelity (1 : Op (Ports 2 N)) (completedSRM 2 N)) ∧
    NormalizedResource (deterministicResource N) ∧
    (∀ (O : Op (Ports 2 N)) (E : Fin N → Op (AC 2 N)),
      NormalizedResource O → DeterministicPOVM E →
      pbtFidelity O E ≤ pbtFidelity (deterministicResource N) (completedSRM 2 N)) ∧
    ExactProbabilistic (probabilisticResource N) (probabilisticSRM 2 N) ∧
    (∀ (O : Op (Ports 2 N)) (E : Option (Fin N) → Op (AC 2 N)),
      ExactProbabilistic O E → pbtSuccessProbability O E ≤
        pbtSuccessProbability (probabilisticResource N) (probabilisticSRM 2 N)) ∧
    pbtRho 2 N * liftA (deterministicResource N) = liftA (deterministicResource N) * pbtRho 2 N ∧
    pbtRho 2 N * liftA (probabilisticResource N) = liftA (probabilisticResource N) * pbtRho 2 N ∧
    (∀ i, transformedSRM (deterministicResource N) i = srm 2 N i) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P53

end
Source
Some remarks on port-based teleportation, arXiv:1506.01555v2, PDF p. 3, III Eqs.(12)-(15): common SRM in three optimal qubit protocols
Read-back

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

For every natural number N≥1N\ge1N≥1, let P={0,1}[N]\mathcal P=\{0,1\}^{[N]}P={0,1}[N], A=P×{0,1}\mathcal A=\mathcal P\times\{0,1\}A=P×{0,1}, and ∣s⟩=(∣0,1⟩−∣1,0⟩)/2|s\rangle=(|0,1\rangle-|1,0\rangle)/\sqrt2∣s⟩=(∣0,1⟩−∣1,0⟩)/2​, with Ψ=∣s⟩⟨s∣\Psi=|s\rangle\langle s|Ψ=∣s⟩⟨s∣. For each i∈[N]i\in[N]i∈[N], let SiS_iSi​ insert this vector on port iii and the final factor: its entry from a complementary configuration aaa to (x,c)(x,c)(x,c) is (−1)xi/2(-1)^{x_i}/\sqrt2(−1)xi​/2​ when c=1−xic=1-x_ic=1−xi​ and xxx restricts to aaa away from iii, and is zero otherwise. Put Hi=2−(N−1)SiSi†H_i=2^{-(N-1)}S_iS_i^\daggerHi​=2−(N−1)Si​Si†​, H=∑iHiH=\sum_iH_iH=∑i​Hi​, Q=Q=Q= the orthogonal projector onto the range of HHH, f(H)=cfc⁡(x↦(x)−1,H)f(H)=\operatorname{cfc}(x\mapsto(\sqrt x)^{-1},H)f(H)=cfc(x↦(x​)−1,H), Fi=f(H)Hif(H)F_i=f(H)H_if(H)Fi​=f(H)Hi​f(H), F^i=Fi+N−1(I−Q)\widehat F_i=F_i+N^{-1}(I-Q)Fi​=Fi​+N−1(I−Q), and Fnoneprob=I−QF^{\mathrm{prob}}_{\mathrm{none}}=I-QFnoneprob​=I−Q, Fsome iprob=FiF^{\mathrm{prob}}_{\mathrm{some}\ i}=F_iFsome iprob​=Fi​; the function in this calculus has value zero at zero. To specify the two resource matrices, take Jx=12(0110)J_x=\frac12\begin{pmatrix}0&1\\1&0\end{pmatrix}Jx​=21​(01​10​), Jy=12(0−ii0)J_y=\frac12\begin{pmatrix}0&-\mathrm i\\ \mathrm i&0\end{pmatrix}Jy​=21​(0i​−i0​), Jz=12diag⁡(1,−1)J_z=\frac12\operatorname{diag}(1,-1)Jz​=21​diag(1,−1), CN=∑α=x,y,z(∑j∈[N]Jα(j))2C_N=\sum_{\alpha=x,y,z}(\sum_{j\in[N]}J_\alpha^{(j)})^2CN​=∑α=x,y,z​(∑j∈[N]​Jα(j)​)2, Pt=1{(t/2)(t/2+1)}(CN)P_t=\mathbf1_{\{(t/2)(t/2+1)\}}(C_N)Pt​=1{(t/2)(t/2+1)}​(CN​), Dt=Re⁡tr⁡PtD_t=\operatorname{Re}\operatorname{tr}P_tDt​=RetrPt​, and T={t∈N:t≤N, t mod 2=N mod 2}\mathcal T=\{t\in\mathbb N:t\le N,\ t\bmod2=N\bmod2\}T={t∈N:t≤N, tmod2=Nmod2}. Define

Odet=∑t∈T2N+2Dt(N+2)sin⁡ ⁣(π(t+1)N+2)Pt,Oprob=2N∑t∈T(t+1)2∑t∈T(t+1)2DtPt.O_{\mathrm{det}}=\sum_{t\in\mathcal T} \sqrt{\frac{2^{N+2}}{D_t(N+2)}}\sin\!\left(\frac{\pi(t+1)}{N+2}\right)P_t, \qquad O_{\mathrm{prob}}= \sqrt{\frac{2^N}{\sum_{t\in\mathcal T}(t+1)^2}} \sum_{t\in\mathcal T}\sqrt{\frac{(t+1)^2}{D_t}}P_t.Odet​=t∈T∑​Dt​(N+2)2N+2​​sin(N+2π(t+1)​)Pt​,Oprob​=∑t∈T​(t+1)22N​​t∈T∑​Dt​(t+1)2​​Pt​.

Here the site operators act with identities elsewhere, and the spectral indicators use continuous functional calculus. For any complex matrix OOO on P\mathcal PP, define RO(a,b)=∑u∈POa,u∏js(uj,bj)R_O(a,b)=\sum_{u\in\mathcal P}O_{a,u}\prod_j s(u_j,b_j)RO​(a,b)=∑u∈P​Oa,u​∏j​s(uj​,bj​). For a matrix EEE on A\mathcal AA, define its unnormalized branch matrix by

BO(E)(q,x),(q′,y)=∑a,b∈P∑c,e∈{0,1}E(b,e),(a,c)RO(a,x)RO(b,y)‾Ψ(q,c),(q′,e).B_O(E)_{(q,x),(q',y)} =\sum_{a,b\in\mathcal P}\sum_{c,e\in\{0,1\}} E_{(b,e),(a,c)}R_O(a,x)\overline{R_O(b,y)} \Psi_{(q,c),(q',e)}.BO​(E)(q,x),(q′,y)​=a,b∈P∑​c,e∈{0,1}∑​E(b,e),(a,c)​RO​(a,x)RO​(b,y)​Ψ(q,c),(q′,e)​.

Let sel⁡iT\operatorname{sel}_iTseli​T have entry ∑aT(q,ins⁡i(u,a)),(q′,ins⁡i(v,a))\sum_aT_{(q,\operatorname{ins}_i(u,a)),(q',\operatorname{ins}_i(v,a))}∑a​T(q,insi​(u,a)),(q′,insi​(v,a))​ at ((q,u),(q′,v))((q,u),(q',v))((q,u),(q′,v)), where aaa ranges over configurations away from iii, and ins⁡i(u,a)\operatorname{ins}_i(u,a)insi​(u,a) puts uuu at iii and aaa elsewhere. Put pO(E)=Re⁡tr⁡BO(E)p_O(E)=\operatorname{Re}\operatorname{tr}B_O(E)pO​(E)=RetrBO​(E) and F(O,E)=∑iRe⁡tr⁡(Ψ sel⁡iBO(Ei))\mathcal F(O,E)=\sum_i\operatorname{Re}\operatorname{tr}(\Psi\,\operatorname{sel}_iB_O(E_i))F(O,E)=∑i​Retr(Ψseli​BO​(Ei​)). A resource is normalized exactly when tr⁡(O†O)=2N\operatorname{tr}(O^\dagger O)=2^Ntr(O†O)=2N; a deterministic measurement means Ei≥0E_i\ge0Ei​≥0 for every iii and ∑iEi=I\sum_iE_i=I∑i​Ei​=I; an exact probabilistic pair means a normalized resource and positive effects indexed by {none}∪[N]\{\mathrm{none}\}\cup[N]{none}∪[N] summing to III, with sel⁡iBO(Esome i)=pO(Esome i)Ψ\operatorname{sel}_iB_O(E_{\mathrm{some}\ i})=p_O(E_{\mathrm{some}\ i})\Psiseli​BO​(Esome i​)=pO​(Esome i​)Ψ for every iii. The theorem asserts that (F^i)i(\widehat F_i)_i(Fi​)i​ is a deterministic measurement and maximizes F(I,E)\mathcal F(I,E)F(I,E) over all deterministic measurements; OdetO_{\mathrm{det}}Odet​ is normalized and F(O,E)≤F(Odet,F^)\mathcal F(O,E)\le\mathcal F(O_{\mathrm{det}},\widehat F)F(O,E)≤F(Odet​,F) for every normalized complex matrix OOO and every deterministic measurement EEE; (Oprob,Fprob)(O_{\mathrm{prob}},F^{\mathrm{prob}})(Oprob​,Fprob) is an exact probabilistic pair, and every exact probabilistic pair (O,E)(O,E)(O,E) satisfies ∑ipO(Esome i)≤∑ipOprob(Fi)\sum_i p_O(E_{\mathrm{some}\ i})\le\sum_i p_{O_{\mathrm{prob}}}(F_i)∑i​pO​(Esome i​)≤∑i​pOprob​​(Fi​); HHH commutes with both Odet⊗I2O_{\mathrm{det}}\otimes I_2Odet​⊗I2​ and Oprob⊗I2O_{\mathrm{prob}}\otimes I_2Oprob​⊗I2​; and, for every iii, writing A=Odet⊗I2A=O_{\mathrm{det}}\otimes I_2A=Odet​⊗I2​ and R=AHA†R=AHA^\daggerR=AHA†, one has f(R)(AHiA†)f(R)=Fif(R)(AH_iA^\dagger)f(R)=F_if(R)(AHi​A†)f(R)=Fi​. No positivity or unitarity requirement is imposed on the competing resource matrices beyond their stated trace normalization.

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