Theorem 1 and its explicit nonregularization limitation (seed paper result)
OpenQAlgorithms.Papers.Independent.Gap48.P39.cq_superpositionLet be a finite-dimensional classical-input quantum broadcast channel with nonempty input alphabet and positive-dimensional outputs . Let be the closure of its operational classical rate region: deterministic input words, independent common/Bob/Charlie messages, separate receiver POVMs, and vanishing maximum joint decoding error. Message counts at blocklength are , and similarly for the private rates. If a nonnegative rate triple and a probability distribution satisfy
then . All information quantities are evaluated in , with base-two entropy. It suffices to use . This is the superposition inner bound, with boundary rates interpreted in the closed operational region.
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 1, PDF p.4, proved pp.5–6: all three inequalities imply membership
in CLOSED capacity, the limiting boundary interpretation after expurgation. -/
theorem cq_superposition [Nonempty X] [Nonempty B] [Nonempty C] (W : CQChannel X B C) :
superpositionRegion W (some (superpositionCap X B C)) ⊆ cqBroadcastCapacity W := 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 and any assignment of density matrices on , the following inclusion holds. Put , , and , with applied by continuous functional calculus. Consider the set of nonnegative triples for which there are an integer and a joint probability distribution on . Define , , and block diagonal matrices and with blocks and , respectively. Require
This entire set is contained in the closure in of the following achievable set: a nonnegative triple belongs to that set when, for every , there exists a positive integer such that every admits words , indexed by , , and , positive semidefinite matrices on summing to the identity over , and positive semidefinite matrices on summing to the identity over , such that every satisfies ; here . Thus the conclusion is membership in this closure, without an assertion that every triple in the first set itself satisfies the achievable-set quantifiers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.