§II.C: conjugate degradable qubit channels have EB complements
OpenQAlgorithms.Papers.Independent.Support50.P01.qubit_complement_entanglementBreakingLet , , and have positive finite dimensions and fixed orthonormal bases. Fix an isometry and define the channel and its genuine complement . Density operators are positive semidefinite with trace one, and all entropies use base-two logarithms with . Write , , and , with arbitrary entangled block inputs. Conjugate degradability means one CPTP map satisfies for every operator ; conjugate antidegradability reverses the receiver and environment in this identity. If and is conjugate degradable, then
The Choi-rank bound is not an added hypothesis, and the conclusion is invariant under padding the chosen environment.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive natural number and every complex matrix , suppose and there exists a finite Kraus channel such that for every matrix , where , , and a finite Kraus channel has the form with . Then every unit vector has
for some finite , nonnegative weights summing to , and positive semidefinite trace-one matrices on and on . Also, and there exists a finite Kraus channel with for every matrix .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.