Accessible equivocation bounds weak locking capacity from above
OpenQAlgorithms.Papers.Independent.Intakenext100.P63.schur_locking_upperLet be nonzero finite-dimensional Hilbert spaces, and let be a normalized Stinespring isometry defining receiver channel and complementary channel . Suppose that, in the specified computational basis of , , where every is a normalized density matrix on . For a probability vector , define using the joint law , with ranging over all finite POVMs. Then
All entropies are in bits. The operational capacity uses uniform messages, an independent uniform secret of bits, and vanishing averaged reliability and full weak-locking errors, uniformly over Eve's measurements. This is an unconditional upper bound for complements of cq-channels.
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 p.5, Proposition 3: unconditional accessible-equivocation upper bound.
A normalized fixed Stinespring isometry specifies both channels. -/
theorem schur_locking_upper {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) :
keyedCapacity (dilationMap V) (environment V) true ≤ optimizedEquivocation rho := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P63
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For arbitrary finite, nonempty types , each with decidable equality, let be a complex matrix with rows indexed by and columns by , satisfying , and let be matrices on . Assume every is positive semidefinite of trace , and, for every ,
where is the matrix unit. With and , the theorem asserts
The infimum ranges over measurements on with a finite, strictly positive number of positive semidefinite effects summing to identity. The left side is the total real supremum of nonnegative rates admitting a sequence of codes of lengths : each has positive message and key counts , input density matrices , and decoding measurements , with
Moreover, for every , eventually every finite measurement on with a strictly positive number of outcomes admits a probability vector satisfying
The map powers mean . Density matrices have trace and are positive semidefinite; every decoding measurement has positive semidefinite effects summing to identity. The prior may have zero entries, and all logarithms and divisions in the right side are total, including and division by zero equal to zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.