§II.C: small conjugate antidegradable channels are EB
OpenQAlgorithms.Papers.Independent.Support50.P01.lowDimension_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 is conjugate antidegradable and , then
The bound concerns channel input and output dimensions. The conclusion quantifies over all finite references.
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: the dimension bound concerns the input and output, not arbitrary references. -/
theorem lowDimension_entanglementBreaking (ha : 0<a) (hb : 0<b) (he : 0<e)
(U : Matrix (Fin b × Fin e) (Fin a) ℂ) (hU : ConjugateAntidegradable U)
(hdim : a*b ≤ 6) : EntanglementBreaking ha hb (receiverChannel 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 all positive natural numbers with , let be a complex matrix satisfying . Suppose there exists a map , expressible as a finite sum with , such that
for every complex matrix on . Then, for every unit vector , applying blockwise to the second register of gives
for some natural number , nonnegative real weights summing to , and positive semidefinite trace-one matrices on and on . The weight condition rules out an empty decomposition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.