Lemma 6: regularized ss-private capacity
OpenQAlgorithms.Papers.Independent.Support50.P07.ssPrivateCapacity_regularizationFor any channel , let denote the symmetric-pure-ensemble variational quantity of Eq.(3), optimizing all finite auxiliary dimensions and classical processings. The sequence of normalized block quantities converges, and
Here counts only memoryless uses of the main channel.
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 result supplies a capacity identity or bound for the channel family and resource model stated above.
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]
/-- Lemma 6, PDF pp.3–4: convergence itself, to the operational capacity, is asserted.
The harmless n=0 value from real division does not enter the tail atTop. -/
theorem ssPrivateCapacity_regularization [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ) (hU : IsIsometry U) :
Tendsto (fun n : ℕ => ssPrivateInformation (dilationPower U n) / (n : ℝ))
atTop (nhds (ssPrivateCapacity 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 finite nonempty types with decidable equality, and let satisfy . For any such dilation , write and . Define as the real supremum, over every integer , every pair of positive finite label counts, probabilities summing to one, unit vectors satisfying , and conditional probabilities summing to one for each , of . These mutual informations are evaluated on the two states obtained by applying the receiver and environment maps of together with the identity routing of the two auxiliary factors to ; , where , using continuous functional calculus. Define as the real supremum of nonnegative rates such that, for every , there is for which every admits , , density matrices on , and a receiver POVM , with . A density matrix is positive semidefinite with trace one, a POVM consists of positive semidefinite matrices summing to , and each must satisfy , where swaps the auxiliary factors. Let apply independently times and route the first auxiliary factor to the receiver and the second to the environment, and set and ; the required error is , with the full trace norm . Then, for ,
The sequence is defined also at : the matrix entries are empty products equal to one, and division by zero has value zero; this term does not affect the limit.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.