DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Probing for quantum speedup in spin-glass problems with planted solutions

Abstract

The availability of quantum annealing devices with hundreds of qubits has made the experimental demonstration of a quantum speedup for optimization problems a coveted, albeit elusive goal. Going beyond earlier studies of random Ising problems, here we introduce a method to construct a set of frustrated Ising-model optimization problems with tunable hardness. We study the performance of a D-Wave Two device (DW2) with up to 503 qubits on these problems and compare it to a suite of classical algorithms, including a highly optimized algorithm designed to compete directly with the DW2. The problems are generated around predetermined ground-state configurations, called planted solutions, which makes them particularly suitable for benchmarking purposes. The problem set exhibits properties familiar from constraint satisfaction (SAT) problems, such as a peak in the typical hardness of the problems, determined by a tunable clause density parameter. We bound the hardness regime where the DW2 device either does not or might exhibit a quantum speedup for our problem set. While we do not find evidence for a speedup for the hardest and most frustrated problems in our problem set, we cannot rule out that a speedup might exist for some of the easier, less frustrated problems. Our empiricalmore » findings pertain to the specific D-Wave processor and problem set we studied and leave open the possibility that future processors might exhibit a quantum speedup on the same problem set.« less

Authors:
 [1];  [2];  [1];  [3];  [3];  [2]
  1. Univ. of Southern California, Marina del Rey, CA (United States); Univ. of Southern California, Los Angeles, CA (United States)
  2. Univ. of Southern California, Los Angeles, CA (United States)
  3. Eidgenoessische Technische Hochschule, Zurich (Switzerland)
Publication Date:
Research Org.:
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States). Oak Ridge Leadership Computing Facility (OLCF)
Sponsoring Org.:
USDOE Office of Science (SC); US Army Research Office (ARO); Lockheed Martin Corporation; Swiss National Science Foundation (SNF); European Research Council (ERC)
OSTI Identifier:
1565492
Alternate Identifier(s):
OSTI ID: 1224652
Grant/Contract Number:  
AC05-00OR22725; W911NF-12-1-0523; W911NF-11-1-0268; SIMCOFE
Resource Type:
Accepted Manuscript
Journal Name:
Physical Review A - Atomic, Molecular, and Optical Physics
Additional Journal Information:
Journal Volume: 92; Journal Issue: 4; Journal ID: ISSN 1050-2947
Publisher:
American Physical Society (APS)
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; Optics; Physics

Citation Formats

