Efficient optimization accelerator framework for multi-state spin Ising problems.

Abstract

Ising Machines are emerging hardware architectures that efficiently solve NP-hard combinatorial optimization problems. Generally, combinatorial problems are transformed into quadratic unconstrained binary optimization (QUBO) form, but this transformation often complicates the solution landscape, degrading performance, especially for multi-state problems. To address this challenge, we model spin interactions as generalized boolean logic function to significantly reduce the exploration space. We demonstrate the effectiveness of our approach on graph coloring problem using probabilistic Ising solvers, achieving similar accuracy compared to state-of-the-art heuristics and machine learning algorithms. It also shows significant improvement over state-of-the-art QUBO-based Ising solvers, including probabilistic Ising and simulated bifurcation machines. We also design 1024-neuron all-to-all connected probabilistic Ising accelerator on FPGA with the proposed approach that shows <math xmlns="http://www.w3.org/1998/Math/MathML"><mo>~</mo></math> 10000 <math xmlns="http://www.w3.org/1998/Math/MathML"><mo>×</mo></math> performance acceleration compared to GPU-based Tabucol heuristics and reducing physical neurons by 1.5 <math xmlns="http://www.w3.org/1998/Math/MathML"><mo>-</mo></math> 4 <math xmlns="http://www.w3.org/1998/Math/MathML"><mo>×</mo></math> over baseline Ising frameworks. Thus, this work establishes superior efficiency, scalability and solution quality for multi-state optimization problems.