Equation (4): variational characterization using symmetric channels
OpenQAlgorithms.Papers.Independent.Support50.P07.ssPrivateInformation_symmetricChannelsFor each positive integer , let map an orthonormal basis of a -dimensional input onto the symmetric subspace of , and set . For every channel ,
Both one-use quantities optimize finite normalized pure ensembles and classical processing; the left one uses symmetric auxiliary signals.
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]
/-- Equation (4), PDF p.3: unrestricted positive symmetric-channel dimension;
this is the variational equivalence, independent of operational Theorem 5. -/
theorem ssPrivateInformation_symmetricChannels [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ)
(hU : IsIsometry U) :
ssPrivateInformation U = sSup {r | ∃ d : ℕ, 0 < d ∧
r = processedPrivateInformation (productDilation U (symmetricSubspaceEmbedding d))} := 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 any dilation , define as the real supremum over positive finite label counts , weights summing to one, unit vectors , and conditional probabilities summing to one for each , of . The receiver state is , and the environment state uses instead; , with by continuous functional calculus. Define by additionally taking the supremum over integers , using unit vectors on whose amplitudes satisfy , applying to , and routing the first auxiliary factor to the receiver and the second to the environment. For each , let , and define by and when . Let . Then
All suprema here are real suprema; and zero ensemble or processing probabilities are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.