Subexponentially vanishing weak-locking security error
OpenQAlgorithms.Papers.Independent.Intakenext100.P63.schur_subexponential_securityLet be a complement of a cq-channel, defined by a normalized fixed Stinespring isometry on nonzero finite-dimensional spaces with . Choose any input prior , and let be the minimum output entropy of its associated POVM restricted to the average state's support. Let be any positive schedule with
There is a sequence of uniform-message codes with independent uniform preshared keys whose key bits per use tend to zero, whose limiting inferior communication rate is at least , whose decoding error is zero, and whose full weak-locking error is at most for all sufficiently large , uniformly over all finite environment POVMs.
This pins the source's slower-than-exponential error claim without asserting any fixed positive security exponent. The formal sequence index corresponds to block length .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P63
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P63
open QAlgorithms Filter
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon labelInformation)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower dilationMap SupportIncluded)
open QAlgorithms.Papers.Independent.Bridge50.P47 (SymmetricIndex universalSymmetricDilation)
open QAlgorithms.Learning (IsDistribution)
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.10–11, Remark 11: any positive schedule tending to zero slower than
exponentially can be met at the same asymptotic rate, with o(n) secret bits. -/
theorem schur_subexponential_security {A B E : Type}
[Fintype A] [DecidableEq A] [Nonempty A] [Fintype B] [DecidableEq B] [Nonempty B]
[Fintype E] [DecidableEq E] [Nonempty E]
(V : Matrix (B × E) A ℂ) (hV : Vᴴ * V = 1) (rho : A → Mat E)
(hCq : CqComplement (environment V) rho) (p : A → ℝ) (hp : IsDistribution p)
(etaSchedule : ℕ → ℝ) (heta : ∀ n, 0 < etaSchedule n)
(hzero : Tendsto etaSchedule atTop (nhds 0))
(hsub : Tendsto (fun n => -Real.logb 2 (etaSchedule n) / (n + 1)) atTop (nhds 0)) :
∃ C : (n : ℕ) → KeyedBlockCode A B (n + 1),
Tendsto (fun n => keyRate (C n)) atTop (nhds 0) ∧
KeyedRateAtLeast C (associatedMinimum p rho) ∧
(∀ n, keyedAverageError (dilationMap V) (C n) = 0) ∧
(∀ᶠ n in atTop, WeakSecure (environment V) (C n) (etaSchedule n)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P63
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, and let satisfy . Put and . Suppose are density matrices on , meaning positive semidefinite matrices of trace , and equals when and otherwise. Let be nonnegative and sum to , and define , with under continuous functional calculus and , and
Let satisfy for every , , and . There exists a sequence of keyed codes of lengths , each having positive numbers of messages and of keys, density matrices on , and for every key a measurement on , such that , for every eventually , and for every ,
Furthermore, for all sufficiently large , every measurement on with a positive finite number of outcomes admits a probability vector on those outcomes satisfying
All measurements here consist of positive semidefinite effects summing to the identity. No upper bound on the individual values is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.