§II.C: conjugate antidegradable channels have zero capacity
OpenQAlgorithms.Papers.Independent.Support50.P01.conjugateAntidegradable_zeroLet , , 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 is conjugate antidegradable, then
This rules out positive unassisted quantum transmission rates.
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 pp.4–5: conjugate antidegradability implies zero quantum capacity. -/
theorem conjugateAntidegradable_zero (ha : 0<a) (hb : 0<b) (he : 0<e)
(U : Matrix (Fin b × Fin e) (Fin a) ℂ) (hU : ConjugateAntidegradable U) :
quantumCapacity (receiverChannel U) = 0 := 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 all positive natural numbers and every complex matrix , suppose and there exists a map of the form , with finitely many satisfying , such that for every matrix . Here , , and is ordinary transpose. Then
where is on , , square roots use continuous functional calculus, and . The tensor power is the map , and the identity extension applies it blockwise on the reference register.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.