Remark IV.12: Constructed rate-slicing decoder has failure-flag probability≤lambdaBar; on selected codebooks its maximum conditional decoding er
OpenQAlgorithms.Papers.Independent.Renew46.P43.flaggedRateSlicingFor the constructed rate-slicing decoder, the rate and mean-error bounds of rate slicing hold. There is a selected union of codebooks; outside it the decoder flags failure. The first bound below concerns uncovered source words, and the second concerns the normalized conditional channel states on selected words. This is an existence assertion about the constructed decoder, not every low-average-error decoder.
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
/-- Remark IV.12, PDF p.54: a property of a constructed decoder, with uncovered
source mass distinguished from the maximum conditional error inside selected codebooks. -/
theorem flaggedRateSlicing (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, ∃ covered : Finset (∀ i, Fin n → Fin (S.alphabet i)),
c.rate 0 ≤ S.subsetEntropy Finset.univ + 3 * delta ∧ c.error ≤ lambda ∧
(∑ x ∈ (Finset.univ \ covered), ∏ t, S.classicalMass (fun i => x i t)) ≤ lambda ∧
(∀ x ∈ covered, 1 - effectProb (wordTensor (fun t => S.conditional (fun i => x i t)))
(c.decode (c.message x) (some x)) ≤ lambda) ∧
(∀ x, x ∉ covered → c.decode (c.message x) none = 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 with and every with , there exists such that, for every one-sender hybrid source with classical alphabet size and quantum dimension , and every , the following objects exist. The source may have arbitrary quantum basis block labels, any distinct normalized pure states supported within those blocks, and any joint probability masses summing to . Define and if , otherwise ; define and . There exist a side code with positive message count , encoder , and decoder POVMs indexed by classical words and failure , whose effects have zero entries between quantum basis words differing in a block label at any position, and a set of covered length- classical words, satisfying
Here tensor products have entries equal to the products of the corresponding single-position entries, and is defined by matrix functional calculus. The conditions on covered and uncovered words include zero-probability words; the uncovered-word condition is equality of the failure effect with the identity matrix.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.