Using continuation methods to analyse the difficulty of problems solved by Ising machines
Jacob Lamers, Guy Verschaffelt, Guy Van der Sande
TL;DR
The paper analyzes how continuation methods can reveal the difficulty of solving Ising-model problems with Ising machines by tracking the bifurcation sequence of the optimal solution. It demonstrates that the problem class (spectral easy, Ising easy, Ising hard) depends on both problem structure and the machine's nonlinear implementation, and that changing the nonlinearity can dramatically alter the bifurcation topology to make hard problems easier. By exploring third-order, fifth-order, and sigmoid nonlinearities, the authors show that introducing additional degrees of freedom in the transfer function can connect the ground-state branch to the origin through saddle-node or cusp points, thereby increasing the fraction of problems solvable by annealing. The work provides a practical framework for designing Ising-machine implementations and shows that continuation analysis can serve as both a diagnostic tool and a solver for Ising networks, albeit with caveats regarding noise in physical devices.
Abstract
Ising machines are dedicated hardware solvers of NP-hard optimization problems. However, they do not always find the most optimal solution. The probability of finding this optimal solution depends on the problem at hand. Using continuation methods, we show that this is closely linked to the bifurcation sequence of the optimal solution. From this bifurcation analysis, we can determine the effectiveness of solution schemes. Moreover, we find that the proper choice of implementation of the Ising machine can drastically change this bifurcation sequence and therefore vastly increase the probability of finding the optimal solution.
