A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph Structure
arXiv:1306.6943
Abstract
We present a polynomial time approximation scheme (PTAS) for the minimum value of the classical Ising Hamiltonian with linear terms on the Chimera graph structure as defined in the recent work of McGeoch and Wang. The result follows from a direct application of the techniques used by Bansal, Bravyi and Terhal who gave a PTAS for the same problem on planar and, in particular, grid graphs. We also show that on Chimera graphs, the trivial lower bound is within a constant factor of the optimum.
6 pages, corrected PTAS running time
Cited by in corpus (5)
- Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
- How "Quantum" is the D-Wave Machine?
- Benchmarking a quantum annealing processor with the time-to-target metric
- Temperature scaling law for quantum annealing optimizers
- A note on QUBO instances defined on Chimera graphs