Theorem IV.11: For c1h1 source, lambdaBar,delta>0 and all sufficiently large n, a side-information code has log2|M|/n≤H(X|Y)+3delta and mean erro
OpenQAlgorithms.Papers.Independent.Renew46.P43.rateSlicingFor a finite correlated classical/hybrid source and , all sufficiently large positive block lengths admit a classical encoding and a conditioned collective POVM on the free register . Its square-root instrument retains the decoded word and , then discards the transmitted classical message; it also retains a failure outcome.
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
/-- Theorem IV.11, PDF pp.53-54: rate slicing with the actual retained-outcome
square-root instrument. Printed epsilon-bar in the threshold is corrected to lambda-bar,
and the omitted n-th powers are restored from the n-block definition. -/
theorem rateSlicing (a d : ℕ) (ha : 0 < a) (hd : 0 < d)
(lambda delta : ℝ) (hlambda : 0 < lambda) (hdelta : 0 < delta) :
∃ n0 : ℕ, 0 < n0 ∧ ∀ (S : HybridSource 1),
(∀ i, S.alphabet i = a) → S.system.dim = d → ∀ n : ℕ, n0 ≤ n →
∃ c : SideCode S n, c.rate 0 ≤ S.subsetEntropy Finset.univ + 3 * delta ∧
c.error ≤ lambda ∧ c.disturbance ≤ Real.sqrt (8 * lambda) + lambda := 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 pair of natural numbers with and , and every pair of real numbers with and , there exists with such that the following holds uniformly for every one-sender hybrid source whose classical alphabet has size and quantum system has dimension . Such a source includes arbitrary basis block labels , distinct pure states with and zero entries between different blocks, and joint probability masses summing to . Put , , and , with the scalar function interpreted by matrix functional calculus. For every , there exists a side code with a positive number of messages, an encoder , and decoder POVMs indexed by length- classical words and failure , each effect having zero entries between quantum basis words differing in any block label, such that
Here ranges over all joint words, , , , ranges over all decoder outcomes, and . There is no upper bound assumed on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.