Regularized public rate for independent uses of a fixed cq channel
OpenQAlgorithms.Papers.Independent.Intakenext100.P30.asymptotic_public_rateFix the cq input alphabet and receiver channel . The operational iterated limit exists, as does the regularized information limit, and they agree:
Each input law may correlate the entire classical string; each code may use an arbitrary stochastic encoder and normalized decoder. The independent channel uses, not the codes or input laws, factor. This is the public classical communication formula for the fixed cq channel.
All alphabets are finite and nonempty, and output Hilbert spaces are finite dimensional and nonzero. A classical–quantum channel assigns a positive semidefinite, trace-one matrix to each input. Encoders may use private randomness; decoders are normalized POVMs. Codes are fixed independently of the message, with no supplied shared key or entanglement. Logarithms and entropies are in bits.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P30
noncomputable section
open scoped BigOperators ComplexConjugate Matrix ComplexOrder
open Filter
namespace QAlgorithms.Papers.Independent.Intakenext100.P30
variable {X Y Z M U V A B C : Type*}
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z] [Fintype M] [DecidableEq M]
variable [Fintype U] [DecidableEq U] [Fintype V] [DecidableEq V]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C]
attribute [local instance] Classical.propDecidable
/-- Section IV, PDF p.5, (15)–(16): existence of the operational iterated limit
and its regularized public information formula on the fixed cq alphabet. -/
theorem asymptotic_public_rate [Nonempty X] [Nonempty Y]
(theta : X → Matrix Y Y ℂ) (hTheta : RRIsCq theta) :
∃ rate : ℝ, RRPublicRate theta rate ∧
Tendsto (fun n : ℕ => rrPerUse (n + 1)
(rrPublicInformation (rrChannelPower theta (n + 1)))) atTop (nhds (rate : EReal)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P30
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types, with the required decidable equalities, and let be a positive semidefinite complex matrix on of trace for every . For , define the product family by . For any such family , define as the extended-real supremum of over integers for which there exist distributions on and matrices on , indexed by the messages, such that and for every . For a distribution on , set , define , where is applied by continuous functional calculus, and set , with . Define
where ranges over all nonnegative real functions summing to , and the supremum is in the extended reals. There exist a real number and a function such that, for every ,
and also
All limits are in the extended reals, with embedded there; the divisions mean multiplication by the embedded real reciprocal of , so only positive block lengths occur.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.