Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§VI (53)–(56): teleportation-covariance sufficient for exact Choi simulation

Proved
QAlgorithms.Papers.Independent.Support50.P11.covariant_choi_simulation

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

prove2quantum

Let N:A′→B\mathcal N:A'\to BN:A′→B be finite CPTP. Let CCC be a positive finite classical outcome register, M:A′A~′→CM:A'\widetilde A'\to CM:A′A′→C a CPTP classical-output measurement map, and Uc,VcU_c,V_cUc​,Vc​ unitary corrections on A′,BA',BA′,B. Suppose that MMM with corrections UcU_cUc​ teleports every input operator exactly using one normalized Bell state and that, for every ccc and operator XXX,

N(UcXUc†)=VcN(X)Vc†.\mathcal N(U_c XU_c^\dagger)=V_c\mathcal N(X)V_c^\dagger.N(Uc​XUc†​)=Vc​N(X)Vc†​.

Let ν\nuν be the computed normalized Choi state of N\mathcal NN. Applying MMM to the input and Alice's share of ν\nuν, sending ccc forward, and applying VcV_cVc​ on Bob's share gives

Sim⁡M,V,ν(X)=N(X)for every operator X.\operatorname{Sim}_{M,V,\nu}(X)=\mathcal N(X)\qquad\text{for every operator }X.SimM,V,ν​(X)=N(X)for every operator X.

In particular an exact single-copy Choi simulation exists. The given protocol and corrections are fixed before the input; no simulation identity is assumed for ν\nuν.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

namespace QAlgorithms.Papers.Independent.Support50.P11

open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)

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

open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)

open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)

open QAlgorithms.Papers.Independent.Information100.P69 (replacer)

open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

section Statements

variable {I O : Type} [Fintype I] [Nonempty I] [Fintype O] [Nonempty O]

/-- PDF p.10, (53)--(56): the given teleportation measurement and covariant output
corrections construct the simulation on all operators, with one computed Choi state. -/
theorem covariant_choi_simulation
    (N : Superop I O) (hN : IsChannel N) {C : Type*} [Fintype C] [Nonempty C]
    (M : Superop (I × I) C) (hM : IsChannel M) (hclassical : ∀ X, dephasing (M X) = M X)
    (U : C → Matrix.unitaryGroup I ℂ) (V : C → Matrix.unitaryGroup O ℂ)
    (hteleport : ∀ X, resourceSim (choiState (fun Y : Matrix I I ℂ => Y)) M
      (classicalControlledUnitary (fun c => (U c : Matrix I I ℂ))) X = X)
    (hcov : ∀ c X, N (conjSuperop (U c : Matrix I I ℂ) X) =
      conjSuperop (V c : Matrix O O ℂ) (N X)) :
    (∀ X, resourceSim (choiState N) M (classicalControlledUnitary (fun c => (V c : Matrix O O ℂ))) X = N X) ∧
    HasChoiSimulation N := by sorry

end Statements

end QAlgorithms.Papers.Independent.Support50.P11

end
Source
On the power of PPT-preserving and non-signalling codes, arXiv:1406.7142v2, PDF p. 10, §VI (53)–(56): teleportation-covariance sufficient for exact Choi simulation
Read-back

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

Let I,OI,OI,O be finite input and output index types, let N:Mat⁡I(C)→Mat⁡O(C)N:\operatorname{Mat}_I(\mathbb C)\to\operatorname{Mat}_O(\mathbb C)N:MatI​(C)→MatO​(C) be a channel, and let CCC be a finite nonempty type. Let M:Mat⁡I×I→Mat⁡CM:\operatorname{Mat}_{I\times I}\to\operatorname{Mat}_CM:MatI×I​→MatC​ be a channel whose output is diagonal for every input, and let Uc,VcU_c,V_cUc​,Vc​ be unitary matrices on I,OI,OI,O, respectively, for every c∈Cc\in Cc∈C. Channels here have finite Kraus representations with ∑jAj†Aj=1\sum_jA_j^\dagger A_j=1∑j​Aj†​Aj​=1. Define ωT=∣I∣−1JT\omega_T=|I|^{-1}J_TωT​=∣I∣−1JT​, where (JT)(i,o),(j,o′)=[T(Eij)]o,o′(J_T)_{(i,o),(j,o')}=[T(E_{ij})]_{o,o'}(JT​)(i,o),(j,o′)​=[T(Eij​)]o,o′​, and, for a matrix ω\omegaω on I×BI\times BI×B, a map A:Mat⁡I×I→Mat⁡CA:\operatorname{Mat}_{I\times I}\to\operatorname{Mat}_CA:MatI×I​→MatC​, and D:Mat⁡C×B→Mat⁡BD:\operatorname{Mat}_{C\times B}\to\operatorname{Mat}_BD:MatC×B​→MatB​, define Rω,A,D(H)=D(Q)\mathcal R_{\omega,A,D}(H)=D(Q)Rω,A,D​(H)=D(Q) by

Q(c,b),(c′,b′)=[A ⁣((Huvω(a,b),(a′,b′))(u,a),(v,a′))]c,c′.Q_{(c,b),(c',b')} = \left[A\!\left( (H_{uv}\omega_{(a,b),(a',b')})_{(u,a),(v,a')} \right)\right]_{c,c'}.Q(c,b),(c′,b′)​=[A((Huv​ω(a,b),(a′,b′)​)(u,a),(v,a′)​)]c,c′​.

Assume that Rωid,M,DU(H)=H\mathcal R_{\omega_{\mathrm{id}},M,D_U}(H)=HRωid​,M,DU​​(H)=H for every matrix HHH on III, where DU(Q)=∑cUcQ(c,⋅),(c,⋅)Uc†D_U(Q)=\sum_cU_cQ_{(c,\cdot),(c,\cdot)}U_c^\daggerDU​(Q)=∑c​Uc​Q(c,⋅),(c,⋅)​Uc†​, and assume N(UcHUc†)=VcN(H)Vc†N(U_cHU_c^\dagger)=V_cN(H)V_c^\daggerN(Uc​HUc†​)=Vc​N(H)Vc†​ for every c,Hc,Hc,H. Then RωN,M,DV(H)=N(H)\mathcal R_{\omega_N,M,D_V}(H)=N(H)RωN​,M,DV​​(H)=N(H) for every HHH, where DV(Q)=∑cVcQ(c,⋅),(c,⋅)Vc†D_V(Q)=\sum_cV_cQ_{(c,\cdot),(c,\cdot)}V_c^\daggerDV​(Q)=∑c​Vc​Q(c,⋅),(c,⋅)​Vc†​. Furthermore, there exist a positive integer mmm, a channel M0:Mat⁡I×I→Mat⁡mM_0:\operatorname{Mat}_{I\times I}\to\operatorname{Mat}_mM0​:MatI×I​→Matm​ with diagonal output on every input, and a channel D0:Mat⁡m×O→Mat⁡OD_0:\operatorname{Mat}_{m\times O}\to\operatorname{Mat}_OD0​:Matm×O​→MatO​ such that RωN,M0,D0(H)=N(H)\mathcal R_{\omega_N,M_0,D_0}(H)=N(H)RωN​,M0​,D0​​(H)=N(H) for every HHH. No group law or averaging identity for the families Uc,VcU_c,V_cUc​,Vc​ is assumed.

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