Fig. 6: Analysis of cyclic graphs.
From: Vector Ising spin annealer for minimizing Ising Hamiltonians
a, b J − G cyclic graphs for N = 8 with k = 2 and k = 3, respectively. c The matrix structure J for k = 3, where the color coding represents Jij = 0 (white), −1 (blue), −J (red), and −G (green). d The ground states and (e) leading eigenvalue states for k = 2 within the J − G space. f Delineation of the energy and eigenvalue boundaries, with the pink region indicating discrepancies between ground and maximal eigenvalue states. Easy-hard transitions in the J−G space are indicated by solid red lines. g–i Extension of the analysis to k = 3.
