Theorem 11: cost of degradable mixing bounds private capacity
OpenQAlgorithms.Papers.Independent.Support50.P07.privateCapacity_le_degradableMixingCostFor a channel , consider every finite decomposition , where , , each is degradable or antidegradable, and each is CPTP. Branches may have different finite intermediate output and environment dimensions. Define over these decompositions. 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.
The result turns degradable decompositions into general private-capacity upper bounds.
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]
/-- Theorem 11, PDF p.5: private capacity is bounded by the full cost of degradable
mixing, with the postprocessors of Definition 10 retained. -/
theorem privateCapacity_le_degradableMixingCost [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ)
(hU : IsIsometry U) :
fullTracePrivateCapacity U ≤ degradableMixingCost 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 . Define as the real supremum of nonnegative rates for which, for every , all sufficiently large positive admit , density matrices on , and a POVM on , such that . Writing , set and ; require . Density matrices are positive semidefinite with trace one, POVM elements are positive semidefinite and sum to , and . Define as the real infimum of over , summing to one, positive integers , isometries , and channels , such that for every matrix . Each must admit either a channel from its receiver output to its environment output reproducing the latter for every , or a channel in the reverse direction reproducing its receiver output. A channel here has a finite Kraus representation with , and , where by continuous functional calculus. Zero mixing weights are permitted; the infimum is real, so an empty admissible set has infimum zero under the underlying total convention. Then .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.