Design and FPGA Realization of QUBO hardware accelerator for MAX-CUT problem
Maciej Lewandowski, Piotr Dudek
Combinatorial optimization problems are fundamental to many industrial and scientific applications, but are often NP-hard, requiring heuristic and probabilistic approaches to find good solutions fast. This paper presents the first hardware implementation of the neuromorphic-inspired NeuroSA algorithm, for accelerating Quadratic Unconstrained Binary Optimization (QUBO) problems. We show that it is possible to run a standard QUBO benchmark problem with 800 variables on a low-cost FPGA with a clock speed of approximately 144 MHz, which converges to the same solution value found by the numerical solver.
IEEE International Symposium on Circuits and Systems proceedings•May 25, 2025•2 citations