classical-side-information-lower: With classical side information only at quantum-source decoder, even Ra,Fbar(lambda)≥H(Y|X), every 0<lambda<1.
OpenQAlgorithms.Papers.Independent.Renew46.P43.classicalSideConverseLet be a finite correlated classical/fully quantum pure-letter source. Only the decoder receives for free; the arbitrary state-valued encoder sees the pure word alone. The rate is the fixed-error limsup of operational block minima.
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 strong converse, PDF pp.56-57: even arbitrary encoding needs
H(Y|X) when free classical side information is available only at the decoder. -/
theorem classicalSideConverse (S : HybridSource 1)
(hfull : ∀ a b, S.system.block a = S.system.block b)
(lambda : ℝ) (hlambda : 0 < lambda) (hsmall : lambda < 1) :
classicalSideRate S false lambda ≥ ENNReal.ofReal
(vnEntropy (S.marginal Finset.univ) - pmfEntropy
(PMF.map (fun x => x.1 0) S.law)) := 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 letters with , and joint probability mass function , suppose that its block-label function satisfies for every pair of quantum basis indices . For every real satisfying , the assertion is
Here , while , with evaluated by continuous functional calculus; zero eigenvalues contribute zero. The brackets mean the nonnegative part embedded in . The left side is the limit superior, as , of the infimum of over positive-dimensional length- codes having average fidelity at least . Such a code assigns a density matrix to each letter word, independently of the classical word, and has a decoding channel for each classical word; its fidelity is
Each decoding channel is a finite Kraus sum with , and an empty infimum is . No strict positivity of the individual probabilities is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.