Regularized private rate with messagewise secrecy
OpenQAlgorithms.Papers.Independent.Intakenext100.P30.asymptotic_private_rateFix receiver and eavesdropper cq marginals and on the same input alphabet. The operational iterated limit and the regularized information limit exist and agree:
The optimization includes every finite auxiliary , every law on it, and every stochastic map to the full input string. The operational capacity uses messagewise reliability and secrecy relative to one normalized message-independent reference. This is the source's regularized private transmission 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.
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), (17): regularized private rate. The optimization
has no supplied auxiliary-dimension bound. The two limits and their common value
are conclusions; neither Lemma 5 nor a derived entropy bound is assumed. -/
theorem asymptotic_private_rate [Nonempty X] [Nonempty Y] [Nonempty Z]
(thetaY : X → Matrix Y Y ℂ) (thetaZ : X → Matrix Z Z ℂ)
(hY : RRIsCq thetaY) (hZ : RRIsCq thetaZ) :
∃ rate : ℝ, RRPrivateRate thetaY thetaZ rate ∧
Tendsto (fun n : ℕ => rrPerUse (n + 1)
(rrPrivateInformation (rrChannelPower thetaY (n + 1))
(rrChannelPower thetaZ (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 every and be a positive semidefinite complex matrix of trace on and , respectively. Define the product families and . For any pair of families on a common finite input alphabet , let be the extended-real supremum of over integers admitting message distributions on , decoding matrices with , and a single density matrix on the second output space, such that, for every message ,
For each , distribution on its messages, and collection of input distributions , write for , and define
Here , is applied by continuous functional calculus, and , where the partial trace sums diagonal message blocks. All distributions in these definitions are nonnegative and sum to . There exist a real and a function such that, for every ,
and
The suprema, limits, and arithmetic are in the extended reals, with real quantities embedded; the block lengths are always positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.