Lemma 3.16 — balance-to-bipartiteness reduction
ProvedQuantumBipartiteTesting.Bipartiteness.lemma_3_16complexity-theorygraph-property-testingp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information
For every loopless signed colored graph whose three color classes are matchings, construct using the explicit paths and the vertices defined in the reduction layer. It is simple and has maximum degree at most three, and
There is a single finite constant such that every ordinary adjacency XOR query can be simulated by at most signed color-port XOR queries. The simulation is exact on every state of the logical query and answer registers, with input-independent gates and a clean embedding chosen before the signed graph. This supplies the operational reduction used by the goal theorem.
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
Preamble
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
Formal statement
namespace QuantumBipartiteTesting.Bipartiteness
open Finset
theorem lemma_3_16 :
(∀ n : ℕ, ∀ F : Finset (ColoredEdge n), Consistent F → ∀ b : ColoredEdge n → Bool,
IsGraph (Gadget F b) ∧ DegreeBound 3 (Gadget F b) ∧
(Bipartite (Gadget F b) ↔ Balanced F b) ∧
DeletionDistance (Gadget F b) = Frustration F b ∧
EditDistance (Gadget F b) = Frustration F b) ∧
(∃ K : ℕ, CoherentSimulation K) := by sorry
end QuantumBipartiteTesting.Bipartiteness
Source
Chandrima Kayal, Sayantan Sen, Dániel Szabó, STOC 2027 submission #878 (October 2026), Lemma 3.16, PDF = printed page 20. https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/878.pdf
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.