§II-C unnumbered quantum outer bound: degraded message sets
OpenQAlgorithms.Papers.Independent.Gap48.P39.degraded_message_outerLet be any finite cq broadcast channel, with nonempty alphabet and positive-dimensional outputs, and let belong to its closed operational classical capacity region. The third rate is zero: Bob decodes all common information intended for Charlie and his private message. Then a finite quantum auxiliary , a distribution and normalized states exist such that, in ,
Rates are nonnegative and information quantities are in bits. The operational region uses deterministic encoders, separate receiver POVMs and vanishing maximum joint error. No degraded-channel hypothesis or dimension cap on quantum is added. This is the authors' quantum outer bound, not the classical-auxiliary exact-capacity theorem cited as background.
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]
/-- §II-C quantum outer bound for degraded message sets, PDF p.7.
T is quantum, with no finite dimension cap; the channel need not be degraded. -/
theorem degraded_message_outer [Nonempty X] [Nonempty B] [Nonempty C]
(W : CQChannel X B C) (R RB : ℝ) (h : (R, RB, 0) ∈ cqBroadcastCapacity W) :
(R, RB, 0) ∈ quantumOuterRegion W true := 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 be any assignment of density matrices on , and let . Assume lies in the closure of the following set of achievable triples: a nonnegative triple is achievable when, for every , every sufficiently large positive integer admits words with message counts , and positive semidefinite measurement families on and on , each summing to its identity, such that for every message triple, where . Then , and there exist a positive integer , a probability distribution on , and density matrices on a -dimensional space such that, writing , , , and ,
Here , with applied by continuous functional calculus. There is no degrading-map or commutativity hypothesis, and no upper bound on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.