Fig. 4: Benchmark analysis of Möbius Ladder graphs.

a Möbius Ladder graph with different numbers of vertices (V = 20, 40, 60, 80, 100). b The ground state solutions and resulting max-cut values for the Möbius Ladder graphs in (a). c Max-cut results for various Möbius Ladder graphs. Measured probability of achieving the ground state in a single run, as a function of the number of vertices. Multiple 100-run batches were performed for each graph to obtain the standard deviations, which are shown as error bars. d Histogram of obtained solutions in 100 runs for Möbius Ladder graphs with 40 vertices. e Histogram of obtained solutions in 100 runs for Möbius Ladder graph with 80 vertices