The pitfalls of planar spin-glass benchmarks: Raising the bar for quantum annealers (again)

S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, Optimization by simulated annealing , Science 220

1983

Earlier work this paper cites.

T. Kadowaki and H. Nishimori, Quantum annealing in the transverse Ising model , Phys. Rev. E 58

1998

Earlier work this paper cites.

E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum Computation by Adiabatic Evolution (2000), arXiv:quant-ph/0001106

2000

Earlier work this paper cites.

A. K. Hartmann and H. Rieger, Optimization Algorithms in Physics (Wiley-VCH, Berlin, 2001)

2001

Earlier work this paper cites.

F. Hamze and N. de Freitas, in Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence (AUAI Press, Arlington, Virginia, United States, 2004), UAI ’04, p. 243, ISBN 0-9749039-0-6

2004

Earlier work this paper cites.

A. K. Hartmann and H. Rieger, New Optimization Algorithms in Physics (Wiley-VCH, Berlin, 2004)

2004

Earlier work this paper cites.

V. Kolmogorov, Blossom V: A new implementation of a minimum cost perfect matching algorithm , Math. Prog. Comp. 1

2009

Earlier work this paper cites.

T. F. Rønnow, Z. Wang, J. Job, S. Boixo, S. V. Isakov, D. Wecker, J. M. Martinis, D. A. Lidar, and M. Troyer, Defining and detecting quantum speedup , Science 345

2014

Earlier work this paper cites.

S. Boixo, T. F. Rønnow, S. V. Isakov, Z. Wang, D. Wecker, D. A. Lidar, J. M. Martinis, and M. Troyer, Evidence for quantum annealing with more than one hundred qubits , Nat. Phys. 10

2014

Cited alongside, same era.

H. G. Katzgraber, F. Hamze, and R. S. Andrist, Glassy Chimeras Could Be Blind to Quantum Speedup: Designing Better Benchmarks for Quantum Annealing Machines , Phys. Rev. X 4

2014

Cited alongside, same era.

P. Bunyk, E. Hoskinson, M. W. Johnson, E. Tolkacheva, F. Altomare, A. J. Berkley, R. Harris, J. P. Hilton, T. Lanting, and J. Whittaker, Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor , IEEE Trans. Appl. Supercond. 24

2014

Cited alongside, same era.

A. Selby, Efficient subgraph-based sampling of Ising-type models with frustration (2014), (arXiv:cond-mat/1409.3934)

2014

Cited alongside, same era.

Z. Zhu, A. J. Ochoa, and H. G. Katzgraber, Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension , Phys. Rev. Lett. 115

2015

Later among the works it cites.

A. D. King, T. Lanting, and R. Harris, Performance of a quantum annealer on range-limited constraint satisfaction problems (2015), arXiv:1502.02098

Original

2015

Later among the works it cites.

V. S. Denchev, S. Boixo, S. V. Isakov, N. Ding, R. Babbush, V. Smelyanskiy, J. Martinis, and H. Neven, What is the Computational Value of Finite Range Tunneling? , Phys. Rev. X 6

2016

Later among the works it cites.

S. Mandrà, Z. Zhu, W. Wang, A. Perdomo-Ortiz, and H. G. Katzgraber, Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics versus quantum approaches , Phys. Rev. A 94

2016

Later among the works it cites.