Unconditional geometric overlap decoding bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P08.geometricOverlap_errorFix , coordinate noise variance , radius , and cell volume . There is a real symplectic matrix such that the row lattice has covolume and, for a random vector with independent coordinates,
The lattice is chosen before the displacement is sampled. The central Voronoi cell uses the Euclidean norm; boundaries have zero Gaussian measure. The first term restores the atypical shifts expressly omitted in (59)–(64). This bounds a geometric decoding event and does not establish quantum-code fidelity.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P08
namespace QAlgorithms.Papers.Independent.Intakenext100.P08
open MeasureTheory ProbabilityTheory Matrix
open scoped BigOperators ENNReal
-- Accepted grouped index and source-sign matrix; no paper-local copies.
open QAlgorithms.Papers.Independent.Dependency50.P10 (Phase sigma)
-- The accepted predicate uses column bases and -sigma: apply it to S.transpose.
open QAlgorithms.Papers.Independent.Frontier30.P02 (IsSymplectic)
-- The accepted pairing has the opposite sign: exchange its two arguments below.
open QAlgorithms.Papers.Independent.Frontier30.P10 (symplecticPair)
/-- PDF pp.6–7, (58)–(64): unconditional geometric overlap bound.
Printed/changed/why: (61) explicitly ignores shifts larger than a; add their
Gaussian tail to bound the full failure probability. This is not physical-code achievability. -/
theorem geometricOverlap_error (N : ℕ) (hN : 1 ≤ N) (v : NNReal) (hv : 0 < v)
(a Delta : ℝ) (ha : 0 < a) (hDelta : 0 < Delta) :
∃ S : Generator N, IsSymplectic S.transpose ∧ S.det ≠ 0 ∧
let M : Generator N := Delta ^ (1 / (2 * (N : ℝ))) • S
|M.det| = Delta ∧
decodingFailure M v ≤ displacementTail N v a +
unitBallVolume (2 * N) * a ^ (2 * N) / Delta := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P08
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , every strictly positive nonnegative real number , and all positive real numbers and , there exists a real matrix such that and , where . Set , using the real power, let be the set of all integer linear combinations of its rows, and define
Let be the probability measure on Euclidean obtained from independent real Gaussian coordinates, each with mean and variance , and let be the real Lebesgue volume of the open unit ball in . Then
The defining inequalities for include equality, while the radial tail uses the strict inequality .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.