Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Bell-diagonal resources yield only Pauli channels

Open
QAlgorithms.Papers.Independent.Intakethird100.P13.bellDiagonal_onlyPauli

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let w0,…,w3≥0w_0,\ldots,w_3\ge0w0​,…,w3​≥0 sum to one and let τ=∑kwk∣Bk⟩⟨Bk∣\tau=\sum_k w_k|B_k\rangle\langle B_k|τ=∑k​wk​∣Bk​⟩⟨Bk​∣, with the Bell ordering (Φ+,Ψ+,Ψ−,Φ−)(\Phi^+,\Psi^+,\Psi^-,\Phi^-)(Φ+,Ψ+,Ψ−,Φ−). For every conditional stochastic law p(l∣k)p(l\mid k)p(l∣k), the branch-averaged Bell-measurement protocol with Pauli corrections simulates a channel EEE for which there is a normalized probability law vvv satisfying

E(ρ)=∑l=03vlσlρσl†for every density matrix ρ.E(\rho)=\sum_{l=0}^3 v_l\sigma_l\rho\sigma_l^\dagger\quad\text{for every density matrix }\rho.E(ρ)=l=0∑3​vl​σl​ρσl†​for every density matrix ρ.

Here (σ0,σ1,σ2,σ3)=(I,X,Y,Z)(\sigma_0,\sigma_1,\sigma_2,\sigma_3)=(I,X,Y,Z)(σ0​,σ1​,σ2​,σ3​)=(I,X,Y,Z). Thus arbitrary classical noise cannot turn a Bell-diagonal resource into a non-Pauli channel.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P13
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakethird100.P13

attribute [local instance] Classical.propDecidable Classical.decEq

/-- arXiv:1706.05384v2 PDF p.6, Theorem 12: all normalized Bell mixtures and
all conditional stochastic channels, without a doubly-stochastic restriction. -/
theorem bellDiagonal_onlyPauli (w : Fin 4 → ℝ) (hw : FourOutcomeLaw w)
    (p : Fin 4 → Fin 4 → ℝ) (hp : ClassicalTeleportationLaw p) :
    IsPauli (noisyTeleport (teleportationBellMixture w) p) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P13

end
Source
Simulation of non-Pauli Channels, arXiv:1706.05384v2, PDF p. 6, Theorem 12
Read-back

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

Let σ0=I2,σ1=X,σ2=Y,σ3=Z\sigma_0=I_2,\sigma_1=X,\sigma_2=Y,\sigma_3=Zσ0​=I2​,σ1​=X,σ2​=Y,σ3​=Z, and define two-qubit vectors by βk(c,a)=2−1/2(σk)ac\beta_k(c,a)=2^{-1/2}(\sigma_k)_{ac}βk​(c,a)=2−1/2(σk​)ac​ for Boolean c,ac,ac,a. For every real vector w=(w0,…,w3)w=(w_0,\ldots,w_3)w=(w0​,…,w3​) with wk≥0w_k\ge0wk​≥0 and ∑kwk=1\sum_kw_k=1∑k​wk​=1, form the matrix τ\tauτ with entries τ(c,a),(d,a′)=∑kwkβk(c,a)βk(d,a′)‾\tau_{(c,a),(d,a')}=\sum_kw_k\beta_k(c,a)\overline{\beta_k(d,a')}τ(c,a),(d,a′)​=∑k​wk​βk​(c,a)βk​(d,a′)​. For every real array pℓkp_{\ell k}pℓk​ with pℓk≥0p_{\ell k}\ge0pℓk​≥0 and ∑ℓpℓk=1\sum_\ell p_{\ell k}=1∑ℓ​pℓk​=1 for each kkk, define

[Kτ,k(R)]bb′=∑c,a,d,a′∈{0,1}βk(c,a)‾Rcdτ(a,b),(a′,b′)βk(d,a′),Tτ,p(R)=∑k,ℓ=03pℓkσℓKτ,k(R)σℓ†.[K_{\tau,k}(R)]_{bb'} =\sum_{c,a,d,a'\in\{0,1\}} \overline{\beta_k(c,a)}R_{cd}\tau_{(a,b),(a',b')}\beta_k(d,a'), \qquad T_{\tau,p}(R)=\sum_{k,\ell=0}^3p_{\ell k}\sigma_\ell K_{\tau,k}(R)\sigma_\ell^\dagger.[Kτ,k​(R)]bb′​=c,a,d,a′∈{0,1}∑​βk​(c,a)​Rcd​τ(a,b),(a′,b′)​βk​(d,a′),Tτ,p​(R)=k,ℓ=0∑3​pℓk​σℓ​Kτ,k​(R)σℓ†​.

There exists a real vector v=(v0,…,v3)v=(v_0,\ldots,v_3)v=(v0​,…,v3​) satisfying vh≥0v_h\ge0vh​≥0 and ∑hvh=1\sum_hv_h=1∑h​vh​=1 such that Tτ,p(R)=∑h=03vhσhRσh†T_{\tau,p}(R)=\sum_{h=0}^3v_h\sigma_hR\sigma_h^\daggerTτ,p​(R)=∑h=03​vh​σh​Rσh†​ for every complex qubit matrix RRR; zero weights are permitted in both www and vvv.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me