Unnumbered result in Theorem 11: antidegradable channels have zero ss-private capacity
OpenQAlgorithms.Papers.Independent.Support50.P07.antidegradable_ssPrivateCapacityIf is antidegradable, meaning that a CPTP map simulates its receiver from the full complementary output of the same dilation, then
The one-letter coherent information optimizes over arbitrary normalized 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.
The conclusion also explicitly includes the unassisted private capacity .
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 pp.5–6: environment-to-receiverChannel simulation forces zero ss-private capacity;
the equality with Q^(1) mentioned in Theorem 11 is retained. -/
theorem antidegradable_ssPrivateCapacity [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ)
(hU : IsIsometry U) (ha : IsAntidegradable U) :
ssPrivateCapacity U = 0 ∧ maximumCoherentInformation U = 0 ∧
fullTracePrivateCapacity U = 0 := 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 . Write and , and assume that there exists a channel satisfying for every matrix . Here a channel has a finite Kraus representation with ; a density matrix is positive semidefinite with trace . For any isometric dilation , a finite code consists of , input density matrices , and a measurement , . Its joint matrix has entries
With , its error is
Define as the real supremum of rates such that, for every and slack , there is such that every admits a code for with and . Define by the same quantifiers, except that for each such one may also choose any integer and use the dilation
from to . Every input density matrix must satisfy, separately in its row and column indices,
There is no bound on the growth of in this definition. Finally put
with zero eigenvalues contributing zero. The assertion is
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.