Unnumbered data-processing result for ss-private capacity
OpenQAlgorithms.Papers.Independent.Support50.P07.ssPrivateCapacity_postprocessingLet be a channel and let be any CPTP receiver postprocessing. Realize the composition by any full Stinespring dilation, whose environment includes the information discarded by postprocessing. 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 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]
/-- PDF p.5: arbitrary receiverChannel CPTP postprocessing, with its environment added to Eve. -/
theorem ssPrivateCapacity_postprocessing [Nonempty A] [Nonempty B] [Nonempty E]
[Nonempty D] [Nonempty F]
(U : Matrix (B × E) A ℂ)
(V : Matrix (D × F) A ℂ) (hU : IsIsometry U) (hV : IsIsometry V)
(post : Superop B D) (hpost : IsChannel post)
(hmap : ∀ rho, receiverChannel V rho = post (receiverChannel U rho)) :
ssPrivateCapacity V ≤ 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 and satisfy and . Let be a map on matrices from to admitting a finite representation with , and assume for every complex matrix on , not only for density matrices. For a dilation , define as the real supremum of nonnegative rates such that, for every , all sufficiently large positive integers admit , density inputs on , and a receiver POVM , with . Every input satisfies , where swaps the auxiliary factors; the dilation applies independently and sends one auxiliary factor to each output. Density matrices are positive semidefinite with trace one, and POVM elements are positive semidefinite and sum to . For and , require , with . Then .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.