Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6 — exact asymmetric binomial Fourier-level bound

Open
IQPForrelation832.SingleQuery.Supplement.theorem_6

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

computational-complexityforrelationiqp-circuitsp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-information

Let ppp be the actual acceptance probability of any ddd-query IQP circuit using a single nnn-wire phase oracle and any accepting subset of the computational basis. Set N=2nN=2^nN=2n, the original oracle-table length. For every restriction ρ\rhoρ, the function p∣ρp|\rhop∣ρ is multilinear of degree at most 2d2d2d. For each natural level ℓ≤2d\ell\le2dℓ≤2d,

L1,ℓ(p∣ρ)≤∑0≤a,b≤da+b=ℓmin⁡{(da)(Nb),(db)(Na)},L_{1,\ell}(p|\rho)\le \sum_{\substack{0\le a,b\le d\\a+b=\ell}} \sqrt{\min\left\{\binom da\binom Nb,\binom db\binom Na\right\}},L1,ℓ​(p∣ρ)≤0≤a,b≤da+b=ℓ​∑​min{(ad​)(bN​),(bd​)(aN​)}​,

and L1,ℓ(p∣ρ)=0L_{1,\ell}(p|\rho)=0L1,ℓ​(p∣ρ)=0 for ℓ>2d\ell>2dℓ>2d. The minimum stays inside each square root; no geometric-mean or asymptotic relaxation is made. NNN remains the original table length after every restriction. There is no assumption that d≤Nd\le Nd≤N, or that n,m,dn,m,dn,m,d are positive. Arbitrary diagonal-unitary middle gates, ancillas, overlapping queries, repeated addresses and all accepting subsets are included. This companion theorem gives the exact level-wise query bound, using the restricted decomposition of Lemma 5.

Differences from the source:

  • generalization: polynomial-size IQP middle blocks → arbitrary finite diagonal-unitary middle gate lists; reason: the Section 5 arguments do not use the number of non-oracle gates; every source circuit is included
  • encoding: sign assignments on the free set Gamma and its subsets → Boolean signs on the exact free-coordinate subtype; reason: true represents +1 and false represents -1; all assignments and restrictions correspond bijectively, including the empty free set
Preamble
import Definitions.Def_IQPForrelation832_SingleQuery_Supplement_OracleFourier

set_option autoImplicit false
Formal statement
namespace IQPForrelation832.SingleQuery.Supplement

open QAlgorithms QAlgorithms.Complexity

theorem theorem_6 {n m d : ℕ} (c : PhaseMiddle n m)
    (hc : PhaseIQP c) (hd : OracleCircuit.queryCount c 0 = d)
    (F : Finset (Qubits m)) (ρ : Restriction n) :
    MultilinearDegreeLE (phaseBorn c F) ρ (2*d) ∧
    (∀ ell : ℕ, ell ≤ 2*d → levelMass (phaseBorn c F) ρ ell ≤ binomialBound d (2^n) ell) ∧
    (∀ ell : ℕ, 2*d < ell → levelMass (phaseBorn c F) ρ ell = 0) := by sorry

end IQPForrelation832.SingleQuery.Supplement
Source
Quentin Buzet, André Chailloux, IQP circuits for 2-Forrelation, STOC 2027 submission #832 (October 2026), p. 27, Theorem 6; proof pp. 27-30. https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/832.pdf

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