Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

B.4: two-Pauli antidegradability and EB thresholds

Open
QAlgorithms.Papers.Independent.Gap20.P19.twoPauliThreshold

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.

For 0<s≤1/20<s\le1/20<s≤1/2, put a=(1−2s,s,s,0)a=(\sqrt{1-2s},\sqrt s,\sqrt s,0)a=(1−2s​,s​,s​,0) and Ps(ρ)=∑kak2σkρσkP_s(\rho)=\sum_k a_k^2\sigma_k\rho\sigma_kPs​(ρ)=∑k​ak2​σk​ρσk​. Then

Ps is antidegradable  ⟺  16≤s≤12,Ps is EB  ⟺  14≤s≤12.P_s\text{ is antidegradable}\iff\tfrac16\le s\le\tfrac12,\qquad P_s\text{ is EB}\iff\tfrac14\le s\le\tfrac12.Ps​ is antidegradable⟺61​≤s≤21​,Ps​ is EB⟺41​≤s≤21​.

At s=1/6s=1/6s=1/6 the multipliers are (2/3,2/3,1/3)(2/3,2/3,1/3)(2/3,2/3,1/3). Their orbit under coordinate permutations and simultaneous sign changes of two coordinates consists of exactly 12 triples; every corresponding unital diagonal qubit map is an extreme point of the antidegradable channels.

This displays antidegradable channels beyond the EB range.

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.4, PDF p.35: both thresholds, explicit boundary multipliers,
and the 12 extreme antidegradable Pauli maps obtained by the stated symmetries. -/
theorem twoPauliThreshold (s : ℝ) (hs0 : 0 < s) (hs1 : s ≤ 1/2) :
    ((∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (qubitPauliMap (twoPauliAmplitudes s)) ∧ IsAntidegradable witness) ↔ 1/6 ≤ s ∧ s ≤ 1/2) ∧
    (ChannelEB (qubitPauliMap (twoPauliAmplitudes s)) ↔ 1/4 ≤ s ∧ s ≤ 1/2) ∧
    pauliMultipliers (twoPauliAmplitudes (1/6)) = ![2/3,2/3,1/3] ∧
    twoPauliOrbit.Finite ∧ twoPauliOrbit.ncard = 12 ∧
    (∀ lam ∈ twoPauliOrbit, ExtremeIn (fun Phi => ∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = Phi ∧ IsAntidegradable witness) (multiplierChannel lam)) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 35, B.4: two-Pauli antidegradability and EB thresholds
Read-back

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

Let sss be real with 0<s≤1/20<s\le1/20<s≤1/2, and define

Φs(ρ)=(1−2s)ρ+sXρX†+sYρY†.\Phi_s(\rho)=(1-2s)\rho+sX\rho X^\dagger+sY\rho Y^\dagger.Φs​(ρ)=(1−2s)ρ+sXρX†+sYρY†.

Then Φs\Phi_sΦs​ admits a finite-dimensional antidegradable dilation if and only if 1/6≤s≤1/21/6\le s\le1/21/6≤s≤1/2, and it is entanglement breaking if and only if 1/4≤s≤1/21/4\le s\le1/21/4≤s≤1/2. An antidegradable dilation means an isometry W:C2→C2×rW:\mathbb C^2\to\mathbb C^{2\times r}W:C2→C2×r for some natural number rrr, whose receiver map is Φs\Phi_sΦs​, together with a channel taking Tr⁡2(WρW†)\operatorname{Tr}_{2}(W\rho W^\dagger)Tr2​(WρW†) to Φs(ρ)\Phi_s(\rho)Φs​(ρ) for every matrix ρ\rhoρ; channels are finite Kraus maps with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Entanglement breaking means that applying Φs\Phi_sΦs​ to half of every norm-one pure state on a two-dimensional reference and input gives a finite convex combination of tensor products of positive semidefinite trace-one matrices. The Pauli multiplier triple of the amplitudes (1−2s,s,s,0)(\sqrt{1-2s},\sqrt s,\sqrt s,0)(1−2s​,s​,s​,0), namely (1−2s,1−2s,1−4s)(1-2s,1-2s,1-4s)(1−2s,1−2s,1−4s), equals (2/3,2/3,1/3)(2/3,2/3,1/3)(2/3,2/3,1/3) at s=1/6s=1/6s=1/6. The set O\mathcal OO of triples obtained by permuting (2/3,2/3,1/3)(2/3,2/3,1/3)(2/3,2/3,1/3) and multiplying its coordinates by signs in {1,−1}\{1,-1\}{1,−1} whose product is 111 is finite and has cardinality 121212. For every λ∈O\lambda\in\mathcal Oλ∈O, the map

Λλ(ρ)=Tr⁡ρ2I+12∑k=02λkTr⁡(σk+1ρ)σk+1\Lambda_\lambda(\rho)=\frac{\operatorname{Tr}\rho}{2}I+ \frac12\sum_{k=0}^{2}\lambda_k\operatorname{Tr}(\sigma_{k+1}\rho)\sigma_{k+1}Λλ​(ρ)=2Trρ​I+21​k=0∑2​λk​Tr(σk+1​ρ)σk+1​

admits an antidegradable dilation and is extreme among all maps admitting one: whenever such maps N,MN,MN,M and a real number 0<t<10<t<10<t<1 satisfy Λλ(ρ)=tN(ρ)+(1−t)M(ρ)\Lambda_\lambda(\rho)=tN(\rho)+(1-t)M(\rho)Λλ​(ρ)=tN(ρ)+(1−t)M(ρ) for every matrix ρ\rhoρ, both NNN and MMM equal Λλ\Lambda_\lambdaΛλ​.

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