A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph Structure

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 [MW13]. The result follows from a direct application of the techniques used by Bansal, Bravyi and Terhal [BBT09] 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.

By: Rishi Saket

Published in: RC25390 in 2013


Questions about this service can be mailed to reports@us.ibm.com .