Reconciliation under a nearly uniform input yields an affine code
OpenQAlgorithms.Papers.Independent.Intakenext100.P30.nearly_uniform_reconciliation_codeRetain the channel, surjective linear compressor , and normalized decompressor family of Lemma 2. Let be an input law on , and let denote the uniform law. Suppose , , and the same reconciliation protocol has error at most under . There are an affine encoder from and a normalized decoder such that
for uniformly distributed messages. This permits the uniform-input construction to tolerate the distribution-shaping error.
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
/-- Remark 2, PDF p.4, with Lemma 2's onto-range and affine-fiber corrections.
The same channel and reconciliation protocol are evaluated under the two laws. -/
theorem nearly_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))
(p : RRDistribution U) (epsilon1 epsilon2 : ℝ) (he1 : 0 ≤ epsilon1) (he2 : 0 ≤ epsilon2)
(hnear : tvDist (rrUniform U) p.prob ≤ epsilon1)
(herror : rrReconciliationError theta compress decompress p.prob ≤ epsilon2) :
∃ 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 ≤ epsilon1 + epsilon2 := 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, finite additive commutative groups with -module structures, and a finite nonempty index type, with decidable equality where required. Suppose every is positive semidefinite with trace one, is a surjective -linear map, and with for every . Let have nonnegative entries summing to one, and let . If
then there exist and matrices , indexed by , such that , ,
Singleton module cases and zero values of either error parameter are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.