REVIEW 1 cited by
A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph Structure
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A PTAS for the Classical Ising Spin Glass Problem on the Chimera Graph Structure
read the original 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.
Forward citations
Cited by 1 Pith paper
-
A fidelity metric for quantum annealing benchmarked by extreme scaling quantum Monte-Carlo simulations
Introduces an equation-of-state accuracy metric ε for quantum annealing and benchmarks it via large-scale variational and Green-function quantum Monte Carlo simulations on Rydberg systems, reporting ε values of 10^{-2...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.