Lemma 7: additivity of one-letter ss-private information
OpenQAlgorithms.Papers.Independent.Support50.P07.ssPrivateInformation_additiveLet be arbitrary quantum channels. Define by optimizing over all finite symmetric pure input ensembles and finite classical processings. Then
No degradability or equality of receiver and environment dimensions is assumed.
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 7, PDF p.4: one-letter ss information is additive for arbitrary channels. -/
theorem ssPrivateInformation_additive [Nonempty A] [Nonempty B] [Nonempty E]
[Nonempty C] [Nonempty D] [Nonempty F]
(U : Matrix (B × E) A ℂ)
(V : Matrix (D × F) C ℂ) (hU : IsIsometry U) (hV : IsIsometry V) :
ssPrivateInformation (productDilation U V) =
ssPrivateInformation U + ssPrivateInformation V := 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 and be complex matrices satisfying and . For a dilation , define as follows. Choose any integer , positive finite label counts , weights with , unit vectors satisfying , and numbers with . Apply to , route the first auxiliary factor to and the second to , and form the receiver and environment states with classical label , weighted by . Take , and let be the real supremum of all these values. Here the receiver and environment maps are the respective partial traces of , , and by continuous functional calculus. Zero ensemble weights and zero conditional probabilities are allowed. Define the product dilation by . Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.