Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

B.5: depolarizing-channel antidegradability

Proved
QAlgorithms.Papers.Independent.Gap20.P19.depolarizingAntidegradable

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

prove2quantum

All Hilbert spaces are finite dimensional, complex, and nonzero. A channel is completely positive and trace preserving on every operator. Write r(Φ)r(\Phi)r(Φ) for its Choi rank, the minimum pure-environment dimension. Receiver and complementary channels are always obtained from the same isometry.

Let LλL_\lambdaLλ​ be a CPTP depolarizing qubit map fixing III and sending each Pauli matrix to λσk\lambda\sigma_kλσk​. If ∣λ∣≤2/3|\lambda|\le2/3∣λ∣≤2/3, then

Lλ is antidegradable.L_\lambda\text{ is antidegradable}.Lλ​ is antidegradable.

This is the sufficient assertion in B.5; the CPTP hypothesis excludes unphysical negative multipliers.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P19
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap20.P19

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Kronecker

open Filter Topology

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
   maximumCoherentInformation dilationPower)

open QAlgorithms.Papers.Independent.Claimed50.P48
  (MinimalDilation indexedKrausDilation arbitraryVectorComplement superopTensor tensorDilation)

open QAlgorithms.Papers.Independent.Claimed50.P24 (ChannelEB)

open QAlgorithms.Papers.Independent.Information100.P60 (wernerHolevo)

open QAlgorithms.Papers.Independent.Gap48.P36 (finWeyl WeylLabel)

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

open QAlgorithms.Papers.Independent.Information100.P50 (matrixRange)

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C E F R K A2 B2 E2 : Type}

variable [Fintype A] [DecidableEq A] [Nonempty A]

variable [Fintype B] [DecidableEq B] [Nonempty B]

variable [Fintype C] [DecidableEq C] [Nonempty C]

variable [Fintype E] [DecidableEq E] [Nonempty E]

variable [Fintype F] [DecidableEq F] [Nonempty F]

variable [Fintype R] [DecidableEq R] [Nonempty R]

variable [Fintype K] [DecidableEq K]

variable [Fintype A2] [DecidableEq A2] [Nonempty A2]

variable [Fintype B2] [DecidableEq B2] [Nonempty B2]

variable [Fintype E2] [DecidableEq E2] [Nonempty E2]

/-- Appendix B.5, PDF pp.35–36: the stated sufficient range.
CPTP is explicit; |lam|≤2/3 alone admits unphysical negative multipliers. -/
theorem depolarizingAntidegradable (lam : ℝ)
    (hPhi : IsChannel (multiplierChannel ![lam,lam,lam])) (hlam : |lam| ≤ 2/3) :
    (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (multiplierChannel ![lam,lam,lam]) ∧ IsAntidegradable witness) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 35, B.5: depolarizing-channel antidegradability
Read-back

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

Let λ\lambdaλ be real, and define the map on complex 2×22\times22×2 matrices

Λλ(ρ)=Tr⁡ρ2I+λ2∑σ∈{X,Y,Z}Tr⁡(σρ)σ,\Lambda_\lambda(\rho)=\frac{\operatorname{Tr}\rho}{2}I+ \frac{\lambda}{2}\sum_{\sigma\in\{X,Y,Z\}}\operatorname{Tr}(\sigma\rho)\sigma,Λλ​(ρ)=2Trρ​I+2λ​σ∈{X,Y,Z}∑​Tr(σρ)σ,

where X,Y,ZX,Y,ZX,Y,Z are the standard Pauli matrices. Suppose Λλ\Lambda_\lambdaΛλ​ is a channel, meaning it admits a finite Kraus representation with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, and suppose ∣λ∣≤2/3|\lambda|\le2/3∣λ∣≤2/3. Then there exist a natural number rrr, an isometry W:C2→C2×rW:\mathbb C^2\to\mathbb C^{2\times r}W:C2→C2×r, and a channel DDD from matrices on rrr dimensions to matrices on two dimensions such that, for every complex 2×22\times22×2 matrix ρ\rhoρ,

Tr⁡r(WρW†)=Λλ(ρ),D ⁣(Tr⁡2(WρW†))=Λλ(ρ).\operatorname{Tr}_{r}(W\rho W^\dagger)=\Lambda_\lambda(\rho), \qquad D\!\left(\operatorname{Tr}_{2}(W\rho W^\dagger)\right)=\Lambda_\lambda(\rho).Trr​(WρW†)=Λλ​(ρ),D(Tr2​(WρW†))=Λλ​(ρ).

The bound includes ∣λ∣=2/3|\lambda|=2/3∣λ∣=2/3, subject to the channel hypothesis; the environment-size quantifier includes r=0r=0r=0, which cannot support the required isometry.

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

    Confirmed by the moderator at approval.

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