Theorem 3: general classical–quantum broadcast capacity
OpenQAlgorithms.Papers.Independent.Gap48.P39.classical_quantum_capacityLet be any finite-dimensional CPTP broadcast channel on positive-dimensional systems. Define as the closed vanishing-error region for a common classical message of rate to both receivers and Alice–Bob entanglement of rate . Alice prepares a unit pure reference/input state for each message; Bob uses a local instrument and Charlie a local measurement. Every message must pass one squared-fidelity test to both correct labels tensor an EPR state of local rank , with no shared resources or side communication. Let contain nonnegative pairs satisfying, for a finite pure ensemble ,
Then ; restricting the union to does not change it. Moreover,
All entropies use base two. Conditional coherent information is computed from the actual channel output and may have negative individual ensemble terms. This is the general regularized capacity characterization, with the one-letter state and boundary closure made explicit.
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 3, PDF pp.7–8,10,14. One-letter (24), both receiver constraints,
source cap, and equality with the CLOSED regularized union (no boundary attainment claim). -/
theorem classical_quantum_capacity [Nonempty A] [Nonempty B] [Nonempty C]
(N : Superop A (B × C)) (hN : IsChannel N) :
closure (quantumInformationRegion N false) ⊆ cqGenerationCapacity N ∧
quantumInformationRegion N false = quantumInformationRegion N true ∧
cqGenerationCapacity N = closure (regularizedQuantumRegion N) := 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 finite, nonempty types with decidable equality, let be a matrix map admitting finitely many Kraus matrices such that for every and . Define , where is applied by continuous functional calculus, and define by
For any such map , let , for , consist of nonnegative pairs for which there are positive integers , nonnegative weights summing to , and unit vectors . Put , , and , where identity extensions apply to each reference-indexed matrix block. Require
and, if , additionally require . Let be the closure of the set of nonnegative pairs with this operational property: for every , all sufficiently large positive admit , , a unit vector for each , an instrument on with Kraus matrices satisfying , and matrices on , , satisfying . Apply to each , retaining its reference register, then apply the instrument and the measurement ; call the resulting matrix . For every , it must satisfy
where , on , has entry between and exactly when , , and , and zero otherwise. All displayed square roots use continuous functional calculus. With these definitions, the theorem asserts the three simultaneous conclusions
Closures are in ; zero rates are allowed and correspond to message or entanglement dimension .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.