Square-lattice residue decoding and independent Pauli tails
OpenQAlgorithms.Papers.Independent.Intakenext100.P08.squareLattice_pauliTailsLet be an integer, , and . Put . A real shift is decoded to the residue . Every shift with has residue zero. For independent , the residues are independent and their nonzero probabilities satisfy
On the finite -symbol space the associated operators act as
The probabilities can be smaller than the displayed tail because shifts by multiples of decode to zero. This is a displacement-decoder and finite-operator statement, without an assertion that ideal oscillator combs are normalized states.
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 p.7, (69)–(71): square-lattice rounded residues, independent Pauli errors,
and their Gaussian upper bounds, together with the finite clock/shift action.
This does not assert a normalizable oscillator realization of the ideal inner code. -/
theorem squareLattice_pauliTails (d : ℕ) (hd : 2 ≤ d) (hbar : ℝ) (hhbar : 0 < hbar)
(v : NNReal) (hv : 0 < v) :
let delta := Real.sqrt (2 * Real.pi * hbar / (d : ℝ))
delta / 2 = Real.sqrt (Real.pi * hbar / (2 * (d : ℝ))) ∧
(∀ x : ℝ, |x| < delta / 2 → roundedResidue d delta x = 0) ∧
xErrorProbability d delta v ≤
complementaryErrorFunction (Real.sqrt (Real.pi * hbar / (4 * (d : ℝ) * (v : ℝ)))) ∧
zErrorProbability d delta v ≤
complementaryErrorFunction (Real.sqrt (Real.pi * hbar / (4 * (d : ℝ) * (v : ℝ)))) ∧
IndepFun (fun x : ℝ × ℝ => roundedResidue d delta x.1)
(fun x : ℝ × ℝ => roundedResidue d delta x.2)
((gaussianReal 0 v).prod (gaussianReal 0 v)) ∧
(∀ j : Fin d,
(cyclicX d).mulVec (Pi.single j 1) =
Pi.single (⟨(j.val + 1) % d, Nat.mod_lt _ (by omega)⟩ : Fin d) 1 ∧
(cyclicZ d).mulVec (Pi.single j 1) =
Complex.exp (Complex.I * (2 * Real.pi * (j.val : ℝ) / (d : ℝ) : ℝ)) •
Pi.single j 1) := 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 positive real number , and every strictly positive nonnegative real number , set . Define to be the residue class of the integer obtained by rounding , let be the real Gaussian probability measure of mean and variance , and define
Then , and every real with satisfies . Under the product measure , both
and the two residue-valued functions and are independent. Finally, define complex matrices and by when and otherwise, and by with all off-diagonal entries zero. For every , their actions on the standard coordinate vectors are
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.