An unconditional achievable locking rate for complements of cq-channels
OpenQAlgorithms.Papers.Independent.Intakenext100.P63.schur_locking_lowerLet a normalized Stinespring isometry on nonzero finite-dimensional spaces define and its complement. Assume in the fixed input basis, with normalized . For any probability vector , set and . Regard these effects as a POVM on . Then
The capacity allows a uniform independent preshared secret of bits and uniform messages. Decoding error is averaged over messages and key; the full classical weak-locking error tends to zero uniformly over all environment POVMs, with a message-independent reference law for each POVM. This is an unconditional rate, with no extractor-success or additivity hypothesis.
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, Theorem 10: unconditional lower bound with a sublinear secret seed.
No extractor success, additivity conjecture, or invertibility is a hypothesis. -/
theorem schur_locking_lower {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) :
associatedMinimum p rho ≤ keyedCapacity (dilationMap V) (environment V) true := 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 . Define and . Let satisfy that every is positive semidefinite with trace and, for every matrix unit ,
Let sum to , set , let for under continuous functional calculus, with , and define
Define as the real supremum of all admitting the following sequence of codes, one for each length : positive integers , density matrices on , and, for each key , positive semidefinite decoding effects on summing over to the identity. The sequence must have , average error
and, for every , eventually . With , it must also satisfy, for every , eventually the condition that every measurement on with a positive finite number of outcomes admits a nonnegative probability vector on its outcomes such that
Here tensor powers are the usual matrix tensor powers of the channel maps, and density matrices are positive semidefinite with trace . The asserted inequality is ; zero weights in are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.