Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Multiple-access Choi teleportation simulation

Proved
QAlgorithms.Papers.Independent.Support50.P49.multipleAccess_choi_teleportation

by Goku · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

There is any positive finite number of senders and one receiver.

Let there be finitely many senders and receivers, with positive finite transmitted input dimensions did_idi​ and output dimensions eje_jej​; dimension one is allowed. Let E\mathcal EE be a completely positive trace-preserving channel on the joint input, allowing entanglement between senders. For every tuple ooo of input Weyl labels, assume there are separate output unitaries Vo,jV_{o,j}Vo,j​, fixed independently of the unknown input, satisfying

E(UoρUo†)=VoE(ρ)Vo†,Uo=⨂iUoi,Vo=⨂jVo,j\mathcal E(U_o\rho U_o^\dagger)=V_o\mathcal E(\rho)V_o^\dagger, \qquad U_o=\bigotimes_i U_{o_i},\quad V_o=\bigotimes_jV_{o,j}E(Uo​ρUo†​)=Vo​E(ρ)Vo†​,Uo​=i⨂​Uoi​​,Vo​=j⨂​Vo,j​

for every normalized input ρ\rhoρ. Construct ρE\rho_{\mathcal E}ρE​ by sending one half of an independent normalized maximally entangled pair from every sender through E\mathcal EE, leaving its other half with that sender. There is a fixed table of the local corrections such that the explicit teleportation protocol T\mathcal TT has complete local Bell instruments, is trace preserving after averaging their outcomes, and satisfies

(id⁡R⊗T)(X⊗ρE)=(id⁡R⊗E)(X).(\operatorname{id}_R\otimes\mathcal T)(X\otimes\rho_{\mathcal E}) =(\operatorname{id}_R\otimes\mathcal E)(X).(idR​⊗T)(X⊗ρE​)=(idR​⊗E)(X).

Here each sender measures its own input and resource half, broadcasts the outcome, and each receiver applies its own inverse correction; tensor factors in the displayed equation are regrouped accordingly. The equality holds for every reference system RRR and input operator XXX, hence in particular every normal density operator entangled with an arbitrary reference. No product-input or finite reference dimension restriction is imposed.

This realizes the physical channel by LOCC using its normalized Choi resource, the simulation needed for teleportation stretching.

Formalization Note The finite transmitted factors permit a blockwise formula for arbitrary reference matrix kernels. Equality on all kernels is the linear-map formulation of reference-preserving channel equality, not an assignment of probabilities to unnormalized states. The local Bell bras and product inverse corrections are body-defined; their completeness is concluded, never assumed.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P49
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P49

open scoped Matrix ComplexConjugate

open QAlgorithms.Papers.Independent.Information100.P75 (Register)

open QAlgorithms.Papers.Independent.Information100.P56 (normalizedChoi)

open QAlgorithms.Papers.Independent.Claimed50.P43 (finiteWeyl)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.8–9, Eqs.(53)–(54), Fig.6: arbitrary positive M senders.
The channel is simulated by the explicit sender-local Bell instruments and
receiver-local inverse corrections. The equality on every reference kernel
states equality of the linear maps, hence also includes all normalized inputs
entangled with arbitrary references. The resource is the computed Choi state;
no shared resource is granted to the original channel protocol. -/
theorem multipleAccess_choi_teleportation
    {m k : ℕ} (hm : 0 < m) (hk : k = 1)
    (d : Fin m → ℕ) (e : Fin k → ℕ)
    (hd : ∀ i, 0 < d i) (he : ∀ j, 0 < e j)
    (E : Superop (Register d) (Register e)) (hE : IsChannel E)
    (hcov : ProductTeleportationCovariant hd E) :
    ∃ V : BellOutcome d → (j : Fin k) → Matrix.unitaryGroup (Fin (e j)) ℂ,
      CorrectionCovariance hd E V ∧
      IsDensityMatrix (normalizedChoi E) ∧
      (∀ i : Fin m, IsKrausFamily (fun o : Fin (d i) × Fin (d i) => bellBra (d i) (hd i) o)) ∧
      IsKrausFamily (simulationKraus hd V) ∧
      ∀ (R : Type) (X : Matrix (R × Register d) (R × Register d) ℂ),
        idTensorSuperop (R := R) (teleportationLOCC hd V) (attachResource X (normalizedChoi E)) =
          idTensorSuperop (R := R) E X := by sorry

end QAlgorithms.Papers.Independent.Support50.P49

end
Source
General bounds for sender-receiver capacities in multipoint quantum communications, arXiv:1603.07262v2, PDF p. 9, §IV, Eqs.(53)–(54) and Fig.6: multiple-access teleportation simulation
Read-back

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

