An explicit unbounded separation of weak locking and private capacities
OpenQAlgorithms.Papers.Independent.Intakenext100.P63.twoBasis_capacity_separationLet be an integer. The input and receiver registers of have basis , and its environment has dimension . Put and . Define the normalized Stinespring isometry , with receiver and environment channels obtained by the two partial traces. Then
The capacities allow an independent uniform preshared secret of bits, averaged out in Eve's signal, with averaged decoding error and the full trace-norm or full classical security criterion tending to zero. These exact formulas give an unbounded additive separation as grows. At both capacities are one bit; the actual input and receiver dimension is .
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.1,11, Example 12, (13)–(14), realizing the abstract's unbounded separation.
At d=1 both capacities equal one bit; input and dilationMap dimension are 2d. -/
theorem twoBasis_capacity_separation (d : ℕ) (hd : 0 < d) :
keyedCapacity (dilationMap (twoBasisDilation d)) (environment (twoBasisDilation d)) false = 1 ∧
keyedCapacity (dilationMap (twoBasisDilation d)) (environment (twoBasisDilation d)) true =
1 + (1 / 2 : ℝ) * Real.logb 2 d := 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 every positive natural number , let , let , and define by
Set and . The theorem asserts
For either criterion, the capacity is the total real supremum of nonnegative rates admitting codes of lengths with positive message and key counts , density matrices for every key and message , and decoding measurements . Density matrices are positive semidefinite of trace , and decoding measurements have positive semidefinite effects summing to identity. The required limits and rate condition are
Writing , the private criterion requires, for every , eventually a density matrix on such that . The weak criterion instead requires, eventually for every finite measurement with a strictly positive number of outcomes, a probability vector such that . Here ; neither security expression includes an additional factor . The powers are defined by . The theorem includes , when both asserted capacities equal .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.