Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section III, (55), p. 11 — at β = π/4 the expected satisfied count of |−γ, π/4⟩ is m/2 + Σ ½ d_abc ⟨Z_aZ_bZ_c⟩

Proved
QAOAE3Lin2.Typical.eq_55

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

max-e3lin2p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1qaoa

Fix an instance of E3LIN2 with mmm equations (any triples, any right-hand sides) and an angle γ∈R\gamma\in\mathbb Rγ∈R. Measure the level-one QAOA state ∣−γ,π/4⟩|-\gamma,\pi/4\rangle∣−γ,π/4⟩ in the computational basis. The expected number of satisfied equations equals m/2m/2m/2 plus the sum, over the equations, of their clause terms:

E[#satisfied]=m2+∑a<b<c12 dabc ⟨−γ,π/4∣ZaZbZc∣−γ,π/4⟩.\mathbb E[\#\text{satisfied}]=\frac m2+\sum_{a<b<c}\tfrac12\,d_{abc}\,\langle-\gamma,\pi/4|Z_aZ_bZ_c|-\gamma,\pi/4\rangle .E[#satisfied]=2m​+a<b<c∑​21​dabc​⟨−γ,π/4∣Za​Zb​Zc​∣−γ,π/4⟩.

Equivalently, the target (7) at β=π/4\beta=\pi/4β=π/4, ⟨−γ,π/4∣C∣−γ,π/4⟩\langle-\gamma,\pi/4|C|-\gamma,\pi/4\rangle⟨−γ,π/4∣C∣−γ,π/4⟩ with CCC as in (6), is the sum of the mmm clause terms.

This identity reduces the analysis of the whole instance to one equation at a time; both the mean bound (50) and the variance bound of Section III start from it.

Formalization Note The left side is the expected number of satisfied equations; subtracting m/2m/2m/2 gives the paper's (7). The sum runs over the equations i=1,…,mi=1,\dots,mi=1,…,m, which is the paper's sum over the triples with dabc≠0d_{abc}\neq0dabc​=0.

Preamble
import Mathlib
import Definitions.Def_QAOAE3Lin2_Typical_Setting
Formal statement
namespace QAOAE3Lin2.Typical

/-- (55), p. 11 (with (6) and p. 4): at `β = π/4` the expected number of satisfied equations of
`|−γ, π/4⟩` is `m/2` plus the sum over the equations of `½ d_abc ⟨Z_a Z_b Z_c⟩`. -/
theorem eq_55 {n m : ℕ} (tri : Fin m → Fin n × Fin n × Fin n) (rhs : Fin m → Bool) (γ : ℝ) :
    QAOAE3Lin2.General.expSat tri rhs (-γ) (Real.pi / 4) = (m : ℝ) / 2 + ∑ i, clauseTerm tri rhs i γ := by sorry

end QAOAE3Lin2.Typical
Source
Farhi, Goldstone, Gutmann, A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem, arXiv:1412.6062v2, p. 11, Section III, (55) (with p. 4, (6) and after (7))
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