Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8

Open
QAlgorithms.Papers.Independent.Gap20.P19.unitalQubitCriterion

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 Ψ\PsiΨ be a unital qubit channel. Write LλL_\lambdaLλ​ for the linear map fixing III and sending σk\sigma_kσk​ to λkσk\lambda_k\sigma_kλk​σk​. Then Ψ\PsiΨ is antidegradable exactly when it is unitarily equivalent on input and output to some LλL_\lambdaLλ​ with ∣λk∣≤1|\lambda_k|\le1∣λk​∣≤1, both CP inequalities (λi±λj)2≤(1±λk)2(\lambda_i\pm\lambda_j)^2\le(1\pm\lambda_k)^2(λi​±λj​)2≤(1±λk​)2 for distinct indices, and

∑k=13(1−∣λk∣+(1−∣λk∣)2−(∣λi∣−∣λj∣)2)≥2,\sum_{k=1}^3\left(1-|\lambda_k|+\sqrt{(1-|\lambda_k|)^2-(|\lambda_i|-|\lambda_j|)^2}\right)\ge2,k=1∑3​(1−∣λk​∣+(1−∣λk​∣)2−(∣λi​∣−∣λj​∣)2​)≥2,

where i,ji,ji,j are the other two indices in each summand.

Complete positivity remains a separate requirement; the square-root condition alone does not imply it.

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]

/-- Theorem 8, PDF pp.15,37–38. Complete positivity is retained separately
from the square-root inequality, including all unitary changes of basis. -/
theorem unitalQubitCriterion (Phi : Superop Bool Bool)
    (hPhi : IsChannel Phi) (hunital : Phi 1 = 1) :
    (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = Phi ∧ IsAntidegradable witness) ↔ ∃ lam : Fin 3 → ℝ,
      RectangularUnitaryConjugate Phi (multiplierChannel lam) ∧ CPBounds lam ∧
      2 ≤ antiExpression lam := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 15, Theorem 8
Read-back

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

Let Φ\PhiΦ be a qubit map admitting a finite Kraus representation Φ(X)=∑jKjXKj†\Phi(X)=\sum_jK_jXK_j^\daggerΦ(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=I2\sum_jK_j^\dagger K_j=I_2∑j​Kj†​Kj​=I2​, and suppose Φ(I2)=I2\Phi(I_2)=I_2Φ(I2​)=I2​. There exist a natural number eee, an isometry W:C2→C2⊗CeW:\mathbb C^2\to\mathbb C^2\otimes\mathbb C^eW:C2→C2⊗Ce, and a finite Kraus channel DDD from the environment to the receiver such that Tr⁡e(WXW†)=Φ(X)=D(Tr⁡2(WXW†))\operatorname{Tr}_e(WXW^\dagger)=\Phi(X)=D(\operatorname{Tr}_2(WXW^\dagger))Tre​(WXW†)=Φ(X)=D(Tr2​(WXW†)) for every matrix XXX, if and only if there exist real numbers λ0,λ1,λ2\lambda_0,\lambda_1,\lambda_2λ0​,λ1​,λ2​ and qubit unitaries P,QP,QP,Q such that Φ(X)=QΛλ(PXP†)Q†\Phi(X)=Q\Lambda_\lambda(PXP^\dagger)Q^\daggerΦ(X)=QΛλ​(PXP†)Q† for every XXX, where

Λλ(X)=Tr⁡X2I2+12∑j=02λjTr⁡(σjX)σj,\Lambda_\lambda(X)=\frac{\operatorname{Tr}X}{2}I_2+ \frac12\sum_{j=0}^2\lambda_j\operatorname{Tr}(\sigma_jX)\sigma_j,Λλ​(X)=2TrX​I2​+21​j=0∑2​λj​Tr(σj​X)σj​,

with (σ0,σ1,σ2)=(X,Y,Z)(\sigma_0,\sigma_1,\sigma_2)=(X,Y,Z)(σ0​,σ1​,σ2​)=(X,Y,Z), and such that ∣λj∣≤1|\lambda_j|\le1∣λj​∣≤1 for every jjj, (λi+λj)2≤(1+λk)2(\lambda_i+\lambda_j)^2\le(1+\lambda_k)^2(λi​+λj​)2≤(1+λk​)2 and (λi−λj)2≤(1−λk)2(\lambda_i-\lambda_j)^2\le(1-\lambda_k)^2(λi​−λj​)2≤(1−λk​)2 for every triple of pairwise distinct indices i,j,k∈{0,1,2}i,j,k\in\{0,1,2\}i,j,k∈{0,1,2}, and

2≤∑k=02(1−∣λk∣+(1−∣λk∣)2−(∣λk+1∣−∣λk+2∣)2),2\le\sum_{k=0}^2\left(1-|\lambda_k|+ \sqrt{(1-|\lambda_k|)^2-(|\lambda_{k+1}|-|\lambda_{k+2}|)^2}\right),2≤k=0∑2​(1−∣λk​∣+(1−∣λk​∣)2−(∣λk+1​∣−∣λk+2​∣)2​),

where subscripts in this sum are reduced modulo 333. An isometry satisfies W†W=I2W^\dagger W=I_2W†W=I2​, and the channel DDD is a finite sum D(Y)=∑jLjYLj†D(Y)=\sum_jL_jYL_j^\daggerD(Y)=∑j​Lj​YLj†​ with ∑jLj†Lj=Ie\sum_jL_j^\dagger L_j=I_e∑j​Lj†​Lj​=Ie​; all displayed boundary inequalities are non-strict.

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