Fig. 8: Results on random graphs.
From: Vector Ising spin annealer for minimizing Ising Hamiltonians
a Boxplots of the proximity gap, defined as the ratio of the found objective to the Gurobi objective, for VISA, SVL, manifold reduction CIM, and CIM methods. The boxes represent the inter-quartile range, with error bars extending to the farthest data point lying within 1.5 times the inter-quartile range. The instances are divided equally between two graph topologies: dense, fully connected, and sparse three-regular graphs. In both cases, the matrix weight elements are drawn from the Gaussian distribution with zero mean and unit variance, resulting in instances belonging to the Sherrington-Kirkpatrick and weighted 3-regular Max-Cut problems. b Violin plots demonstrate the distribution of VISA's quality improvement performance compared to the best solution found by competing methods {SVL, MR-CIM, CIM} across the SK and 3-Regular QUBO benchmarks.
