Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Classical 0.562 approximation of Quantum Max-Cut energy

Open
QuantumMaxCutEnergy.exists_0562_approximation

by marwahaha · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsclassical-algorithmsenergy-estimationquantum-max-cut

There exists one uniform randomized classical polynomial-time algorithm that, for every finite graph GGG with nonnegative rational edge weights, returns a nonnegative rational estimate v(G,R)v(G,R)v(G,R) using its internal fair random bits RRR. For each fixed input graph,

0≤v(G,R)≤OPT(G)for every prescribed random tape R,0\le v(G,R)\le\mathrm{OPT}(G)\quad\text{for every prescribed random tape }R,0≤v(G,R)≤OPT(G)for every prescribed random tape R, ER[v(G,R)]≥0.562 OPT(G).\mathbb E_R[v(G,R)]\ge 0.562\,\mathrm{OPT}(G).ER​[v(G,R)]≥0.562OPT(G).

Here OPT(G)=λmax⁡(HG)\mathrm{OPT}(G)=\lambda_{\max}(H_G)OPT(G)=λmax​(HG​) for HG=∑i<jwij(I−SWAPij)H_G=\sum_{i<j}w_{ij}(I-\mathrm{SWAP}_{ij})HG​=∑i<j​wij​(I−SWAPij​), with the optimum over all normalized quantum states. The expectation is the uniform finite average over the algorithm's prescribed polynomial-length random tapes, separately for every input. Running time is polynomial on every run. This is an expected approximation ratio; a high-probability ratio would require an additional probability statement. Empty graphs and zero weights are included.

Preamble
import Definitions.Def_QuantumMaxCutEnergyEstimationModel
Formal statement
theorem QuantumMaxCutEnergy.exists_0562_approximation :
    ∃ A : QuantumMaxCutEnergy.Algorithm,
      QuantumMaxCutEnergy.PolynomialTime A ∧
      QuantumMaxCutEnergy.ApproximationRatio A (0.562 : ℝ) := by sorry
Source
Lee22; general-graph benchmark 0.562 in https://marwahaha.github.io/quantum-maxcut-reference/problems/qmc. Lee (ISAAC 2022), Theorem 12, analyzes randomized circuit parameters. For this numerical target, the efficiently computable energy lower bound in Lemma 11, Eq. (15), supplies the classical-output route. Sources: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.48. The exact finite-bit classical energy-estimation statement is the campaign target; it is not an assertion that the cited construction has been formalized.

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