Let m,km,km,k be natural numbers with m>0m>0m>0 and k=1k=1k=1, let every input dimension did_idi​ and output dimension eje_jej​ be positive, and put Hd=∏i<m{0,…,di−1}H_d=\prod_{i<m}\{0,\ldots,d_i-1\}Hd​=∏i<m​{0,…,di​−1}, He=∏j<k{0,…,ej−1}H_e=\prod_{j<k}\{0,\ldots,e_j-1\}He​=∏j<k​{0,…,ej​−1}, and D=∣Hd∣=∏i<mdiD=|H_d|=\prod_{i<m}d_iD=∣Hd​∣=∏i<m​di​. Suppose E\mathcal EE has a finite Kraus representation E(Z)=∑ℓAℓZAℓ†\mathcal E(Z)=\sum_\ell A_\ell ZA_\ell^\daggerE(Z)=∑ℓ​Aℓ​ZAℓ†​ on all matrices, with ∑ℓAℓ†Aℓ=I\sum_\ell A_\ell^\dagger A_\ell=I∑ℓ​Aℓ†​Aℓ​=I, and suppose there exists a family of output unitaries implementing covariance under every product input correction on density matrices. Then there exists a family of unitaries Vo,jV_{o,j}Vo,j​, indexed by outcomes o=((ai,bi))i<mo=((a_i,b_i))_{i<m}o=((ai​,bi​))i<m​ with ai,bi<dia_i,b_i<d_iai​,bi​<di​ and by j<kj<kj<k, with the following properties. Set Co(x,y)=∏iWai,bi(di)(xi,yi)C_o(x,y)=\prod_iW^{(d_i)}_{a_i,b_i}(x_i,y_i)Co​(x,y)=∏i​Wai​,bi​(di​)​(xi​,yi​), Do(b,c)=∏j(Vo,j)bj,cjD_o(b,c)=\prod_j(V_{o,j})_{b_j,c_j}Do​(b,c)=∏j​(Vo,j​)bj​,cj​​, and

J(x,b),(y,c)=E(∣x⟩⟨y∣)b,cD.J_{(x,b),(y,c)}=\frac{\mathcal E(|x\rangle\langle y|)_{b,c}}{D}.J(x,b),(y,c)​=DE(∣x⟩⟨y∣)b,c​​.

For every positive semidefinite ρ\rhoρ of trace 111, E(CoρCo†)=DoE(ρ)Do†\mathcal E(C_o\rho C_o^\dagger)=D_o\mathcal E(\rho)D_o^\daggerE(Co​ρCo†​)=Do​E(ρ)Do†​, and JJJ is positive semidefinite with trace 111. For each i<mi<mi<m, the one-row matrices Ba,b(i)(0,(u,v))=Wa,b(di)(v,u)/diB^{(i)}_{a,b}(0,(u,v))=W^{(d_i)}_{a,b}(v,u)/\sqrt{d_i}Ba,b(i)​(0,(u,v))=Wa,b(di​)​(v,u)/di​​ satisfy ∑a,b(Ba,b(i))†Ba,b(i)=I\sum_{a,b}(B^{(i)}_{a,b})^\dagger B^{(i)}_{a,b}=I∑a,b​(Ba,b(i)​)†Ba,b(i)​=I, and

Ko(b,((u,v),c))=(∏iBai,bi(i)(0,(ui,vi)))Do(c,b)‾K_o\bigl(b,((u,v),c)\bigr) =\left(\prod_i B^{(i)}_{a_i,b_i}(0,(u_i,v_i))\right)\overline{D_o(c,b)}Ko​(b,((u,v),c))=(i∏​Bai​,bi​(i)​(0,(ui​,vi​)))Do​(c,b)​

satisfies ∑oKo†Ko=I\sum_oK_o^\dagger K_o=I∑o​Ko†​Ko​=I. Here Wa,b(s)(u,v)W^{(s)}_{a,b}(u,v)Wa,b(s)​(u,v) equals exp⁡(2πi bv/s)\exp(2\pi\mathrm{i}\,bv/s)exp(2πibv/s) when u≡v+a(mods)u\equiv v+a\pmod su≡v+a(mods), and 000 otherwise. Moreover, for every type RRR, with no finiteness or nonemptiness assumption, and every arbitrary complex matrix XXX on R×HdR\times H_dR×Hd​, writing Xx,x′rs=X(r,x),(s,x′)X^{rs}_{x,x'}=X_{(r,x),(s,x')}Xx,x′rs​=X(r,x),(s,x′)​ and Z((x,y),b),((x′,y′),b′)rs=X(r,x),(s,x′)J(y,b),(y′,b′)Z^{rs}_{((x,y),b),((x',y'),b')}=X_{(r,x),(s,x')}J_{(y,b),(y',b')}Z((x,y),b),((x′,y′),b′)rs​=X(r,x),(s,x′)​J(y,b),(y′,b′)​, one has

∑oKoZrsKo†=E(Xrs)for every r,s∈R.\sum_oK_o Z^{rs}K_o^\dagger=\mathcal E(X^{rs}) \quad\text{for every }r,s\in R.o∑​Ko​ZrsKo†​=E(Xrs)for every r,s∈R.

The matrix XXX need not be positive, Hermitian, or normalized, and any component dimension may equal 111.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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