Unnumbered result used in Theorem 11: unassisted capacity is bounded by ss-private capacity
OpenQAlgorithms.Papers.Independent.Support50.P07.privateCapacity_le_ssPrivateCapacityFor every channel , unassisted private communication is bounded by free symmetric-side-channel-assisted private communication:
Both capacities use uniform messages and joint full-trace-norm correctness and security against the full environment.
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 pp.1,5: ignoring the d=1 side channel recovers every unassisted code. -/
theorem privateCapacity_le_ssPrivateCapacity [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ)
(hU : IsIsometry U) :
fullTracePrivateCapacity U ≤ 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 satisfy . For an isometric dilation , a code consists of density matrices on and a POVM on , where density matrices are positive semidefinite with trace one and POVM elements are positive semidefinite and sum to . Its decoded state is ; with , its error is the full trace norm , where . Define as the real supremum of nonnegative such that, for every , all sufficiently large positive admit such a code for , with error strictly below and . Define by the same rate and error requirements, allowing at each block length any , input space , and the dilation applying and routing one auxiliary factor to each output, while requiring every input matrix to satisfy , where swaps the auxiliary factors. The auxiliary dimension is unrestricted and may depend on the block length and tolerances. Then .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.