Single-letter public rate for classical outputs
OpenQAlgorithms.Papers.Independent.Intakenext100.P30.classical_public_rateSuppose all receiver output states of the fixed cq channel are simultaneously diagonalizable in one orthonormal basis. The operational public iterated limit exists and satisfies
The rate means , with existence asserted. Only reliability is required. This recovers the classical single-letter public formula.
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.
The maximum is attained: there exists a normalized input law whose displayed mutual information equals the operational rate.
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, (18): classical-output single-letter public rate.
The receiver states have a common diagonalizing basis; secrecy is not imposed.
An optimizing input law is a conclusion, retaining the printed maximum. -/
theorem classical_public_rate [Nonempty X] [Nonempty Y]
(theta : X → Matrix Y Y ℂ) (hTheta : RRIsCq theta) (hclassical : RRClassicalOutputs theta) :
∃ rate : ℝ, RRPublicRate theta rate ∧ (rate : EReal) = rrPublicInformation theta ∧
∃ p : RRDistribution X,
rate = vnEntropy (Matrix.diagonal (fun x => (p.prob x : ℂ))) -
rrConditionalEntropy (rrCqState p.prob theta) := 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 nonempty finite types with decidable equality, and let , for , be positive semidefinite matrices on with trace . Suppose there exists a matrix with such that every has all off-diagonal entries zero. For a matrix , write , where and is defined by continuous functional calculus, using the total real logarithm with . For a probability distribution on , define and
For each positive integer and real , define to be the extended-real supremum of over all integers , all probability distributions on for , and all positive semidefinite matrices on summing to , subject to
Then there exists a real number and a function such that, for every , converges to as through positive integers, and converges to the embedded real number as from above. Furthermore,
for some probability distribution on ; the supremum ranges over all nonnegative with , including distributions with zero entries, and singleton and are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.