An affine channel code from linear reconciliation of uniform inputs
OpenQAlgorithms.Papers.Independent.Intakenext100.P30.uniform_reconciliation_codeLet and be finite vector spaces over the same field, let be a surjective linear compressor, and let be a normalized POVM on the receiver output with outcomes in for each . For a cq channel , suppose the reconciliation error under the uniform input law is at most , where . There exist and a normalized decoder with message alphabet and encoder such that
Thus a single affine fiber of the compressor supports a channel code of the indicated size. The source's construction, rather than an assumed good fiber, supplies this code.
All alphabets are finite and nonempty, and output Hilbert spaces are finite dimensional and nonzero. A classical–quantum channel assigns a positive semidefinite, trace-one matrix to each input. Encoders may use private randomness; decoders are normalized POVMs. Codes are fixed independently of the message, with no supplied shared key or entanglement. Logarithms and entropies are in bits.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P30
noncomputable section
open scoped BigOperators ComplexConjugate Matrix ComplexOrder
open Filter
namespace QAlgorithms.Papers.Independent.Intakenext100.P30
variable {X Y Z M U V A B C : Type*}
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z] [Fintype M] [DecidableEq M]
variable [Fintype U] [DecidableEq U] [Fintype V] [DecidableEq V]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C]
attribute [local instance] Classical.propDecidable
/-- Lemma 2, PDF pp.3–4, with three source corrections: the compression map is
onto its actual range; the encoder is the affine inclusion m ↦ a+m into a fiber;
the error conclusion is <= epsilon, matching the definition of epsilon-good.
No good fiber or resulting error bound is a hypothesis. -/
theorem uniform_reconciliation_code {K : Type*} [Field K]
[AddCommGroup U] [Module K U] [AddCommGroup C] [Module K C] [Nonempty Y]
(theta : U → Matrix Y Y ℂ) (hTheta : RRIsCq theta)
(compress : U →ₗ[K] C) (honto : Function.Surjective compress)
(decompress : C → U → Matrix Y Y ℂ) (hDec : ∀ c, IsPOVM (decompress c))
(epsilon : ℝ) (he : 0 ≤ epsilon)
(herror : rrReconciliationError theta compress decompress (rrUniform U) ≤ epsilon) :
∃ a : U, ∃ decoder : {u : U // compress u = 0} → Matrix Y Y ℂ,
IsPOVM decoder ∧
(Fintype.card {u : U // compress u = 0} : ℝ) =
(Fintype.card U : ℝ) / (Fintype.card C : ℝ) ∧
rrAffineCodeError theta compress a decoder ≤ epsilon := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P30
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any field, let be finite additive commutative groups equipped with -module structures, and let be a finite nonempty index type, with decidable equality where required. Suppose is positive semidefinite with trace one for every , is a surjective -linear map, and matrices satisfy and for every . For every real , if
then there exist and matrices , indexed by , such that , ,
The zero-dimensional or singleton module cases and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.