Zero private capacity and positive weak locking capacity for the symmetric channel
OpenQAlgorithms.Papers.Independent.Intakenext100.P63.symmetric_private_zero_locking_positiveFor an integer , let be the canonical isometric inclusion. Its orthonormal input basis consists of and for . Define by tracing out the second output factor; its complement traces out the first. Then
These are operational capacities with uniform messages and a uniform independent preshared secret of bits, vanishing averaged decoding error, and the full trace-norm or full classical security criterion. The two marginal channels coincide on the entire symmetric input space. This does not assert independent cloning of arbitrary inputs; the locking advantage uses the allowed sublinear secret.
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.12, Theorem 13: the entire symmetric subspace channel, not just product inputs.
The normalized inclusion defines equal marginals. A sublinear secret remains allowed. -/
theorem symmetric_private_zero_locking_positive (d : ℕ) (hd : 0 < d) :
keyedCapacity (dilationMap (universalSymmetricDilation d)) (environment (universalSymmetricDilation d)) false = 0 ∧
(1 / 2 : ℝ) * Real.logb 2 d ≤
keyedCapacity (dilationMap (universalSymmetricDilation d)) (environment (universalSymmetricDilation d)) 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
For every natural number , let and define by
Put and . Define two capacities as real suprema of nonnegative rates attainable by sequences of keyed codes of every length : such a code has positive message and key counts , density matrices on , and for each key a measurement on , with positive semidefinite effects summing to the identity. Both capacities require , average decoding error
and, for every , eventually . Write . The private capacity additionally requires, for every , eventually the existence of a density matrix on the environment output such that , where . The weak capacity instead requires, for every , eventually that every measurement on the environment output with a positive finite number of outcomes admit a probability vector satisfying
A density matrix is positive semidefinite with trace . The declaration asserts
The case is included, making the displayed lower bound zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.