Hen, Itay, Job, Joshua, Albash, Tameem, Rønnow, Troels F., Troyer, Matthias, and Lidar, Daniel A. Probing for quantum speedup in spin-glass problems with planted solutions. United States: N. p., 2015. Web. doi:10.1103/physreva.92.042325.
Hen, Itay, Job, Joshua, Albash, Tameem, Rønnow, Troels F., Troyer, Matthias, & Lidar, Daniel A. Probing for quantum speedup in spin-glass problems with planted solutions. United States. https://doi.org/10.1103/physreva.92.042325
Hen, Itay, Job, Joshua, Albash, Tameem, Rønnow, Troels F., Troyer, Matthias, and Lidar, Daniel A. Fri . "Probing for quantum speedup in spin-glass problems with planted solutions". United States. https://doi.org/10.1103/physreva.92.042325. https://www.osti.gov/servlets/purl/1565492.
@article{osti_1565492,
title = {Probing for quantum speedup in spin-glass problems with planted solutions},
author = {Hen, Itay and Job, Joshua and Albash, Tameem and Rønnow, Troels F. and Troyer, Matthias and Lidar, Daniel A.},
abstractNote = {The availability of quantum annealing devices with hundreds of qubits has made the experimental demonstration of a quantum speedup for optimization problems a coveted, albeit elusive goal. Going beyond earlier studies of random Ising problems, here we introduce a method to construct a set of frustrated Ising-model optimization problems with tunable hardness. We study the performance of a D-Wave Two device (DW2) with up to 503 qubits on these problems and compare it to a suite of classical algorithms, including a highly optimized algorithm designed to compete directly with the DW2. The problems are generated around predetermined ground-state configurations, called planted solutions, which makes them particularly suitable for benchmarking purposes. The problem set exhibits properties familiar from constraint satisfaction (SAT) problems, such as a peak in the typical hardness of the problems, determined by a tunable clause density parameter. We bound the hardness regime where the DW2 device either does not or might exhibit a quantum speedup for our problem set. While we do not find evidence for a speedup for the hardest and most frustrated problems in our problem set, we cannot rule out that a speedup might exist for some of the easier, less frustrated problems. Our empirical findings pertain to the specific D-Wave processor and problem set we studied and leave open the possibility that future processors might exhibit a quantum speedup on the same problem set.},
doi = {10.1103/physreva.92.042325},
journal = {Physical Review A - Atomic, Molecular, and Optical Physics},
number = 4,
volume = 92,
place = {United States},
year = {Fri Oct 23 00:00:00 EDT 2015},
month = {Fri Oct 23 00:00:00 EDT 2015}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record

Citation Metrics:
Cited by: 96 works
Citation information provided by
Web of Science

Save / Share:

Works referenced in this record:

A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
journal, April 2001


Quantum computers
journal, March 2010


Global energy minimum searches using an approximate solution of the imaginary time Schroedinger equation
journal, June 1993

  • Amara, Patricia; Hsu, D.; Straub, John E.
  • The Journal of Physical Chemistry, Vol. 97, Issue 25
  • DOI: 10.1021/j100127a023

Bucket elimination: A unifying framework for reasoning
journal, September 1999


Entanglement in a Quantum Annealing Processor
journal, May 2014


Quantum stochastic optimization
journal, December 1989


Determining computational complexity from characteristic ‘phase transitions’
journal, July 1999

  • Monasson, Rémi; Zecchina, Riccardo; Kirkpatrick, Scott
  • Nature, Vol. 400, Issue 6740
  • DOI: 10.1038/22055

The scaling window of the 2-SAT transition: Scaling Window of the 2-SAT Transition
journal, April 2001

  • Bollobás, Béla; Borgs, Christian; Chayes, Jennifer T.
  • Random Structures & Algorithms, Vol. 18, Issue 3
  • DOI: 10.1002/rsa.1006

Max 2-SAT with up to 108 qubits
journal, April 2014


Quantum annealing with manufactured spins
journal, May 2011

  • Johnson, M. W.; Amin, M. H. S.; Gildert, S.
  • Nature, Vol. 473, Issue 7346
  • DOI: 10.1038/nature10012

Thermally assisted quantum annealing of a 16-qubit problem
journal, May 2013

  • Dickson, N. G.; Johnson, M. W.; Amin, M. H.
  • Nature Communications, Vol. 4, Issue 1
  • DOI: 10.1038/ncomms2920

Robustness of adiabatic quantum computation
journal, December 2001


Evidence for quantum annealing with more than one hundred qubits
journal, February 2014

  • Boixo, Sergio; Rønnow, Troels F.; Isakov, Sergei V.
  • Nature Physics, Vol. 10, Issue 3
  • DOI: 10.1038/nphys2900

Complexity of Stoquastic Frustration-Free Hamiltonians
journal, January 2010

  • Bravyi, Sergey; Terhal, Barbara
  • SIAM Journal on Computing, Vol. 39, Issue 4
  • DOI: 10.1137/08072689X

Theory of Quantum Annealing of an Ising Spin Glass
journal, March 2002


Error-corrected quantum annealing with hundreds of qubits
journal, February 2014

  • Pudenz, Kristen L.; Albash, Tameem; Lidar, Daniel A.
  • Nature Communications, Vol. 5, Issue 1
  • DOI: 10.1038/ncomms4243

Quantum annealing: A new method for minimizing multidimensional functions
journal, March 1994


Quantum Annealing of a Disordered Magnet
journal, April 1999


Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
journal, October 2010


Hiding Quiet Solutions in Random Constraint Satisfaction Problems
journal, June 2009


Quantum annealing: The fastest route to quantum computation?
journal, February 2015


Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model
journal, September 2002


Quantum adiabatic Markovian master equations
journal, December 2012


Jeffreys' prior is asymptotically least favorable under entropy risk
journal, August 1994


Sherrington-Kirkpatrick model in a transverse field: Absence of replica symmetry breaking due to quantum fluctuations
journal, June 1989


Colloquium : Quantum annealing and analog quantum computation
journal, September 2008


Collective Monte Carlo Updating for Spin Systems
journal, January 1989


Quantum annealing in the transverse Ising model
journal, November 1998


Defining and detecting quantum speedup
journal, June 2014


Spin glasses: Experimental facts, theoretical concepts, and open questions
journal, October 1986


Quantum and classical dynamics in adiabatic computation
journal, October 2014


Optimization by Simulated Annealing
journal, May 1983


Goals and opportunities in quantum simulation
journal, April 2012

  • Cirac, J. Ignacio; Zoller, Peter
  • Nature Physics, Vol. 8, Issue 4
  • DOI: 10.1038/nphys2275

Experimental signature of programmable quantum annealing
journal, June 2013

  • Boixo, Sergio; Albash, Tameem; Spedalieri, Federico M.
  • Nature Communications, Vol. 4, Issue 1
  • DOI: 10.1038/ncomms3067

Reexamining classical and quantum models for the D-Wave One processor: The role of excited states and ground state degeneracy
journal, February 2015

  • Albash, T.; Rønnow, T. F.; Troyer, M.
  • The European Physical Journal Special Topics, Vol. 224, Issue 1
  • DOI: 10.1140/epjst/e2015-02346-0

Quantum versus classical annealing of Ising spin glasses
journal, March 2015


Quantum computers
journal, December 2002


Complexity of stoquastic frustration-free Hamiltonians
text, January 2008


Hiding Quiet Solutions in Random Constraint Satisfaction Problems
text, January 2009


Quantum Adiabatic Markovian Master Equations
text, January 2012


Entanglement in a quantum annealing processor
text, January 2014


Architectural considerations in the design of a superconducting quantum annealing processor
text, January 2014


Consistency Tests of Classical and Quantum Models for a Quantum Annealer
text, January 2014


Quantum annealing correction for random Ising problems
text, January 2014


Quantum Annealing of a Disordered Magnet
text, January 2001


Works referencing / citing this record:

Enhancing quantum annealing performance for the molecular similarity problem
journal, April 2017


Boosting quantum annealer performance via sample persistence
journal, May 2017


Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
journal, November 2018


How quantum is the speedup in adiabatic unstructured search?
journal, April 2019


Hard combinatorial problems and minor embeddings on lattice graphs
journal, May 2019


On the computational complexity of curing non-stoquastic Hamiltonians
journal, April 2019


Quantum annealing versus classical machine learning applied to a simplified computational biology problem
journal, February 2018


Analog errors in quantum annealing: doom and hope
journal, November 2019


An approach to quantum-computational hydrologic inverse analysis
journal, May 2018


Unraveling Quantum Annealers using Classical Hardness
journal, October 2015

  • Martin-Mayor, Victor; Hen, Itay
  • Scientific Reports, Vol. 5, Issue 1
  • DOI: 10.1038/srep15324

Maximum-Entropy Inference with a Programmable Annealer
journal, March 2016

  • Chancellor, Nicholas; Szoke, Szilard; Vinci, Walter
  • Scientific Reports, Vol. 6, Issue 1
  • DOI: 10.1038/srep22318

Quantum information processing with superconducting circuits: a review
journal, September 2017


Machine learning & artificial intelligence in the quantum domain: a review of recent progress
journal, June 2018


Estimating the density of states of frustrated spin systems
journal, July 2019


Analog nature of quantum adiabatic unstructured search
journal, November 2019

  • Slutskii, Mikhail; Albash, Tameem; Barash, Lev
  • New Journal of Physics, Vol. 21, Issue 11
  • DOI: 10.1088/1367-2630/ab51f9

The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)
journal, July 2017

  • Mandrà, Salvatore; Katzgraber, Helmut G.; Thomas, Creighton
  • Quantum Science and Technology, Vol. 2, Issue 3
  • DOI: 10.1088/2058-9565/aa7877

