-
Notifications
You must be signed in to change notification settings - Fork 1
Description
Source: GraphPartitioning
Target: SpinGlass
Motivation: Maps graph bisection to the Ising model, enabling solvers from statistical physics and quantum computing; the natural formulation in spin variables.
Reference: Barahona, 1982; Lucas, 2014
Reduction Algorithm
Notation:
- Source: undirected graph
$G = (V, E)$ ,$n = |V|$ (even),$m = |E|$ - Target: SpinGlass (Ising model) with
$n$ spin variables$s_i \in {-1, +1}$
Variable mapping:
where
Ising Hamiltonian:
An edge
The balance constraint
Setting
Equivalently, the coupling constants are:
-
$J_{uv} = -1/2$ for$(u,v) \in E$ (antiferromagnetic — prefers aligned spins = uncut edges) -
$J_{ij} = P$ for all pairs (balance enforcement via a global field)
Solution extraction:
Size Overhead
| Target metric (code name) | Polynomial (using symbols above) |
|---|---|
num_spins |
|
num_couplings |
|
Validation Method
Closed-loop testing: solve GraphPartitioning by brute-force, solve the reduced SpinGlass, and verify both give the same optimal partition.
Example
Source: 6 vertices, 9 edges:
SpinGlass: 6 spins, couplings
Optimal:
Cut edges: