Single-letter private rate for classical outputs
OpenQAlgorithms.Papers.Independent.Intakenext100.P30.classical_private_rateSuppose the receiver output family and the eavesdropper output family are each simultaneously diagonalizable, separately, in fixed orthonormal bases. The private operational iterated limit exists and satisfies
Here is any finite nonempty auxiliary, any law, and any stochastic map, followed by the fixed channel. The operational rate uses the source's messagewise decoding and trace-distance secrecy conditions. This removes regularization for classical outputs while retaining essential stochastic preprocessing.
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 by some finite nonempty auxiliary alphabet, a normalized law on it, and a stochastic preprocessor into . Their private information equals the operational rate; no cardinality cutoff is assumed.
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, (19): classical-output single-letter private rate.
Each marginal is simultaneously diagonalizable separately. Stochastic
preprocessing is optimized, and both operational limits exist. An attaining
finite auxiliary and stochastic preprocessor are conclusions, with no size cutoff. -/
theorem classical_private_rate [Nonempty X] [Nonempty Y] [Nonempty Z]
(thetaY : X → Matrix Y Y ℂ) (thetaZ : X → Matrix Z Z ℂ)
(hY : RRIsCq thetaY) (hZ : RRIsCq thetaZ)
(hclassicalY : RRClassicalOutputs thetaY) (hclassicalZ : RRClassicalOutputs thetaZ) :
∃ rate : ℝ, RRPrivateRate thetaY thetaZ rate ∧
(rate : EReal) = rrPrivateInformation thetaY thetaZ ∧
∃ k : ℕ, ∃ p : RRDistribution (Fin (k + 1)),
∃ enc : Fin (k + 1) → RRDistribution X,
rate = rrConditionalEntropy (rrCqState p.prob (rrPreprocess thetaZ enc)) -
rrConditionalEntropy (rrCqState p.prob (rrPreprocess thetaY enc)) := 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 and , for , be positive semidefinite matrices of trace . Suppose there are matrices satisfying and , such that all and all have zero off-diagonal entries. Write , with applied by continuous functional calculus and the total real logarithm satisfying . For an integer , a probability distribution on , and probability distributions on , put , , and , and define
For each positive integer , define as the extended-real supremum of over integers , probability distributions on , and positive semidefinite decoding matrices on summing to , such that every message satisfies , and there exists one positive semidefinite reference matrix on with trace such that for every message, where
and the -output product is defined by the same entrywise formula; the matrix square root uses continuous functional calculus. Then there exist a real number and a function such that, for every , as through positive integers, and as from above. They also satisfy
for some finite with , some probability distribution on those symbols, and some probability distributions on . The case , zero probabilities, and singleton underlying types are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.