A deceptive step towards quantum speedup detection
journal, July 2018

  • Mandrà, Salvatore; Katzgraber, Helmut G.
  • Quantum Science and Technology, Vol. 3, Issue 4
  • DOI: 10.1088/2058-9565/aac8b2

Analog errors in Ising machines
journal, April 2019

  • Albash, Tameem; Martin-Mayor, Victor; Hen, Itay
  • Quantum Science and Technology, Vol. 4, Issue 2
  • DOI: 10.1088/2058-9565/ab13ea

Searching for quantum speedup in quasistatic quantum annealers
journal, November 2015


Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities
journal, January 2016


Direct comparison of quantum and simulated annealing on a fully connected Ising ferromagnet
journal, August 2017


Nested quantum annealing correction at finite temperature: p -spin models
journal, June 2019


Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
journal, April 2019


Equation Planting: A Tool for Benchmarking Ising Machines
journal, July 2019


From near to eternity: Spin-glass planting, tiling puzzles, and constraint-satisfaction problems
journal, April 2018


Temperature Scaling Law for Quantum Annealing Optimizers
journal, September 2017


Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
journal, July 2018


A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
journal, August 2019

  • Abbott, Alastair A.; Calude, Cristian S.; Dinneen, Michael J.
  • International Journal of Quantum Information, Vol. 17, Issue 05
  • DOI: 10.1142/s0219749919500424

Deploying a quantum annealing processor to detect tree cover in aerial imagery of California
journal, February 2017


Quantum Robotics: A Primer on Current Science and Future Perspectives
journal, January 2017


Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
journal, April 2019


A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing—Abridged Version
journal, July 2018

  • Abbott, Alastair A.; Calude, Cristian S.; Dinneen, Michael J.
  • Electronic Proceedings in Theoretical Computer Science, Vol. 273
  • DOI: 10.4204/eptcs.273.1

Maximum-Entropy Inference with a Programmable Annealer
text, January 2016


Unraveling Quantum Annealers using Classical Hardness
text, January 2015


What is the Computational Value of Finite Range Tunneling?
text, January 2015


Driver Hamiltonians for constrained optimization in quantum annealing
text, January 2016


Readiness of Quantum Optimization Machines for Industrial Applications
text, January 2017


A deceptive step towards quantum speedup detection
text, January 2017


From Near to Eternity: Spin-glass planting, tiling puzzles, and constraint satisfaction problems
text, January 2017


Nested Quantum Annealing Correction at Finite Temperature: $p$-spin models
text, January 2018


Uncertain fate of fair sampling in quantum annealing
text, January 2018


Estimating the Density of States of Frustrated Spin Systems
text, January 2018


Taming a non-convex landscape with dynamical long-range order: memcomputing Ising benchmarks
text, January 2018


Analog Nature of Quantum Adiabatic Unstructured Search
text, January 2019