Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5

Open
QAlgorithms.Papers.Independent.Gap20.P19.rankTwoQubitClassification

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.

Write Φ(u,v)(ρ)=A+ρA+†+A−ρA−†\Phi(u,v)(\rho)=A_+\rho A_+^\dagger+A_-\rho A_-^\daggerΦ(u,v)(ρ)=A+​ρA+†​+A−​ρA−†​, where A+=diag⁡(cos⁡((v−u)/2),cos⁡((u+v)/2))A_+=\operatorname{diag}(\cos((v-u)/2),\cos((u+v)/2))A+​=diag(cos((v−u)/2),cos((u+v)/2)) and A−=(0sin⁡((u+v)/2)sin⁡((v−u)/2)0)A_-=\begin{pmatrix}0&\sin((u+v)/2)\\\sin((v-u)/2)&0\end{pmatrix}A−​=(0sin((v−u)/2)​sin((u+v)/2)0​). These normalized operators give the Bloch map (85); they correct the transposition in printed (39).

For a qubit channel Ψ\PsiΨ with r(Ψ)=2r(\Psi)=2r(Ψ)=2,

Ψ is degradable  ⟺  ∃u,v∈R: ∣sin⁡v∣≤∣cos⁡u∣ and Ψ≃Φ(u,v),\Psi\text{ is degradable}\iff\exists u,v\in\mathbb R:\ |\sin v|\le|\cos u|\ \text{and }\Psi\simeq\Phi(u,v),Ψ is degradable⟺∃u,v∈R: ∣sinv∣≤∣cosu∣ and Ψ≃Φ(u,v),

where ≃\simeq≃ means independent unitary conjugations on input and output. Moreover, every Φ(u,v)\Phi(u,v)Φ(u,v) with ∣sin⁡v∣≥∣cos⁡u∣|\sin v|\ge|\cos u|∣sinv∣≥∣cosu∣ is antidegradable.

This gives the rank-two classification, including the equality boundary.

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 5, PDF p.14, with (39) corrected to the CPTP map (85).
Rank two is explicit; the antidegradability clause includes equality. -/
theorem rankTwoQubitClassification (Phi : Superop Bool Bool)
    (hPhi : IsChannel Phi) (hrank : (choi Phi).rank = 2) :
    ((∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = Phi ∧ IsDegradable witness) ↔ ∃ u v : ℝ, |Real.sin v| ≤ |Real.cos u| ∧
      RectangularUnitaryConjugate Phi (rankTwoQubitMap u v)) ∧
    (∀ u v : ℝ, |Real.cos u| ≤ |Real.sin v| → (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (rankTwoQubitMap u v) ∧ IsAntidegradable witness)) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

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

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

Let Φ\PhiΦ be a map on complex matrices indexed by Bool={0,1}\mathrm{Bool}=\{0,1\}Bool={0,1}, 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 assume its Choi matrix has rank 222; here the Choi matrix has entries JΦ((i,b),(j,c))=Φ(∣i⟩⟨j∣)bcJ_\Phi((i,b),(j,c))=\Phi(|i\rangle\langle j|)_{bc}JΦ​((i,b),(j,c))=Φ(∣i⟩⟨j∣)bc​. For real u,vu,vu,v, define Nu,v(X)=K0XK0†+K1XK1†\mathcal N_{u,v}(X)=K_0XK_0^\dagger+K_1XK_1^\daggerNu,v​(X)=K0​XK0†​+K1​XK1†​, where, in the order 0,10,10,1,

K0=(cos⁡((v−u)/2)00cos⁡((u+v)/2)),K1=(0sin⁡((u+v)/2)sin⁡((v−u)/2)0).K_0=\begin{pmatrix}\cos((v-u)/2)&0\\0&\cos((u+v)/2)\end{pmatrix}, \qquad K_1=\begin{pmatrix}0&\sin((u+v)/2)\\\sin((v-u)/2)&0\end{pmatrix}.K0​=(cos((v−u)/2)0​0cos((u+v)/2)​),K1​=(0sin((v−u)/2)​sin((u+v)/2)0​).

The statement asserts both of the following: 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 receiver to the environment such that Tr⁡e(WXW†)=Φ(X)\operatorname{Tr}_e(WXW^\dagger)=\Phi(X)Tre​(WXW†)=Φ(X) and Tr⁡2(WXW†)=D(Φ(X))\operatorname{Tr}_2(WXW^\dagger)=D(\Phi(X))Tr2​(WXW†)=D(Φ(X)) for every matrix XXX, if and only if there exist real u,vu,vu,v and qubit unitaries P,QP,QP,Q such that ∣sin⁡v∣≤∣cos⁡u∣|\sin v|\le|\cos u|∣sinv∣≤∣cosu∣ and Φ(X)=QNu,v(PXP†)Q†\Phi(X)=Q\mathcal N_{u,v}(PXP^\dagger)Q^\daggerΦ(X)=QNu,v​(PXP†)Q† for every XXX; and, for every real u,vu,vu,v satisfying ∣cos⁡u∣≤∣sin⁡v∣|\cos u|\le|\sin v|∣cosu∣≤∣sinv∣, there exist a natural number eee, an isometry WWW with receiver map Nu,v\mathcal N_{u,v}Nu,v​, and a finite Kraus channel DDD from the environment to the receiver satisfying Tr⁡e(WXW†)=D(Tr⁡2(WXW†))\operatorname{Tr}_e(WXW^\dagger)=D(\operatorname{Tr}_2(WXW^\dagger))Tre​(WXW†)=D(Tr2​(WXW†)) for every XXX. A finite Kraus channel means a map Y↦∑jLjYLj†Y\mapsto\sum_jL_jYL_j^\daggerY↦∑j​Lj​YLj†​ with ∑jLj†Lj=I\sum_jL_j^\dagger L_j=I∑j​Lj†​Lj​=I. Both inequalities are non-strict, and neither conclusion requires its witnessing dilation to be minimal.

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