Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Probabilistic teleportation and port-coding probability identity

Open
QAlgorithms.Papers.Independent.Intakenext100.P53.teleportation_coding_identity

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.

Use any exact probabilistic protocol with failure outcome 000. Let pip_ipi​ be its reference-singlet branch probability. In the coding experiment Bob sends BkB_kBk​ to Alice, identifying it as CCC, and Alice uses exactly the same resource and POVM; denote its actual outcome probabilities by qi∣kq_{i|k}qi∣k​. Then for every successful label iii,

qi∣k={d2pi,i=k,pi,i≠k,∑k∑i=1Nqi∣k=(N+d2−1)∑ipi.q_{i|k}=\begin{cases}d^2p_i,&i=k,\\p_i,&i\ne k,\end{cases}\qquad \sum_k\sum_{i=1}^Nq_{i|k}=(N+d^2-1)\sum_i p_i.qi∣k​={d2pi​,pi​,​i=k,i=k,​k∑​i=1∑N​qi∣k​=(N+d2−1)i∑​pi​.

No equiprobability or permutation assumption is made. Exactness is expressed by the unnormalized branch equation, so a branch with pi=0p_i=0pi​=0 is included. This is the operational interface used for the success upper bound.

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.4, Eqs.(20)-(22): probabilities in the same resource and measurement,
including zero-probability successful branches. -/
theorem teleportation_coding_identity (d N : ℕ) (hd : 2 ≤ d) (hN : 1 ≤ N)
    (O : Op (Ports d N)) (E : Option (Fin N) → Op (AC d N))
    (hexact : ExactProbabilistic O E) :
    (∀ i k, codingProbability O (E (some i)) k =
      if i = k then (d : ℝ) ^ 2 * pbtBranchProbability O (E (some i))
      else pbtBranchProbability O (E (some i))) ∧
    (∑ k : Fin N, ∑ i : Fin N, codingProbability O (E (some i)) k) =
      ((N : ℝ) + (d : ℝ) ^ 2 - 1) * pbtSuccessProbability O E := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P53

end
Source
Some remarks on port-based teleportation, arXiv:1506.01555v2, PDF p. 4, V Eqs.(20)-(22): probabilistic teleportation/coding probability identity
Read-back

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

For natural numbers 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}, OOO be a complex matrix on PPP, and E∅,EiE_\varnothing,E_iE∅​,Ei​ for i<Ni<Ni<N be complex matrices on HHH. Set

s(a,c)=(−1)ad1{c=d−1−a},Σ=ss†,ΨO(x,y)=∑uOx,u∏js(uj,yj),s(a,c)=\frac{(-1)^a}{\sqrt d}\mathbf1_{\{c=d-1-a\}}, \quad \Sigma=ss^\dagger, \quad \Psi_O(x,y)=\sum_uO_{x,u}\prod_js(u_j,y_j),s(a,c)=d​(−1)a​1{c=d−1−a}​,Σ=ss†,ΨO​(x,y)=u∑​Ox,u​j∏​s(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)‾.(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)}.(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)​.

For each port kkk, insertion of ccc into a complementary assignment rrr is denoted by ins⁡k(c,r)\operatorname{ins}_k(c,r)insk​(c,r); define

(QkBA)(a,c),(b,e)=∑r(BA)(a,ins⁡k(c,r)),(b,ins⁡k(e,r)),(Ck)(x,c),(y,e)=∑rΨO(x,ins⁡k(c,r))ΨO(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_O(x,\operatorname{ins}_k(c,r)) \overline{\Psi_O(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∑​ΨO​(x,insk​(c,r))ΨO​(y,insk​(e,r))​.

Suppose tr⁡(O†O)=dN\operatorname{tr}(O^\dagger O)=d^Ntr(O†O)=dN, every outcome matrix is positive semidefinite, E∅+∑iEi=IHE_\varnothing+\sum_iE_i=I_HE∅​+∑i​Ei​=IH​, and QiBEi=biΣQ_iB_{E_i}=b_i\SigmaQi​BEi​​=bi​Σ for every iii, where bi=Re⁡tr⁡(BEi)b_i=\operatorname{Re}\operatorname{tr}(B_{E_i})bi​=Retr(BEi​​). The theorem asserts both

∀i,k<N,Re⁡tr⁡(EiCk)={d2bi,i=k,bi,i≠k,\forall i,k<N,\qquad \operatorname{Re}\operatorname{tr}(E_iC_k)= \begin{cases} d^2b_i,&i=k,\\ b_i,&i\ne k, \end{cases}∀i,k<N,Retr(Ei​Ck​)={d2bi​,bi​,​i=k,i=k,​

and

∑k=0N−1∑i=0N−1Re⁡tr⁡(EiCk)=(N+d2−1)∑ibi.\sum_{k=0}^{N-1}\sum_{i=0}^{N-1} \operatorname{Re}\operatorname{tr}(E_iC_k) =(N+d^2-1)\sum_i b_i.k=0∑N−1​i=0∑N−1​Retr(Ei​Ck​)=(N+d2−1)i∑​bi​.
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