A proof-of-principle experiment on the spontaneous symmetry breaking machine and numerical estimation of its performance on the $K_{2000}$ benchmark problem
Toshiya Sato, Takashi Goh
TL;DR
This work introduces the spontaneous symmetry breaking machine (SSBM) as a photonic, dissipative simulator for combinatorial optimization, and validates its operation experimentally on a 16-node MaxCut3 instance. It then develops an evolved, nested-action version of SSBM and performs extensive numerical simulations on the large-scale $K_{2000}$ benchmark, demonstrating convergence to a single stable state with a cut value reaching 99.7% of the best-known result. The findings highlight a novel duality between SSBM states and Ising-model stable states, identify dynamic asymmetries and competition between dynamics and pseudo-spin interactions, and propose practical paths to scale and stabilize the approach. Overall, SSBM shows promise as a high-performance, low-variability COP solver with unique dynamics distinct from existing Ising machines, while indicating clear avenues for further refinement.
Abstract
In a previous paper, we proposed a unique physically implemented type simulator for combinatorial optimization problems, called the spontaneous symmetry breaking machine (SSBM). In this paper, we first report the results of experimental verification of SSBM using a small-scale benchmark system, and then describe numerical simulations using the benchmark problems (K2000) conducted to confirm its usefulness for large-scale problems. From 1000 samples with different initial fluctuations, it became clear that SSBM can explore a single extremely stable state. This is based on the principle of a phenomenon used in SSBM, and could be a notable advantage over other simulators.
