Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Standard teleportation realizes the depolarizing channel

Open
QAlgorithms.Papers.Independent.Intakenext100.P18.depolarizing_teleportation

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

prove2quantum

Let d≥1d\ge1d≥1 and 0≤p≤10\le p\le10≤p≤1. Define the noisy singlet ρp=pP++(1−p)I/d2\rho_p=pP_++(1-p)I/d^2ρp​=pP+​+(1−p)I/d2 and the linear depolarizing map Dp(X)=pX+(1−p)Tr⁡(X)I/dD_p(X)=pX+(1-p)\operatorname{Tr}(X)I/dDp​(X)=pX+(1−p)Tr(X)I/d. Let JJJ be the reference-first normalized Choi map and let T0,ρpT_{0,\rho_p}T0,ρp​​ be the channel computed by the complete Bell measurement with its outcome-conditioned Weyl correction, using one resource copy. Then DpD_pDp​ is a channel and

J(Dp)=ρp,Λρp=T0,ρp=Dp.J(D_p)=\rho_p,\qquad \Lambda_{\rho_p}=T_{0,\rho_p}=D_p.J(Dp​)=ρp​,Λρp​​=T0,ρp​​=Dp​.

The fixed plus overlap of ρp\rho_pρp​ equals the entanglement fidelity of DpD_pDp​, and their standard-teleportation and channel Haar-average fidelities agree. This supplies the physical recovery that is special to this channel family.

Formalization Note The accepted depolarizing map uses noise weight, so the source retention parameter ppp is supplied as 1−p1-p1−p. Equality of maps ranges over every operator, including non-unit-trace operators.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P18
Formal statement
noncomputable section

open QAlgorithms MeasureTheory

open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator

namespace QAlgorithms.Papers.Independent.Intakenext100.P18

open QAlgorithms.Papers.Independent.Claimed50.P28 (maximallyEntangledDensity)

open QAlgorithms.Papers.Independent.Support50.P11 (choiState teleportWeyl bellKet)

open QAlgorithms.Papers.Independent.Renew46.P40 (initialJoint)

/-- PDF p.6, (19)--(20): depolarizing channels and noisy singlets are
mathematically and operationally equivalent through the actual Bell protocol. -/
theorem depolarizing_teleportation (d : ℕ) (hd : 0 < d) (p : ℝ)
    (hp : 0 ≤ p) (hp1 : p ≤ 1) :
    IsChannel (retentionChannel d hd p) ∧
    choiState (retentionChannel d hd p) = noisySinglet d hd p ∧
    choiInverse d (noisySinglet d hd p) = retentionChannel d hd p ∧
    standardTeleport d (noisySinglet d hd p) = retentionChannel d hd p ∧
    QuditFidelity.entanglementFidelity d hd (retentionChannel d hd p) =
      effectProb (maximallyEntangledDensity d) (noisySinglet d hd p) ∧
    QuditFidelity.averageFidelity d hd (retentionChannel d hd p) =
      QuditFidelity.averageFidelity d hd (standardTeleport d (noisySinglet d hd p)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P18

end
Source
General teleportation channel, singlet fraction and quasi-distillation, arXiv:quant-ph/9807091v2, PDF p. 6, §III.C, eqs.(19)–(20): depolarizing channel recovered by standard teleportation
Read-back

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

For every positive integer ddd and real p∈[0,1]p\in[0,1]p∈[0,1], define ∣Ωd⟩=d−1/2∑j∣j,j⟩|\Omega_d\rangle=d^{-1/2}\sum_j|j,j\rangle∣Ωd​⟩=d−1/2∑j​∣j,j⟩, Φd=∣Ωd⟩⟨Ωd∣\Phi_d=|\Omega_d\rangle\langle\Omega_d|Φd​=∣Ωd​⟩⟨Ωd​∣, ρp=pΦd+(1−p)Id2/d2\rho_p=p\Phi_d+(1-p)I_{d^2}/d^2ρp​=pΦd​+(1−p)Id2​/d2, and Rp(X)=pX+(1−p)tr⁡(X)Id/d\mathcal R_p(X)=pX+(1-p)\operatorname{tr}(X)I_d/dRp​(X)=pX+(1−p)tr(X)Id​/d. For any matrix map E\mathcal EE, put J(E)(i,a),(j,b)=E(∣i⟩⟨j∣)ab/dJ(\mathcal E)_{(i,a),(j,b)}=\mathcal E(|i\rangle\langle j|)_{ab}/dJ(E)(i,a),(j,b)​=E(∣i⟩⟨j∣)ab​/d, and put Cρ(X)ab=d∑i,jXijρ(i,a),(j,b)\mathcal C_\rho(X)_{ab}=d\sum_{i,j}X_{ij}\rho_{(i,a),(j,b)}Cρ​(X)ab​=d∑i,j​Xij​ρ(i,a),(j,b)​. Define WabW_{ab}Wab​ by (Wab)ij=1i=(j+a) mod de2πibj/d(W_{ab})_{ij}=\mathbf1_{i=(j+a)\bmod d}e^{2\pi\mathrm i bj/d}(Wab​)ij​=1i=(j+a)modd​e2πibj/d, let Πab\Pi_{ab}Πab​ be the outer product of d−1/2∑i,j(Wab)ij∣i,j⟩d^{-1/2}\sum_{i,j}(W_{ab})_{ij}|i,j\rangled−1/2∑i,j​(Wab​)ij​∣i,j⟩ with itself, and define

Tσ(X)=∑a,bWabTr⁡12 ⁣[(Πab⊗Id)(X⊗σ)(Πab⊗Id)†]Wab†.\mathcal T_\sigma(X)=\sum_{a,b}W_{ab}\operatorname{Tr}_{12} \!\left[(\Pi_{ab}\otimes I_d)(X\otimes\sigma)(\Pi_{ab}\otimes I_d)^\dagger\right]W_{ab}^\dagger.Tσ​(X)=a,b∑​Wab​Tr12​[(Πab​⊗Id​)(X⊗σ)(Πab​⊗Id​)†]Wab†​.

Here a channel is a map with a finite Kraus representation ∑ℓKℓXKℓ†\sum_\ell K_\ell X K_\ell^\dagger∑ℓ​Kℓ​XKℓ†​, valid for every XXX, with ∑ℓKℓ†Kℓ=Id\sum_\ell K_\ell^\dagger K_\ell=I_d∑ℓ​Kℓ†​Kℓ​=Id​. Define Fe(E)=Re⁡tr⁡[Φd(id⁡⊗E)(Φd)]F_{\rm e}(\mathcal E)=\operatorname{Re}\operatorname{tr}[\Phi_d(\operatorname{id}\otimes\mathcal E)(\Phi_d)]Fe​(E)=Retr[Φd​(id⊗E)(Φd​)], and define Fav(E)=∫Re⁡tr⁡[PUE(PU)] dUF_{\rm av}(\mathcal E)=\int\operatorname{Re}\operatorname{tr}[P_U\mathcal E(P_U)]\,dUFav​(E)=∫Retr[PU​E(PU​)]dU, where PU=∣U0⟩⟨U0∣P_U=|U0\rangle\langle U0|PU​=∣U0⟩⟨U0∣ and dUdUdU is normalized unitary Haar measure. Then Rp\mathcal R_pRp​ is a channel and

J(Rp)=ρp,Cρp=Rp,Tρp=Rp,Fe(Rp)=Re⁡tr⁡(Φdρp),Fav(Rp)=Fav(Tρp).J(\mathcal R_p)=\rho_p,\qquad \mathcal C_{\rho_p}=\mathcal R_p,\qquad \mathcal T_{\rho_p}=\mathcal R_p,\qquad F_{\rm e}(\mathcal R_p)=\operatorname{Re}\operatorname{tr}(\Phi_d\rho_p),\qquad F_{\rm av}(\mathcal R_p)=F_{\rm av}(\mathcal T_{\rho_p}).J(Rp​)=ρp​,Cρp​​=Rp​,Tρp​​=Rp​,Fe​(Rp​)=Retr(Φd​ρp​),Fav​(Rp​)=Fav​(Tρp​​).

These assertions include d=1d=1d=1 and p=0,1p=0,1p=0,1.

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