Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

B.5: nonuniqueness of complementary degraders

Proved
QAlgorithms.Papers.Independent.Gap20.P19.depolarizingAntidegraderNonunique

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 −1/3<λ<2/3-1/3<\lambda<2/3−1/3<λ<2/3 and put a0=(1+3λ)/4a_0=\sqrt{(1+3\lambda)/4}a0​=(1+3λ)/4​ and a1=a2=a3=(1−λ)/4a_1=a_2=a_3=\sqrt{(1-\lambda)/4}a1​=a2​=a3​=(1−λ)/4​. Fix the dilation of PaP_aPa​ given by the four Kraus operators akσka_k\sigma_kak​σk​, with complement PaCP_a^CPaC​. There exist two distinct CPTP maps D1,D2:M4→M2D_1,D_2:M_4\to M_2D1​,D2​:M4​→M2​ such that

D1∘PaC=Pa=D2∘PaC.D_1\circ P_a^C=P_a=D_2\circ P_a^C.D1​∘PaC​=Pa​=D2​∘PaC​.

Distinctness is on the same full complementary operator space. No uniqueness claim is made at either endpoint.

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: distinct CPTP antidegraders on the SAME
fixed complementary output for -1/3<lam<2/3. No endpoint uniqueness is asserted. -/
theorem depolarizingAntidegraderNonunique (lam : ℝ)
    (hlo : -1/3 < lam) (hhi : lam < 2/3) :
    let a := depolarizingAmplitudes lam
    let U := indexedKrausDilation (pauliKraus a)
    ∃ D1 D2 : Superop (Fin 4) Bool, IsChannel D1 ∧ IsChannel D2 ∧ D1 ≠ D2 ∧
      (∀ rho, D1 (complementaryChannel U rho) = qubitPauliMap a rho) ∧
      (∀ rho, D2 (complementaryChannel U rho) = qubitPauliMap a rho) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 35, B.5: nonuniqueness of complementary degraders
Read-back

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

For every real number λ\lambdaλ with −1/3<λ<2/3-1/3<\lambda<2/3−1/3<λ<2/3, set a0=(1+3λ)/4a_0=\sqrt{(1+3\lambda)/4}a0​=(1+3λ)/4​ and a1=a2=a3=(1−λ)/4a_1=a_2=a_3=\sqrt{(1-\lambda)/4}a1​=a2​=a3​=(1−λ)/4​. Let σ0=I,σ1=X,σ2=Y,σ3=Z\sigma_0=I,\sigma_1=X,\sigma_2=Y,\sigma_3=Zσ0​=I,σ1​=X,σ2​=Y,σ3​=Z be the standard Pauli matrices, define Φa(ρ)=∑j=03aj2σjρσj†\Phi_a(\rho)=\sum_{j=0}^{3}a_j^2\sigma_j\rho\sigma_j^\daggerΦa​(ρ)=∑j=03​aj2​σj​ρσj†​, and define U:C2→C2×4U:\mathbb C^2\to\mathbb C^{2\times4}U:C2→C2×4 by U((b,j),c)=aj(σj)b,cU((b,j),c)=a_j(\sigma_j)_{b,c}U((b,j),c)=aj​(σj​)b,c​. There exist two distinct channels D1,D2D_1,D_2D1​,D2​ from complex 4×44\times44×4 matrices to complex 2×22\times22×2 matrices such that, for every complex 2×22\times22×2 matrix ρ\rhoρ,

D1(CU(ρ))=Φa(ρ),D2(CU(ρ))=Φa(ρ),where(CU(ρ))j,k=Tr⁡ ⁣(ajσjρ(akσk)†).D_1(C_U(\rho))=\Phi_a(\rho), \qquad D_2(C_U(\rho))=\Phi_a(\rho), \quad\text{where}\quad (C_U(\rho))_{j,k}=\operatorname{Tr}\!\left(a_j\sigma_j\rho(a_k\sigma_k)^\dagger\right).D1​(CU​(ρ))=Φa​(ρ),D2​(CU​(ρ))=Φa​(ρ),where(CU​(ρ))j,k​=Tr(aj​σj​ρ(ak​σk​)†).

Each channel is required to admit a finite Kraus representation Di(r)=∑lKi,lrKi,l†D_i(r)=\sum_lK_{i,l}rK_{i,l}^\daggerDi​(r)=∑l​Ki,l​rKi,l†​ with ∑lKi,l†Ki,l=I4\sum_lK_{i,l}^\dagger K_{i,l}=I_4∑l​Ki,l†​Ki,l​=I4​, and distinctness means inequality as maps on all 4×44\times44×4 matrices.

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