Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10.5 — objective matrix after imperfect decoding

Proved
DQI.Imperfect.lemma_10_5

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 DkD_kDk​ be the weight-kkk errors correctly recovered by a deterministic decoder of B⊤yB^\top yB⊤y. For the normalized Hadamard transform of the postselected state P~D(f)\widetilde P_D(f)PD​(f), the expected max-XORSAT objective is

⟨f⟩=w⊤Aˉ(m,ℓ,D)w.\langle f\rangle=w^\top\bar A^{(m,\ell,D)}w.⟨f⟩=w⊤Aˉ(m,ℓ,D)w.

The (k,k′)(k,k')(k,k′) entry of Aˉ(m,ℓ,D)\bar A^{(m,\ell,D)}Aˉ(m,ℓ,D) is the sum of (−1)vi+v⋅(y+y′)(-1)^{v_i+v\cdot(y+y')}(−1)vi​+v⋅(y+y′) over iii and (y,y′)∈Dk×Dk′(y,y')\in D_k\times D_{k'}(y,y′)∈Dk​×Dk′​ with B⊤(y+y′+ei)=0B^\top(y+y'+e_i)=0B⊤(y+y′+ei​)=0, divided by (mk)(mk′)\sqrt{\binom m k\binom m{k'}}(km​)(k′m​)​. This is the objective matrix for the retained, correctly decoded errors.

Formalization Note The hypothesis that the transformed state has squared norm one states the paper's normalization condition. The formalization assumes ℓ≤m\ell\le mℓ≤m.

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

theorem lemma_10_5 (m n ℓ : ℕ) (hℓ : ℓ ≤ m)
    (B : Matrix (Fin m) (Fin n) (ZMod 2)) (v : Fin m → ZMod 2) (dec : (Fin n → ZMod 2) → (Fin m → ZMod 2)) (w : Fin (ℓ + 1) → ℝ)
    (hnorm : (∑ x, (hadamard (PtD B v dec ℓ w) x) ^ 2) = 1) :
    expObj B v (hadamard (PtD B v dec ℓ w)) =
      w ⬝ᵥ (AbarD B v dec ℓ).mulVec w := by sorry

end DQI.Imperfect
Source
Jordan et al., Optimization by Decoded Quantum Interferometry, arXiv:2408.08292v5, pp. 40–41, Lemma 10.5, (176)–(178)
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