Performance of quantum annealing inspired algorithms for combinatorial optimization problems
Abstract Two classes of quantum-annealing-inspired-algorithms (QAIA), namely different variants of simulated coherent Ising machine and simulated bifurcation, have sony c been proposed for efficiently solving combinatorial optimization problems recently.In order to certify the superiority of these algorithms, standardized comparisons among them and