Lemma 3: noisy processing does not improve the private information of a degradable channel
OpenQAlgorithms.Papers.Independent.Support50.P07.degradable_privateInformationFor a degradable channel , optimize over all finite normalized pure signal ensembles and all finite stochastic processings , with the same dilation defining receiver and environment . Then
The last supremum is over normalized purifications with reference isomorphic to the input; optimizes over arbitrary input density operators.
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 3, PDF p.2: classical noisy processing gives no one-use advantage for degradable N. -/
theorem degradable_privateInformation [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ)
(hU : IsIsometry U) (hd : IsDegradable U) :
processedPrivateInformation U = maximumCoherentInformation U ∧
maximumCoherentInformation U = purificationCoherentInformation 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 satisfy . Assume also degradability, meaning that is an isometry and there exists a map on matrices, represented on every matrix by finitely many Kraus matrices with , such that for every matrix , where and . Then
Here , where , , is applied by continuous functional calculus; the identity extension applies separately to each block indexed by the first . The leftmost quantity is the real supremum over all positive integers , weights with , unit vectors , and numbers with , of , where
with the analogous formula for , and . Both label counts are unrestricted positive integers; zero weights and zero processing probabilities are permitted.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.