ImPACT Program Advanced Information Society Infrastructure Linking Quantum Artificial Brains in Quantum Network

Overview

HOME > Overview

Performance of Stanford Coherent Ising Machine

The NP-hard MAX-CUT problem considered to be the most difficult problem in computational theory is being targeted for use as a benchmark. This graph shows the results of evaluating the exact-solution correct-answer rate versus problem size of a sparse graph called a Möbius ladder. For problem size N = 100, an optimal solution from approximately 1030 candidates can be output with a 21% success probability.