Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Operational entanglement fidelity and its SRM expression

Open
QAlgorithms.Papers.Independent.Intakenext100.P53.operational_entanglement_fidelity

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.

For every deterministic POVM {Πi}\{\Pi_i\}{Πi​} on ACACAC, the actual induced port-selection channel has

F=1d2∑iRe⁡tr⁡ ⁣[Πi(OA⊗IC)σi(OA†⊗IC)].F=\frac1{d^2}\sum_i\operatorname{Re}\operatorname{tr}\!\left[\Pi_i(O_A\otimes I_C)\sigma_i(O_A^\dagger\otimes I_C)\right].F=d21​i∑​Retr[Πi​(OA​⊗IC​)σi​(OA†​⊗IC​)].

For O=IO=IO=I, define Si=ρ−1/2σiρ−1/2S_i=\rho^{-1/2}\sigma_i\rho^{-1/2}Si​=ρ−1/2σi​ρ−1/2 with the support inverse square root, and Πi=Si+(I−supp⁡ρ)/N\Pi_i=S_i+(I-\operatorname{supp}\rho)/NΠi​=Si​+(I−suppρ)/N. These effects form a deterministic POVM, and its operational fidelity equals

F=1d2∑iRe⁡tr⁡(ρ−1/2σiρ−1/2σi).F=\frac1{d^2}\sum_i\operatorname{Re}\operatorname{tr}(\rho^{-1/2}\sigma_i\rho^{-1/2}\sigma_i).F=d21​i∑​Retr(ρ−1/2σi​ρ−1/2σi​).

This identifies the physical teleportation experiment with the signal-operator formula. The missing trace in printed Eq.(6) is restored from Eq.(3) and Appendix C.

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.2, Eqs.(3)-(6), p.7: operational fidelity and the SRM trace formula.
The trace missing from printed Eq.(6) is fixed by Eq.(3) and Appendix C. -/
theorem operational_entanglement_fidelity (d N : ℕ) (hd : 2 ≤ d) (hN : 1 ≤ N) :
    (∀ (O : Op (Ports d N)) (E : Fin N → Op (AC d N)),
      NormalizedResource O → DeterministicPOVM E →
      pbtFidelity O E = (d : ℝ)⁻¹ ^ 2 * ∑ i,
        (Matrix.trace (E i * liftA O * pbtSignal d N i * (liftA O)ᴴ)).re) ∧
    DeterministicPOVM (completedSRM d N) ∧
    pbtFidelity (1 : Op (Ports d N)) (completedSRM d N) =
      (d : ℝ)⁻¹ ^ 2 * ∑ i,
        (Matrix.trace (inverseSqrt (pbtRho d N) * pbtSignal d N i *
          inverseSqrt (pbtRho d N) * pbtSignal d N i)).re := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P53

end
Source
Some remarks on port-based teleportation, arXiv:1506.01555v2, PDF p. 2, II, Eqs.(3)-(6): operational entanglement-fidelity formula
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 and N≥1N\ge1N≥1, use 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

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 functional calculus of ρ\rhoρ with x↦(x)−1x\mapsto(\sqrt x)^{-1}x↦(x​)−1, taking 0−1=00^{-1}=00−1=0, let Πρ\Pi_\rhoΠρ​ be the orthogonal projection onto its range, and set Xi=KσiK+N−1(IH−Πρ)X_i=K\sigma_iK+N^{-1}(I_H-\Pi_\rho)Xi​=Kσi​K+N−1(IH​−Πρ​). For any complex matrix OOO on PPP, write LO=O⊗IdL_O=O\otimes I_dLO​=O⊗Id​ and

ΨO(x,y)=∑uOx,u∏js(uj,yj),(BA)(a,x),(b,y)=∑u,v,c,eA(v,e),(u,c)ΨO(u,x)ΨO(v,y)‾s(a,c)s(b,e)‾.\Psi_O(x,y)=\sum_uO_{x,u}\prod_js(u_j,y_j), \qquad (B_A)_{(a,x),(b,y)} =\sum_{u,v,c,e}A_{(v,e),(u,c)} \Psi_O(u,x)\overline{\Psi_O(v,y)}s(a,c)\overline{s(b,e)}.ΨO​(x,y)=u∑​Ox,u​j∏​s(uj​,yj​),(BA​)(a,x),(b,y)​=u,v,c,e∑​A(v,e),(u,c)​ΨO​(u,x)ΨO​(v,y)​s(a,c)s(b,e)​.

Define QiBAQ_iB_AQi​BA​ by summing the entries (BA)(a,ins⁡i(c,r)),(b,ins⁡i(e,r))(B_A)_{(a,\operatorname{ins}_i(c,r)),(b,\operatorname{ins}_i(e,r))}(BA​)(a,insi​(c,r)),(b,insi​(e,r))​ over assignments rrr to all other ports, and put F(O,E)=∑iRe⁡tr⁡(ΣQiBEi)F(O,E)=\sum_i\operatorname{Re}\operatorname{tr}(\Sigma Q_iB_{E_i})F(O,E)=∑i​Retr(ΣQi​BEi​​). The theorem asserts jointly that, for every OOO and every family EiE_iEi​ of complex matrices on HHH, the hypotheses tr⁡(O†O)=dN\operatorname{tr}(O^\dagger O)=d^Ntr(O†O)=dN, Ei⪰0E_i\succeq0Ei​⪰0 for every iii, and ∑iEi=IH\sum_iE_i=I_H∑i​Ei​=IH​ imply

F(O,E)=1d2∑iRe⁡tr⁡(EiLOσiLO†);F(O,E)=\frac1{d^2}\sum_i \operatorname{Re}\operatorname{tr}(E_iL_O\sigma_iL_O^\dagger);F(O,E)=d21​i∑​Retr(Ei​LO​σi​LO†​);

that Xi⪰0X_i\succeq0Xi​⪰0 for every iii and ∑iXi=IH\sum_iX_i=I_H∑i​Xi​=IH​; and that

F(IP,X)=1d2∑iRe⁡tr⁡(KσiKσi).F(I_P,X)=\frac1{d^2}\sum_i \operatorname{Re}\operatorname{tr}(K\sigma_iK\sigma_i).F(IP​,X)=d21​i∑​Retr(Kσi​Kσi​).
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