Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Square-lattice residue decoding and independent Pauli tails

Open
QAlgorithms.Papers.Independent.Intakenext100.P08.squareLattice_pauliTails

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d≥2d\ge2d≥2 be an integer, ℏ>0\hbar>0ℏ>0, and v>0v>0v>0. Put δ=2πℏ/d\delta=\sqrt{2\pi\hbar/d}δ=2πℏ/d​. A real shift xxx is decoded to the residue r(x)=round⁡(x/δ) mod dr(x)=\operatorname{round}(x/\delta)\bmod dr(x)=round(x/δ)modd. Every shift with ∣x∣<δ/2=πℏ/(2d)|x|<\delta/2=\sqrt{\pi\hbar/(2d)}∣x∣<δ/2=πℏ/(2d)​ has residue zero. For independent q,p∼N(0,v)q,p\sim N(0,v)q,p∼N(0,v), the residues r(q),r(p)r(q),r(p)r(q),r(p) are independent and their nonzero probabilities satisfy

pX, pZ≤erfc⁡(πℏ4dv).p_X,\ p_Z\le\operatorname{erfc}\left(\sqrt{\frac{\pi\hbar}{4dv}}\right).pX​, pZ​≤erfc(4dvπℏ​​).

On the finite ddd-symbol space the associated operators act as

X∣j⟩=∣j+1 mod d⟩,Z∣j⟩=e2πij/d∣j⟩(0≤j<d).X|j\rangle=|j+1\bmod d\rangle,\qquad Z|j\rangle=e^{2\pi i j/d}|j\rangle\quad(0\le j<d).X∣j⟩=∣j+1modd⟩,Z∣j⟩=e2πij/d∣j⟩(0≤j<d).

The probabilities can be smaller than the displayed tail because shifts by multiples of dδd\deltadδ decode to zero. This is a displacement-decoder and finite-operator statement, without an assertion that ideal oscillator combs are normalized states.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P08
Formal statement
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
Source
Achievable rates for the Gaussian quantum channel, arXiv:quant-ph/0105058v1, PDF p. 7, §VI, (69)–(71): square-lattice inner decoding and Pauli tail probabilities
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number d≥2d\ge2d≥2, every positive real number ℏ\hbarℏ, and every strictly positive nonnegative real number vvv, set δ=2πℏ/d\delta=\sqrt{2\pi\hbar/d}δ=2πℏ/d​. Define r(x)∈Z/dZr(x)\in\mathbb Z/d\mathbb Zr(x)∈Z/dZ to be the residue class of the integer obtained by rounding x/δx/\deltax/δ, let γv\gamma_vγv​ be the real Gaussian probability measure of mean 000 and variance vvv, and define

E(s)=1−2π∫0se−t2 dt.E(s)=1-\frac{2}{\sqrt{\pi}}\int_0^s e^{-t^2}\,dt.E(s)=1−π​2​∫0s​e−t2dt.

Then δ/2=πℏ/(2d)\delta/2=\sqrt{\pi\hbar/(2d)}δ/2=πℏ/(2d)​, and every real xxx with ∣x∣<δ/2|x|<\delta/2∣x∣<δ/2 satisfies r(x)=0r(x)=0r(x)=0. Under the product measure γv⊗γv\gamma_v\otimes\gamma_vγv​⊗γv​, both

(γv⊗γv){(x1,x2):r(x1)≠0}≤E ⁣(πℏ4dv)and(γv⊗γv){(x1,x2):r(x2)≠0}≤E ⁣(πℏ4dv),(\gamma_v\otimes\gamma_v)\{(x_1,x_2):r(x_1)\ne0\} \le E\!\left(\sqrt{\frac{\pi\hbar}{4dv}}\right) \quad\text{and}\quad (\gamma_v\otimes\gamma_v)\{(x_1,x_2):r(x_2)\ne0\} \le E\!\left(\sqrt{\frac{\pi\hbar}{4dv}}\right),(γv​⊗γv​){(x1​,x2​):r(x1​)=0}≤E(4dvπℏ​​)and(γv​⊗γv​){(x1​,x2​):r(x2​)=0}≤E(4dvπℏ​​),

and the two residue-valued functions r(x1)r(x_1)r(x1​) and r(x2)r(x_2)r(x2​) are independent. Finally, define complex d×dd\times dd×d matrices XXX and ZZZ by Xij=1X_{ij}=1Xij​=1 when i=(j+1) mod di=(j+1)\bmod di=(j+1)modd and Xij=0X_{ij}=0Xij​=0 otherwise, and by Zjj=exp⁡(2πij/d)Z_{jj}=\exp(2\pi\mathrm{i}j/d)Zjj​=exp(2πij/d) with all off-diagonal entries zero. For every j∈{0,…,d−1}j\in\{0,\ldots,d-1\}j∈{0,…,d−1}, their actions on the standard coordinate vectors are

Xej=e(j+1) mod d,Zej=exp⁡(2πij/d)ej.Xe_j=e_{(j+1)\bmod d}, \qquad Ze_j=\exp(2\pi\mathrm{i}j/d)e_j.Xej​=e(j+1)modd​,Zej​=exp(2πij/d)ej​.
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me