Ising Machines and Combinatorial Optimization Problem
T. Kawahara · 2025
The Ising machine is a computing model that efficiently solves combinatorial optimization problems. Unlike traditional architectures, it uses binary spin states and their interactions to perform sum-of-products and nonlinear operations. Originally developed for quantum devices, CMOS-based Ising machines are becoming more widespread. There are two main types: adjacent-coupled and fully coupled. The fully coupled type can solve complex problems by representing all spin interactions directly.