Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

3-regular three-XORSAT planted solutions benchmark of classical and quantum heuristic optimizers

Journal Article · · Quantum Science and Technology
 [1];  [2];  [3];  [4]
  1. University of Southern California, Los Angeles, CA (United States); USRA Research Institute for Advanced Computer Science, Mountain View, CA (United States); NASA Ames Research Center, Moffett Field, CA (United States); OSTI
  2. University of New Mexico, Albuquerque, NM (United States)
  3. University of Southern California, Los Angeles, and Marina del Rey, CA (United States)
  4. University of Southern California, Los Angeles, CA (United States)
With current semiconductor technology reaching its physical limits, special-purpose hardware has emerged as an option to tackle specific computing-intensive challenges. Optimization in the form of solving quadratic unconstrained binary optimization problems, or equivalently Ising spin glasses, has been the focus of several new dedicated hardware platforms. These platforms come in many different flavors, from highly-efficient hardware implementations on digital-logic of established algorithms to proposals of analog hardware implementing new algorithms. In this work, we use a mapping of a specific class of linear equations whose solutions can be found efficiently, to a hard constraint satisfaction problem (three-regular three-XORSAT, or an Ising spin glass) with a 'golf-course' shaped energy landscape, to benchmark several of these different approaches. We perform a scaling and prefactor analysis of the performance of Fujitsu's digital annealer unit (DAU), the D-Wave advantage quantum annealer, a virtual MemComputing machine, Toshiba's simulated bifurcation machine (SBM), the SATonGPU algorithm from Bernaschi et al, and our implementation of parallel tempering. We identify the SATonGPU and DAU as currently having the smallest scaling exponent for this benchmark, with SATonGPU having a small scaling advantage and in addition having by far the smallest prefactor thanks to its use of massive parallelism. Furthermore, our work provides an objective assessment and a snapshot of the promise and limitations of dedicated optimization hardware relative to a particular class of optimization problems.
Research Organization:
California Institute of Technology (CalTech), Pasadena, CA (United States)
Sponsoring Organization:
US Army Research Office; USDOE Office of Science (SC), High Energy Physics (HEP)
Grant/Contract Number:
SC0019219
OSTI ID:
1979466
Journal Information:
Quantum Science and Technology, Journal Name: Quantum Science and Technology Journal Issue: 2 Vol. 7; ISSN 2058-9565
Publisher:
IOP PublishingCopyright Statement
Country of Publication:
United States
Language:
English

References (69)

A cluster Monte Carlo algorithm for 2-dimensional spin glasses journal August 2001
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem journal September 2008
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design journal October 2010
Adiabatic quantum programming: minor embedding with hard faults journal November 2013
Fast clique minor generation in Chimera qubit connectivity graphs journal October 2015
Garden optimization problems for benchmarking quantum annealers journal September 2021
borealis—A generalized global update algorithm for Boolean optimization problems journal March 2020
Roulette-wheel selection via stochastic acceptance journal March 2012
Tunable quantum tunnelling of magnetic domain walls journal October 2001
Quantum annealing with manufactured spins journal May 2011
Computational multiqubit tunnelling in programmable quantum annealers journal January 2016
Quantum annealing with all-to-all connected nonlinear oscillators journal June 2017
Thermally assisted quantum annealing of a 16-qubit problem journal May 2013
Coherent Ising machines—optical neural networks operating at the quantum limit journal December 2017
Analog errors in quantum annealing: doom and hope journal November 2019
Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network journal February 2016
Equation of State Calculations by Fast Computing Machines journal June 1953
Bounds for the adiabatic approximation with applications to quantum computation journal October 2007
Recycling random numbers in the stochastic simulation algorithm journal March 2013
Perspective: Memcomputing: Leveraging memory and physics to compute efficiently journal May 2018
A scalable readout system for a superconducting adiabatic quantum optimization system journal September 2010
A scalable control system for a superconducting adiabatic quantum optimization processor journal April 2010
Feedback-optimized parallel tempering Monte Carlo journal March 2006
Test-driving 1000 qubits journal June 2018
Analog errors in Ising machines journal April 2019
Monte Carlo sampling methods using Markov chains and their applications journal April 1970
Entropic barriers as a reason for hardness in both classical and quantum algorithms journal October 2021
Quantum search by local adiabatic evolution journal March 2002
Performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs journal November 2012
Consistency tests of classical and quantum models for a quantum annealer journal April 2015
Probing for quantum speedup in spin-glass problems with planted solutions journal October 2015
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
Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics versus quantum approaches journal August 2016
Equation Planting: A Tool for Benchmarking Ising Machines journal July 2019
Readiness of Quantum Optimization Machines for Industrial Applications journal July 2019
Optimally Stopped Optimization journal November 2016
Coherent Coupled Qubits for Quantum Annealing journal July 2017
Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor journal July 2010
Quantum annealing in the transverse Ising model journal November 1998
Domain-wall free energy of spin-glass models: Numerical method and boundary conditions journal October 1999
Complexity of several constraint-satisfaction problems using the heuristic classical algorithm WalkSAT journal July 2011
Rejection-free Monte Carlo sampling for general potentials journal February 2012
First-Order Transitions and the Performance of Quantum Algorithms in Random Optimization Problems journal May 2010
Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension journal August 2015
Temperature Scaling Law for Quantum Annealing Optimizers journal September 2017
Replica Monte Carlo Simulation of Spin-Glasses journal November 1986
Hiding Solutions in Random Satisfiability Problems: A Statistical Mechanics Approach journal April 2002
Perils of embedding for sampling problems journal April 2020
Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing journal July 2018
Fast, Lifetime-Preserving Readout for High-Coherence Quantum Annealers journal November 2020
Adiabatic quantum computation journal January 2018
STATICA: A 512-Spin 0.25M-Weight Annealing Processor With an All-Spin-Updates-at-Once Architecture for Combinatorial Optimization With Complete Spin–Spin Interactions journal January 2021
Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor journal August 2014
Memcomputing NP -complete problems in polynomial time using polynomial resources and collective states journal July 2015
Experimental investigation of performance differences between coherent Ising machines and a quantum annealer journal May 2019
Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems journal April 2019
High-performance combinatorial optimization based on classical mechanics journal February 2021
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem journal April 2001
Being Glassy Without Being Hard to Solve journal December 2010
Defining and detecting quantum speedup journal June 2014
Quantum Annealing of a Disordered Magnet journal April 1999
A fully programmable 100-spin coherent Ising machine with all-to-all connections journal October 2016
Exchange Monte Carlo Method and Application to Spin Glass Simulations journal June 1996
How we are leading a 3-XORSAT challenge: From the energy landscape to the algorithm and its efficient implementation on GPUs (a) journal March 2021
A ferromagnet with a glass transition journal August 2001
Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer journal April 2019
Methods of conjugate gradients for solving linear systems journal December 1952
Quantum Computation Based on Quantum Adiabatic Bifurcations of Kerr-Nonlinear Parametric Oscillators journal June 2019

Similar Records

Obstacles to quantum annealing in a planar embedding of XORSAT
Journal Article · Thu Aug 22 20:00:00 EDT 2019 · Physical Review. B · OSTI ID:1613164

The potential of quantum annealing for rapid solution structure identification
Journal Article · Tue Nov 17 19:00:00 EST 2020 · Constraints · OSTI ID:1759113