Theorem 5 (seed paper result): single-letter ss-private capacity
OpenQAlgorithms.Papers.Independent.Support50.P07.ssPrivateCapacity_singleLetterFor every channel , let be a Stinespring isometry. For every positive integer , let and both have dimension . For a finite pure-state ensemble whose vectors are individually fixed by swapping , and any finite classical stochastic processing , evaluate mutual information after applying on . Then
All quantum registers are finite and nonzero, states have trace one, pure vectors have norm one, and entropy and logarithms are in bits. Operational private capacities use memoryless powers, positive blocklengths and message counts, uniform messages, arbitrary mixed block inputs, and normalized decoding POVMs. A code is good when its joint decoded message/environment state has full trace norm less than the error from a perfectly correlated uniform pair tensor its actual common environment marginal. Rates use every positive error and rate slack at all sufficiently large blocklengths. Symmetric assistance allows one arbitrary finite symmetric channel per block without charging its dimension.
This identifies the operational resource-assisted capacity with a single-use information optimization.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P07
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
namespace QAlgorithms.Papers.Independent.Support50.P07
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
dilationPower idealJoint maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Claimed50.P24 (productDilation)
open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation)
variable {A B E C D F : Type}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype E] [DecidableEq E] [Fintype C] [DecidableEq C]
variable [Fintype D] [DecidableEq D] [Fintype F] [DecidableEq F]
/-- Theorem 5, PDF pp.3–4: operational equality with the full symmetric-ensemble
formula (3). The printed theorem has superscript (1); its proof identifies the operational capacity. -/
theorem ssPrivateCapacity_singleLetter [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ) (hU : IsIsometry U) :
ssPrivateCapacity U = ssPrivateInformation U := by sorry
end QAlgorithms.Papers.Independent.Support50.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be arbitrary finite nonempty index types with decidable equality, and let be a complex matrix from to satisfying . The assertion equates the following operational supremum with the following information supremum. For a matrix from an input space to a receiver space times an environment space , a code consists of an integer , positive semidefinite trace-one input matrices , and positive semidefinite receiver matrices satisfying . Define its decoded matrix and environment marginal by
Its error is , where has entry when , and zero otherwise, and . The operational supremum is over all real such that, for every and slack , there is such that every admits an integer and such a code for
with , error strictly below , and . Every code input must satisfy , where exchanges its two -dimensional auxiliary factors. The information supremum is over all integers , positive integers , weights summing to one, unit vectors on satisfying , and numbers with . Using the same assisted matrix with , set and , and form block diagonal matrices
and analogously . The quantity being maximized is , where and , with evaluated by continuous functional calculus and . There are no bounds on the auxiliary dimension or either positive label count.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.