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 »
- Authors:
-
- Univ. of Southern California, Marina del Rey, CA (United States); Univ. of Southern California, Los Angeles, CA (United States)
- Univ. of Southern California, Los Angeles, CA (United States)
- 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}
}
Web of Science
Works referenced in this record:
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
journal, April 2001
- Farhi, E.; Goldstone, J.; Gutmann, S.
- Science, Vol. 292, Issue 5516
Quantum computers
journal, March 2010
- Ladd, T. D.; Jelezko, F.; Laflamme, R.
- Nature, Vol. 464, Issue 7285
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
Bucket elimination: A unifying framework for reasoning
journal, September 1999
- Dechter, Rina
- Artificial Intelligence, Vol. 113, Issue 1-2
Entanglement in a Quantum Annealing Processor
journal, May 2014
- Lanting, T.; Przybysz, A. J.; Smirnov, A. Yu.
- Physical Review X, Vol. 4, Issue 2
Quantum stochastic optimization
journal, December 1989
- Apolloni, B.; Carvalho, C.; de Falco, D.
- Stochastic Processes and their Applications, Vol. 33, Issue 2
Determining computational complexity from characteristic ‘phase transitions’
journal, July 1999
- Monasson, Rémi; Zecchina, Riccardo; Kirkpatrick, Scott
- Nature, Vol. 400, Issue 6740
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
Max 2-SAT with up to 108 qubits
journal, April 2014
- Santra, Siddhartha; Quiroz, Gregory; Ver Steeg, Greg
- New Journal of Physics, Vol. 16, Issue 4
Quantum annealing with manufactured spins
journal, May 2011
- Johnson, M. W.; Amin, M. H. S.; Gildert, S.
- Nature, Vol. 473, Issue 7346
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
Robustness of adiabatic quantum computation
journal, December 2001
- Childs, Andrew M.; Farhi, Edward; Preskill, John
- Physical Review A, Vol. 65, Issue 1
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
Complexity of Stoquastic Frustration-Free Hamiltonians
journal, January 2010
- Bravyi, Sergey; Terhal, Barbara
- SIAM Journal on Computing, Vol. 39, Issue 4
Theory of Quantum Annealing of an Ising Spin Glass
journal, March 2002
- Santoro, G. E.
- Science, Vol. 295, Issue 5564
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
Quantum annealing: A new method for minimizing multidimensional functions
journal, March 1994
- Finnila, A. B.; Gomez, M. A.; Sebenik, C.
- Chemical Physics Letters, Vol. 219, Issue 5-6
Quantum Annealing of a Disordered Magnet
journal, April 1999
- Brooke, J.
- Science, Vol. 284, Issue 5415
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
journal, October 2010
- Choi, Vicky
- Quantum Information Processing, Vol. 10, Issue 3
Hiding Quiet Solutions in Random Constraint Satisfaction Problems
journal, June 2009
- Krzakala, Florent; Zdeborová, Lenka
- Physical Review Letters, Vol. 102, Issue 23
Quantum annealing: The fastest route to quantum computation?
journal, February 2015
- Suzuki, Sei; Das, Arnab
- The European Physical Journal Special Topics, Vol. 224, Issue 1
Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model
journal, September 2002
- Martoňák, Roman; Santoro, Giuseppe E.; Tosatti, Erio
- Physical Review B, Vol. 66, Issue 9
Quantum adiabatic Markovian master equations
journal, December 2012
- Albash, Tameem; Boixo, Sergio; Lidar, Daniel A.
- New Journal of Physics, Vol. 14, Issue 12
Jeffreys' prior is asymptotically least favorable under entropy risk
journal, August 1994
- Clarke, Bertrand S.; Barron, Andrew R.
- Journal of Statistical Planning and Inference, Vol. 41, Issue 1
Sherrington-Kirkpatrick model in a transverse field: Absence of replica symmetry breaking due to quantum fluctuations
journal, June 1989
- Ray, P.; Chakrabarti, B. K.; Chakrabarti, Arunava
- Physical Review B, Vol. 39, Issue 16
Colloquium : Quantum annealing and analog quantum computation
journal, September 2008
- Das, Arnab; Chakrabarti, Bikas K.
- Reviews of Modern Physics, Vol. 80, Issue 3
Collective Monte Carlo Updating for Spin Systems
journal, January 1989
- Wolff, Ulli
- Physical Review Letters, Vol. 62, Issue 4
Quantum annealing in the transverse Ising model
journal, November 1998
- Kadowaki, Tadashi; Nishimori, Hidetoshi
- Physical Review E, Vol. 58, Issue 5
Defining and detecting quantum speedup
journal, June 2014
- Ronnow, T. F.; Wang, Z.; Job, J.
- Science, Vol. 345, Issue 6195
Spin glasses: Experimental facts, theoretical concepts, and open questions
journal, October 1986
- Binder, K.; Young, A. P.
- Reviews of Modern Physics, Vol. 58, Issue 4
Quantum and classical dynamics in adiabatic computation
journal, October 2014
- Crowley, P. J. D.; Đurić, T.; Vinci, W.
- Physical Review A, Vol. 90, Issue 4
Optimization by Simulated Annealing
journal, May 1983
- Kirkpatrick, S.; Gelatt, C. D.; Vecchi, M. P.
- Science, Vol. 220, Issue 4598
Goals and opportunities in quantum simulation
journal, April 2012
- Cirac, J. Ignacio; Zoller, Peter
- Nature Physics, Vol. 8, Issue 4
Experimental signature of programmable quantum annealing
journal, June 2013
- Boixo, Sergio; Albash, Tameem; Spedalieri, Federico M.
- Nature Communications, Vol. 4, Issue 1
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
Quantum versus classical annealing of Ising spin glasses
journal, March 2015
- Heim, B.; Ronnow, T. F.; Isakov, S. V.
- Science, Vol. 348, Issue 6231
Complexity of stoquastic frustration-free Hamiltonians
text, January 2008
- Bravyi, Sergey; Terhal, Barbara
- arXiv
Hiding Quiet Solutions in Random Constraint Satisfaction Problems
text, January 2009
- Krzakala, Florent; Zdeborová, Lenka
- arXiv
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
text, January 2010
- Choi, Vicky
- arXiv
Quantum Adiabatic Markovian Master Equations
text, January 2012
- Albash, Tameem; Boixo, Sergio; Lidar, Daniel A.
- arXiv
Entanglement in a quantum annealing processor
text, January 2014
- Lanting, T.; Przybysz, A. J.; Smirnov, A. Yu.
- arXiv
Architectural considerations in the design of a superconducting quantum annealing processor
text, January 2014
- Bunyk, P. I.; Hoskinson, E.; Johnson, M. W.
- arXiv
Consistency Tests of Classical and Quantum Models for a Quantum Annealer
text, January 2014
- Albash, Tameem; Vinci, Walter; Mishra, Anurag
- arXiv
Quantum annealing correction for random Ising problems
text, January 2014
- Pudenz, Kristen L.; Albash, Tameem; Lidar, Daniel A.
- arXiv
Quantum Annealing of a Disordered Magnet
text, January 2001
- Brooke, J.; Bitko, D.; Rosenbaum, T. F.
- arXiv
Hiding solutions in random satisfiability problems: A statistical mechanics approach
text, January 2001
- Barthel, W.; Hartmann, A. K.; Leone, M.
- arXiv
Works referencing / citing this record:
Enhancing quantum annealing performance for the molecular similarity problem
journal, April 2017
- Hernandez, Maritza; Aramon, Maliheh
- Quantum Information Processing, Vol. 16, Issue 5
Boosting quantum annealer performance via sample persistence
journal, May 2017
- Karimi, Hamed; Rosenberg, Gili
- Quantum Information Processing, Vol. 16, Issue 7
Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
journal, November 2018
- Wang, Chi; Jonckheere, Edmond
- Quantum Information Processing, Vol. 18, Issue 1
How quantum is the speedup in adiabatic unstructured search?
journal, April 2019
- Hen, Itay
- Quantum Information Processing, Vol. 18, Issue 6
Hard combinatorial problems and minor embeddings on lattice graphs
journal, May 2019
- Lucas, Andrew
- Quantum Information Processing, Vol. 18, Issue 7
On the computational complexity of curing non-stoquastic Hamiltonians
journal, April 2019
- Marvian, Milad; Lidar, Daniel A.; Hen, Itay
- Nature Communications, Vol. 10, Issue 1
Quantum annealing versus classical machine learning applied to a simplified computational biology problem
journal, February 2018
- Li, Richard Y.; Di Felice, Rosa; Rohs, Remo
- npj Quantum Information, Vol. 4, Issue 1
Analog errors in quantum annealing: doom and hope
journal, November 2019
- Pearson, Adam; Mishra, Anurag; Hen, Itay
- npj Quantum Information, Vol. 5, Issue 1
An approach to quantum-computational hydrologic inverse analysis
journal, May 2018
- O’Malley, Daniel
- Scientific Reports, Vol. 8, Issue 1
Unraveling Quantum Annealers using Classical Hardness
journal, October 2015
- Martin-Mayor, Victor; Hen, Itay
- Scientific Reports, Vol. 5, Issue 1
Maximum-Entropy Inference with a Programmable Annealer
journal, March 2016
- Chancellor, Nicholas; Szoke, Szilard; Vinci, Walter
- Scientific Reports, Vol. 6, Issue 1
Quantum information processing with superconducting circuits: a review
journal, September 2017
- Wendin, G.
- Reports on Progress in Physics, Vol. 80, Issue 10
Machine learning & artificial intelligence in the quantum domain: a review of recent progress
journal, June 2018
- Dunjko, Vedran; Briegel, Hans J.
- Reports on Progress in Physics, Vol. 81, Issue 7
Estimating the density of states of frustrated spin systems
journal, July 2019
- Barash, Lev; Marshall, Jeffrey; Weigel, Martin
- New Journal of Physics, Vol. 21, Issue 7
Analog nature of quantum adiabatic unstructured search
journal, November 2019
- Slutskii, Mikhail; Albash, Tameem; Barash, Lev
- New Journal of Physics, Vol. 21, Issue 11
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
A deceptive step towards quantum speedup detection
journal, July 2018
- Mandrà, Salvatore; Katzgraber, Helmut G.
- Quantum Science and Technology, Vol. 3, Issue 4
Analog errors in Ising machines
journal, April 2019
- Albash, Tameem; Martin-Mayor, Victor; Hen, Itay
- Quantum Science and Technology, Vol. 4, Issue 2
Searching for quantum speedup in quasistatic quantum annealers
journal, November 2015
- Amin, Mohammad H.
- Physical Review A, Vol. 92, Issue 5
Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities
journal, January 2016
- Zhu, Zheng; Ochoa, Andrew J.; Schnabel, Stefan
- Physical Review A, Vol. 93, Issue 1
Direct comparison of quantum and simulated annealing on a fully connected Ising ferromagnet
journal, August 2017
- Wauters, Matteo M.; Fazio, Rosario; Nishimori, Hidetoshi
- Physical Review A, Vol. 96, Issue 2
Nested quantum annealing correction at finite temperature: -spin models
journal, June 2019
- Matsuura, Shunji; Nishimori, Hidetoshi; Vinci, Walter
- Physical Review A, Vol. 99, Issue 6
Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
journal, April 2019
- Marshall, Jeffrey; Venturelli, Davide; Hen, Itay
- Physical Review Applied, Vol. 11, Issue 4
Equation Planting: A Tool for Benchmarking Ising Machines
journal, July 2019
- Hen, Itay
- Physical Review Applied, Vol. 12, Issue 1
Site- and bond-percolation thresholds in -based lattices: Vulnerability of quantum annealers to random qubit and coupler failures on chimera topologies
journal, April 2016
- Melchert, O.; Katzgraber, Helmut G.; Novotny, M. A.
- Physical Review E, Vol. 93, Issue 4
From near to eternity: Spin-glass planting, tiling puzzles, and constraint-satisfaction problems
journal, April 2018
- Hamze, Firas; Jacob, Darryl C.; Ochoa, Andrew J.
- Physical Review E, Vol. 97, Issue 4
Temperature Scaling Law for Quantum Annealing Optimizers
journal, September 2017
- Albash, Tameem; Martin-Mayor, Victor; Hen, Itay
- Physical Review Letters, Vol. 119, Issue 11
Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
journal, July 2018
- Albash, Tameem; Lidar, Daniel A.
- Physical Review X, Vol. 8, Issue 3
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
Deploying a quantum annealing processor to detect tree cover in aerial imagery of California
journal, February 2017
- Boyda, Edward; Basu, Saikat; Ganguly, Sangram
- PLOS ONE, Vol. 12, Issue 2
Quantum Robotics: A Primer on Current Science and Future Perspectives
journal, January 2017
- Tandon, Prateek; Lam, Stanley; Shih, Ben
- Synthesis Lectures on Quantum Computing, Vol. 6, Issue 1
Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
journal, April 2019
- Aramon, Maliheh; Rosenberg, Gili; Valiante, Elisabetta
- Frontiers in Physics, Vol. 7
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
Maximum-Entropy Inference with a Programmable Annealer
text, January 2016
- Nicholas, Chancellor,; Szilard, Szoke,; Walter, Vinci,
- ETH Zurich
Unraveling Quantum Annealers using Classical Hardness
text, January 2015
- Martin-Mayor, Victor; Hen, Itay
- arXiv
Searching for quantum speedup in quasistatic quantum annealers
text, January 2015
- Amin, Mohammad
- arXiv
What is the Computational Value of Finite Range Tunneling?
text, January 2015
- Denchev, Vasil S.; Boixo, Sergio; Isakov, Sergei V.
- arXiv
Driver Hamiltonians for constrained optimization in quantum annealing
text, January 2016
- Hen, Itay; Sarandy, Marcelo S.
- arXiv
Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
text, January 2016
- Mandrà, Salvatore; Zhu, Zheng; Wang, Wenlong
- arXiv
Quantum information processing with superconducting circuits: a review
text, January 2016
- Wendin, G.
- arXiv
Demonstration of a scaling advantage for a quantum annealer over simulated annealing
text, January 2017
- Albash, Tameem; Lidar, Daniel A.
- arXiv
Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods
text, January 2017
- Karimi, Hamed; Rosenberg, Gili; Katzgraber, Helmut G.
- arXiv
Readiness of Quantum Optimization Machines for Industrial Applications
text, January 2017
- Perdomo-Ortiz, Alejandro; Feldman, Alexander; Ozaeta, Asier
- arXiv
A deceptive step towards quantum speedup detection
text, January 2017
- Mandrà, Salvatore; Katzgraber, Helmut G.
- arXiv
From Near to Eternity: Spin-glass planting, tiling puzzles, and constraint satisfaction problems
text, January 2017
- Hamze, Firas; Jacob, Darryl C.; Ochoa, Andrew J.
- arXiv
Quantum annealing versus classical machine learning applied to a simplified computational biology problem
text, January 2018
- Li, Richard Y.; Di Felice, Rosa; Rohs, Remo
- arXiv
Nested Quantum Annealing Correction at Finite Temperature: $p$-spin models
text, January 2018
- Matsuura, Shunji; Nishimori, Hidetoshi; Vinci, Walter
- arXiv
Uncertain fate of fair sampling in quantum annealing
text, January 2018
- Könz, Mario S.; Mazzola, Guglielmo; Ochoa, Andrew J.
- arXiv
Estimating the Density of States of Frustrated Spin Systems
text, January 2018
- Barash, Lev; Marshall, Jeffrey; Weigel, Martin
- arXiv
Taming a non-convex landscape with dynamical long-range order: memcomputing Ising benchmarks
text, January 2018
- Sheldon, Forrest; Traversa, Fabio L.; Di Ventra, Massimiliano
- arXiv
Hard combinatorial problems and minor embeddings on lattice graphs
preprint, January 2018
- Lucas, Andrew
- arXiv
Analog Nature of Quantum Adiabatic Unstructured Search
text, January 2019
- Slutskii, Mikhail; Albash, Tameem; Barash, Lev
- arXiv