Lemma 9: ss assistance does not help degradable channels
OpenQAlgorithms.Papers.Independent.Support50.P07.degradable_ssPrivateCapacityIf is degradable, with its degrading CPTP map simulating the full environment from the receiver, then
The right side maximizes over all normalized mixed input states.
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 9, PDF p.5: free symmetric assistance does not improve degradable channels. -/
theorem degradable_ssPrivateCapacity [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ)
(hU : IsIsometry U) (hd : IsDegradable U) :
ssPrivateCapacity U = maximumCoherentInformation 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 . Assume there is a map of the form , for a finite family satisfying , such that for every complex matrix on . Define as the real supremum of nonnegative such that, for every , every sufficiently large positive admits , density inputs on , and a receiver POVM , with . Each input must satisfy , where swaps the auxiliary factors; the dilation applies independently and sends one auxiliary factor to each output. If and , require . Here density matrices are positive semidefinite with trace one, POVM elements are positive semidefinite and sum to , and , without a factor of . Then
where the supremum is real and , evaluated by continuous functional calculus.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.