Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4: complete degradable qubit-output structure (original paper seed)

Open
QAlgorithms.Papers.Independent.Gap20.P19.qubitOutputStructure

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 Φ:MdA→M2\Phi:M_{d_A}\to M_2Φ:MdA​​→M2​ be degradable. Then

r(Φ)≤2,dA≤3.r(\Phi)\le2,\qquad d_A\le3.r(Φ)≤2,dA​≤3.

If dA=3d_A=3dA​=3, independent unitary conjugations on input and output turn Φ\PhiΦ into Q(ρ)=A0ρA0†+A1ρA1†Q(\rho)=A_0\rho A_0^\dagger+A_1\rho A_1^\daggerQ(ρ)=A0​ρA0†​+A1​ρA1†​, where

A0=(10001/20),A1=(01/20001).A_0=\begin{pmatrix}1&0&0\\0&1/\sqrt2&0\end{pmatrix},\qquad A_1=\begin{pmatrix}0&1/\sqrt2&0\\0&0&1\end{pmatrix}.A0​=(10​01/2​​00​),A1​=(00​1/2​0​01​).

The displayed QQQ is both degradable and antidegradable.

This is the precise complete qubit-output result advertised by the paper's abstract; the original seed node is preserved.

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 4, PDF pp.12–14: both dimension bounds, canonical uniqueness,
and both classes for the explicit qutrit-to-qubit channel. -/
theorem qubitOutputStructure [Nonempty A] (Phi : Superop A Bool)
    (hPhi : IsChannel Phi) (hdeg : (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = Phi ∧ IsDegradable witness)) :
    (choi Phi).rank ≤ 2 ∧ Fintype.card A ≤ 3 ∧
    (Fintype.card A = 3 → ∃ e : A ≃ Fin 3,
      RectangularUnitaryConjugate (fun rho => Phi (fun a b => rho (e a) (e b))) qutritCanonical) ∧
    (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = qutritCanonical ∧ IsDegradable witness) ∧ (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = qutritCanonical ∧ IsAntidegradable witness) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 12, Theorem 4: complete degradable qubit-output structure (original paper seed)
Read-back

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

Let AAA be a nonempty finite type with decidable equality and let Φ:Mat⁡A(C)→Mat⁡{false,true}(C)\Phi:\operatorname{Mat}_A(\mathbb C)\to\operatorname{Mat}_{\{\mathrm{false},\mathrm{true}\}}(\mathbb C)Φ:MatA​(C)→Mat{false,true}​(C) be a channel. Here a channel has a finite representation X↦∑ℓKℓXKℓ†X\mapsto\sum_\ell K_\ell XK_\ell^\daggerX↦∑ℓ​Kℓ​XKℓ†​ with ∑ℓKℓ†Kℓ=I\sum_\ell K_\ell^\dagger K_\ell=I∑ℓ​Kℓ†​Kℓ​=I. Suppose there exist e∈Ne\in\mathbb Ne∈N, an isometry V:CA→C2⊗CeV:\mathbb C^A\to\mathbb C^2\otimes\mathbb C^eV:CA→C2⊗Ce, and a channel DDD from the receiver to the environment such that, for every matrix XXX, Tr⁡e(VXV†)=Φ(X)\operatorname{Tr}_e(VXV^\dagger)=\Phi(X)Tre​(VXV†)=Φ(X) and D(Φ(X))=Tr⁡2(VXV†)D(\Phi(X))=\operatorname{Tr}_2(VXV^\dagger)D(Φ(X))=Tr2​(VXV†). Define J(Θ)(a,b),(a′,b′)=Θ(Eaa′)bb′J(\Theta)_{(a,b),(a',b')}=\Theta(E_{aa'})_{bb'}J(Θ)(a,b),(a′,b′)​=Θ(Eaa′​)bb′​, where Eaa′E_{aa'}Eaa′​ is the matrix unit. Then rank⁡J(Φ)≤2\operatorname{rank}J(\Phi)\le2rankJ(Φ)≤2 and ∣A∣≤3|A|\le3∣A∣≤3. If ∣A∣=3|A|=3∣A∣=3, there exist a bijection eA:A→{0,1,2}e_A:A\to\{0,1,2\}eA​:A→{0,1,2} and unitaries UUU on C3\mathbb C^3C3, WWW on C2\mathbb C^2C2, such that, for every 3×33\times33×3 matrix XXX,

Φ ⁣((XeA(a),eA(a′))a,a′∈A)=W Q(UXU†) W†,Q(X)=K0XK0†+K1XK1†,\Phi\!\left((X_{e_A(a),e_A(a')})_{a,a'\in A}\right) =W\,Q(UXU^\dagger)\,W^\dagger, \qquad Q(X)=K_0XK_0^\dagger+K_1XK_1^\dagger,Φ((XeA​(a),eA​(a′)​)a,a′∈A​)=WQ(UXU†)W†,Q(X)=K0​XK0†​+K1​XK1†​,

where

K0=(10001/20),K1=(01/20001).K_0=\begin{pmatrix}1&0&0\\0&1/\sqrt2&0\end{pmatrix}, \qquad K_1=\begin{pmatrix}0&1/\sqrt2&0\\0&0&1\end{pmatrix}.K0​=(10​01/2​​00​),K1​=(00​1/2​0​01​).

Furthermore, independently of whether ∣A∣=3|A|=3∣A∣=3, QQQ has a finite isometric dilation whose environment output is obtained from its receiver output by a channel, and QQQ also has a finite isometric dilation whose receiver output is obtained from its environment output by a channel; these two dilations need not be the same.

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