two-sided-classical-side-information: If both encoder and decoder receive x^n, conditional quantum-source rate H(Y|X) is achievable with average fidelity→1.
OpenQAlgorithms.Papers.Independent.Renew46.P43.twoSidedClassicalCodingFor a finite correlated classical/fully quantum source , give to BOTH encoder and decoder. There are positive-dimensional block codes with a CPTP encoding conditional on each classical word, a CPTP decoder, and average fidelity whose rates satisfy:
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Unnumbered two-sided classical side-information scheme, PDF p.57. Its
encoder actually receives x^n; this is a different domain from the decoder-only model. -/
theorem twoSidedClassicalCoding (S : HybridSource 1)
(hfull : ∀ a b, S.system.block a = S.system.block b) :
∃ c : ∀ n, ClassicalSideCode S (n+1) true,
(∀ n x, ∃ E : Superop (Fin (n+1) → Fin S.system.dim) (Fin (c n).dim),
IsChannel E ∧ ∀ p, E (wordTensor (fun t => S.letter (p t))) = (c n).encode x p) ∧
Tendsto (fun n => Real.logb 2 (c n).dim / (n+1 : ℝ)) atTop
(nhds (vnEntropy (S.marginal Finset.univ) -
pmfEntropy (PMF.map (fun x => x.1 0) S.law))) ∧
Tendsto (fun n => (c n).fidelity) atTop (nhds 1) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every hybrid source with positive classical alphabet size , positive quantum dimension , positive letter count , distinct unit-vector projectors , and probability mass function , suppose its block labels satisfy for all basis indices . There exists a family , indexed by every natural number , of length- codes with the Boolean parameter set to true. Each code has positive encoding dimension , density-matrix encodings , and decoding channels . Moreover, for every and every classical word , there is a channel from matrices on to matrices such that, for every letter word ,
All channels here are finite Kraus sums satisfying . The family satisfies
as , where and has diagonal classical blocks and zero off-diagonal classical blocks. Here and , with evaluated by continuous functional calculus and zero terms contributing zero. The encoding channel may depend on the entire classical word, and its required action covers every letter word, including those with zero source probability.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.