Theorem 2: degraded cq outer bound and commuting-Bob capacity
OpenQAlgorithms.Papers.Independent.Gap48.P39.degraded_cq_capacityLet be a finite cq broadcast channel with nonempty alphabet and positive-dimensional outputs. Suppose a CPTP map satisfies for every input. For the closed operational classical region with deterministic encoders and vanishing maximum joint decoding error,
where the union ranges over all finite-dimensional quantum auxiliaries and normalized states ; no auxiliary dimension cap is imposed on this outer bound. If Bob's marginal states commute pairwise, the two-inequality region with classical , , and equals and the three-inequality superposition region. Entropies are in bits. This identifies an exact single-letter capacity using only Bob marginal commutation.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P39
noncomputable section
open scoped BigOperators Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Gap48.P39
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Claimed50.P08 (cqBlocks holevoInfo)
open QAlgorithms.Papers.Independent.Dependency50.P19 (both epr mutualInformation marginalRA marginalRB)
open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity conditionalEntropy groupedChannelPower)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C X T E : Type}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype X] [DecidableEq X]
variable [Fintype T] [DecidableEq T] [Fintype E] [DecidableEq E]
/-- Theorem 2, PDF p.4 (both columns), converse pp.6–7: unbounded quantum T outer
bound, and exact single-letter region when ONLY Bob's marginals commute. -/
theorem degraded_cq_capacity [Nonempty X] [Nonempty B] [Nonempty C] (W : CQChannel X B C)
(hW : Degraded W) :
cqBroadcastCapacity W ⊆ quantumOuterRegion W false ∧
(CommutingBob W → cqBroadcastCapacity W = degradedClassicalRegion W ∧
degradedClassicalRegion W = superpositionRegion W (some (superpositionCap X B C))) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P39
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For nonempty finite types with decidable equality, let assign density matrices on , put and , and assume there is a map from matrices on to matrices on of the form , for some natural number and matrices with , such that for every . Let be the closure of the set of nonnegative triples such that, for every , all sufficiently large positive block lengths admit words , with respective message counts , and positive semidefinite measurement families , , each summing to its respective identity, whose joint success is at least for every message triple; the product output has entries . Write , where is applied by continuous functional calculus, and . First, every is nonnegative and admits a positive integer , a probability distribution , and density matrices on a -dimensional space such that
no total-rate inequality is required in this first conclusion. Second, if for all , then , where consists of nonnegative triples admitting and a joint distribution , with and block diagonal matrices having blocks , satisfying
The set instead allows , requires those same inequalities, and additionally requires , where .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.