Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§II.C: conjugate degradable qubit channels have EB complements

Open
QAlgorithms.Papers.Independent.Support50.P01.qubit_complement_entanglementBreaking

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let A=CaA=\mathbb C^aA=Ca, B=CbB=\mathbb C^bB=Cb, and E=CeE=\mathbb C^eE=Ce have positive finite dimensions and fixed orthonormal bases. Fix an isometry U:A→B⊗EU:A\to B\otimes EU:A→B⊗E and define the channel N(X)=Tr⁡E(UXU†)\mathcal N(X)=\operatorname{Tr}_E(UXU^\dagger)N(X)=TrE​(UXU†) and its genuine complement Nc(X)=Tr⁡B(UXU†)\mathcal N^c(X)=\operatorname{Tr}_B(UXU^\dagger)Nc(X)=TrB​(UXU†). Density operators are positive semidefinite with trace one, and all entropies use base-two logarithms with 0log⁡0=00\log 0=00log0=0. Write Ic(N,ρ)=H(N(ρ))−H(Nc(ρ))I_c(\mathcal N,\rho)=H(\mathcal N(\rho))-H(\mathcal N^c(\rho))Ic​(N,ρ)=H(N(ρ))−H(Nc(ρ)), Q(1)(N)=sup⁡ρIc(N,ρ)Q^{(1)}(\mathcal N)=\sup_\rho I_c(\mathcal N,\rho)Q(1)(N)=supρ​Ic​(N,ρ), and Q(N)=sup⁡n≥1Q(1)(N⊗n)/nQ(\mathcal N)=\sup_{n\ge1}Q^{(1)}(\mathcal N^{\otimes n})/nQ(N)=supn≥1​Q(1)(N⊗n)/n, with arbitrary entangled block inputs. Conjugate degradability means one CPTP map DDD satisfies DN(X)=(Nc(X))TD\mathcal N(X)=(\mathcal N^c(X))^TDN(X)=(Nc(X))T for every operator XXX; conjugate antidegradability reverses the receiver and environment in this identity. If a=b=2a=b=2a=b=2 and N\mathcal NN is conjugate degradable, then

Nc is entanglement breaking,N is ordinarily degradable.\mathcal N^c\ \text{is entanglement breaking},\qquad \mathcal N\ \text{is ordinarily degradable}.Nc is entanglement breaking,N is ordinarily degradable.

The Choi-rank bound is not an added hypothesis, and the conclusion is invariant under padding the chosen environment.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P01

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

open QAlgorithms.Papers.Independent.Information100.P67
  (receiverChannel complementaryChannel IsDegradable dilationPower maximumCoherentInformation)

open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)

open QAlgorithms.Papers.Independent.Information100.P08 (maximallyMixed)

open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)

open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

variable {a b e c : ℕ}

/-- PDF p.5: qubit-to-qubit conjugate degradable channels have EB complements.
No Choi-rank bound is assumed in place of the source's conclusion. -/
theorem qubit_complement_entanglementBreaking {e : ℕ} (he : 0<e)
    (U : Matrix (Fin 2 × Fin e) (Fin 2) ℂ) (hU : ConjugateDegradable U) :
    EntanglementBreaking (by decide) he (complementaryChannel U) ∧ IsDegradable U := by sorry

end QAlgorithms.Papers.Independent.Support50.P01

end
Source
Conjugate Degradability and the Quantum Capacity of Cloning Channels, arXiv:0909.3297v1, PDF p. 5, §II.C: conjugate degradable qubit channels have EB complements
Read-back

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

For every positive natural number eee and every complex matrix U:C2→C2⊗CeU:\mathbb C^2\to\mathbb C^2\otimes\mathbb C^eU:C2→C2⊗Ce, suppose U†U=I2U^\dagger U=I_2U†U=I2​ and there exists a finite Kraus channel D:Mat⁡2(C)→Mat⁡e(C)D:\operatorname{Mat}_2(\mathbb C)\to\operatorname{Mat}_e(\mathbb C)D:Mat2​(C)→Mate​(C) such that D(BU(X))=EU(X)TD(B_U(X))=E_U(X)^{\mathsf T}D(BU​(X))=EU​(X)T for every matrix XXX, where BU(X)=Tr⁡e(UXU†)B_U(X)=\operatorname{Tr}_e(UXU^\dagger)BU​(X)=Tre​(UXU†), EU(X)=Tr⁡2(UXU†)E_U(X)=\operatorname{Tr}_2(UXU^\dagger)EU​(X)=Tr2​(UXU†), and a finite Kraus channel has the form ∑jKjXKj†\sum_jK_jXK_j^\dagger∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Then every unit vector ψ∈C2⊗C2\psi\in\mathbb C^2\otimes\mathbb C^2ψ∈C2⊗C2 has

(id⁡2⊗EU)(∣ψ⟩⟨ψ∣)=∑ℓ=0q−1wℓAℓ⊗Bℓ(\operatorname{id}_2\otimes E_U)(|\psi\rangle\langle\psi|) =\sum_{\ell=0}^{q-1}w_\ell A_\ell\otimes B_\ell(id2​⊗EU​)(∣ψ⟩⟨ψ∣)=ℓ=0∑q−1​wℓ​Aℓ​⊗Bℓ​

for some finite qqq, nonnegative weights summing to 111, and positive semidefinite trace-one matrices AℓA_\ellAℓ​ on C2\mathbb C^2C2 and BℓB_\ellBℓ​ on Ce\mathbb C^eCe. Also, U†U=I2U^\dagger U=I_2U†U=I2​ and there exists a finite Kraus channel D0:Mat⁡2(C)→Mat⁡e(C)D_0:\operatorname{Mat}_2(\mathbb C)\to\operatorname{Mat}_e(\mathbb C)D0​:Mat2​(C)→Mate​(C) with EU(X)=D0(BU(X))E_U(X)=D_0(B_U(X))EU​(X)=D0​(BU​(X)) for every matrix XXX.

Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 23, 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