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.

翻译：伊辛机是用于求解NP难优化问题的专用硬件求解器。然而，它们并不总能找到最优解。找到该最优解的概率取决于所求解的具体问题。通过使用延拓方法，我们证明该概率与最优解的分岔序列密切相关。基于此分岔分析，我们可以评估求解方案的有效性。此外，我们发现伊辛机实现方式的恰当选择能够显著改变该分岔序列，从而大幅提高找到最优解的概率。