Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1 — quantum bipartiteness testing lower bound

Proved
QuantumBipartiteTesting.Bipartiteness.theorem_3_1

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

complexity-theorygraph-property-testingp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information

For each fixed degree bound d≥3d\ge3d≥3, there is ε0(d)∈(0,1)\varepsilon_0(d)\in(0,1)ε0​(d)∈(0,1) such that, for every fixed 0<ε≤ε0(d)0<\varepsilon\le\varepsilon_0(d)0<ε≤ε0​(d), positive constants c(ε,d)c(\varepsilon,d)c(ε,d) and N0(ε,d)≥2N_0(\varepsilon,d)\ge2N0​(ε,d)≥2 exist with the following property. Every quantum tester on N≥N0N\ge N_0N≥N0​ vertices that accepts every bipartite simple graph and rejects every graph at edge-edit distance at least εNd\varepsilon NdεNd from bipartiteness, with success probability at least 2/32/32/3 on each promise class, uses

q≥c(ε,d)N1/3log⁡N.q\ge c(\varepsilon,d)\frac{N^{1/3}}{\log N}.q≥c(ε,d)logNN1/3​.

The bound is uniform over all valid neighbor orderings, all finite complex workspaces, all injective binary response encodings, and every sufficiently large integer input size, including sizes not divisible by seven. The distance is minimized over actual target graphs. This is the source's full bipartiteness result, with its small-epsilon standing convention made explicit.

Differences from the source:

  • encoding: vertices [N], distinct undirected edges and color-labeled parallel edges → Fin N; oriented unordered pairs; color included in each edge identifier; reason: bijections relabel vertices; differently colored parallel constraints remain distinct
  • encoding: finite quantum query circuits with binary encoded outcomes and arbitrary workspace → published QueryAlg, arbitrary finite complex registers, injective null-zero bit encoding, unitary XOR oracle, input-independent output event; reason: every finite workspace is represented up to a basis bijection; unused answer bit strings and dummy vertex queries are retained
  • encoding: fixed d and sufficiently small fixed epsilon under Remark 2.4; Omega(N^(1/3)/log N) → for d>=3 choose epsilon0(d)>0, then c(epsilon,d)>0 and N0(epsilon,d)>=2, uniformly over every N>=N0 and every tester; reason: expands the source standing conventions; natural logarithms change only the positive leading constant; every sufficiently large size is included
Preamble
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
Formal statement
namespace QuantumBipartiteTesting.Bipartiteness

/-- Remark 2.4 and the fixed-degree convention are quantified explicitly. -/
theorem theorem_3_1 (d : ℕ) (hd : 3 ≤ d) :
    ∃ ε₀ : ℝ, 0 < ε₀ ∧ ε₀ < 1 ∧ ∀ ε : ℝ, 0 < ε → ε ≤ ε₀ →
    ∃ c : ℝ, 0 < c ∧ ∃ N₀ : ℕ, 2 ≤ N₀ ∧ ∀ N ≥ N₀, ∀ k w q : ℕ,
    ∀ E : Encoding (Fin N) k, ∀ A : Algorithm (Address N d) k w q,
    ∀ out : (Address N d × Bits k) × Fin w → Bool,
      BipartiteTester ε E A out → c * LowerBoundScale N ≤ (q : ℝ) := by sorry

end QuantumBipartiteTesting.Bipartiteness
Source
Chandrima Kayal, Sayantan Sen, Dániel Szabó, STOC 2027 submission #878 (October 2026), Theorem 3.1, PDF = printed page 12. https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/878.pdf Repeated with proof on PDF = printed page 21.
Human review
  • Endorsed by Shuze Chen · Nov 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 9, 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