Stochastic preprocessing strictly improves the Figure 2 private-information expression
OpenQAlgorithms.Papers.Independent.Intakenext100.P30.stochastic_preprocessing_exampleConsider the classical channel on with deterministic receiver outputs , , and eavesdropper outputs , , with a fair bit. Encode message uniformly as or , and message as . Both conditional encoding laws are normalized and nonnegative. For each message , the receiver output is exactly and Eve's output is the fair distribution, so this transmits one private bit without error. Moreover,
The strict inequality concerns the maximum over the full input simplex, not merely pointwise inequality for each law. This example establishes the need to optimize stochastic preprocessing in the private-information expression.
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
/-- Figure 2 and following paragraph, PDF p.6: the concrete stochastic encoder
transmits a bit perfectly with identical fair Eve outputs, whereas the optimized
unpreprocessed private information is strictly smaller than one bit. No new
operational notion of deterministic-encoding capacity is asserted. -/
theorem stochastic_preprocessing_example :
(∀ message : Bool,
(∑ x : Fin 3, rrExampleEncoder message x = 1) ∧
(∀ x, 0 ≤ rrExampleEncoder message x) ∧
(∑ x : Fin 3, (rrExampleEncoder message x : ℂ) • rrExampleReceiver x) =
Matrix.diagonal (fun y => if y = message then (1 : ℂ) else 0) ∧
(∑ x : Fin 3, (rrExampleEncoder message x : ℂ) • rrExampleEve x) =
Matrix.diagonal (fun _ => (1 / 2 : ℂ))) ∧
rrExampleUnprocessedInformation < (1 : 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
On the input alphabet and Boolean output basis ordered as , define receiver matrices , , and second-output matrices , , . Define encoding weights and . For every Boolean message , these weights satisfy , for every , and
In addition, for every probability vector , let and , and write , where and for applied by continuous functional calculus. The extended-real supremum satisfies
Probability vectors with zero coordinates are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.