Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10.1 — first imperfect-decoding bound

Proved
DQI.Imperfect.theorem_10_1

by mikedeng1 · Oct 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theorydecoded-quantum-interferometrymax-xorsatp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-algorithms

Let B∈F2m×nB\in\mathbb F_2^{m\times n}B∈F2m×n​ define a max-XORSAT objective fv(x)=∑i=1m(−1)bi⋅x+vif_v(x)=\sum_{i=1}^m(-1)^{b_i\cdot x+v_i}fv​(x)=∑i=1m​(−1)bi​⋅x+vi​. Fix ℓ≤m\ell\le mℓ≤m, real weights w0,…,wℓw_0,\ldots,w_\ellw0​,…,wℓ​, and one deterministic decoder of syndromes B⊤yB^\top yB⊤y. Let FkF_kFk​ be its misidentified errors of weight kkk, εk=∣Fk∣/(mk)\varepsilon_k=|F_k|/\binom m kεk​=∣Fk​∣/(km​), ε=max⁡0≤k≤ℓεk\varepsilon=\max_{0\le k\le\ell}\varepsilon_kε=max0≤k≤ℓ​εk​, and N=∑k=0ℓwk2(1−εk)>0N=\sum_{k=0}^{\ell}w_k^2(1-\varepsilon_k)>0N=∑k=0ℓ​wk2​(1−εk​)>0. Prepare the postselected state (171), apply the binary Hadamard transform, normalize, and measure a binary string. If vvv is uniform in F2m\mathbb F_2^mF2m​, then the expected measured objective obeys

Ev⟨fv⟩≥w⊤A(m,ℓ,0)w−2ε(m+1)w⊤wN.\mathbb E_v\langle f_v\rangle\ge \frac{w^\top A^{(m,\ell,0)}w-2\varepsilon(m+1)w^\top w}{N}.Ev​⟨fv​⟩≥Nw⊤A(m,ℓ,0)w−2ε(m+1)w⊤w​.

The bound quantifies the objective loss from imperfect decoding without assuming a minimum dual-code distance.

Formalization Note This is the first inequality of (172). The printed second inequality is false without a sign condition and is a separate companion item. The conditions ℓ≤m\ell\le mℓ≤m and N>0N>0N>0 ensure that the shell normalizations and measured-state expectation have their intended meanings. The decoder is fixed independently of vvv.

Preamble
import Mathlib
import Definitions.Def_DQI_Imperfect_Setting
Formal statement
namespace DQI.Imperfect

theorem theorem_10_1 (m n ℓ : ℕ) (hℓ : ℓ ≤ m)
    (B : Matrix (Fin m) (Fin n) (ZMod 2)) (dec : (Fin n → ZMod 2) → (Fin m → ZMod 2)) (w : Fin (ℓ + 1) → ℝ)
    (hN : 0 < (∑ k, (w k) ^ 2 * (1 - epsk B dec k.val))) :
    ((w ⬝ᵥ (DQI.Semicircle.Atri m ℓ 0).mulVec w) -
        2 * epsMax B dec ℓ * ((m : ℝ) + 1) * (w ⬝ᵥ w)) /
      (∑ k, (w k) ^ 2 * (1 - epsk B dec k.val)) ≤
      avgV m (fun v => expObj B v (hadamard (PtD B v dec ℓ w))) := by sorry

end DQI.Imperfect
Source
Jordan et al., Optimization by Decoded Quantum Interferometry, arXiv:2408.08292v5, pp. 39–40, Theorem 10.1, (172), first inequality
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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