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

Title: Comparing three generations of D-Wave quantum annealers for minor embedded combinatorial optimization problems

Journal Article · · Quantum Science and Technology

Quantum annealing (QA) is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. QA in the transverse Ising model, implemented on D-Wave quantum processing units, are available as cloud computing resources. In this study we report concise benchmarks across three generations of D-Wave quantum annealers, consisting of four different devices, for the NP-hard discrete combinatorial optimization problems unweighted maximum clique and unweighted maximum cut on random graphs. The Ising, or equivalently quadratic unconstrained binary optimization, formulation of these problems do not require auxiliary variables for order reduction, and their overall structure and weights are not highly variable, which makes these problems simple test cases to understand the sampling capability of current D-Wave quantum annealers. All-to-all minor embeddings of size 52, with relatively uniform chain lengths, are used for a direct comparison across the Chimera, Pegasus, and Zephyr device topologies. A grid-search over annealing times and the minor embedding chain strengths is performed in order to determine the level of reasonable performance for each device and problem type. Experiment metrics that are reported are approximation ratios for non-broken chain samples, chain break proportions, and time-to-solution for the maximum clique problem instances. How fairly the quantum annealers sample optimal maximum cliques, for instances which contain multiple maximum cliques, is quantified using entropy of the measured ground state distributions. The newest generation of quantum annealing hardware, which has a Zephyr hardware connectivity, performed the best overall with respect to approximation ratios and chain break frequencies.

Research Organization:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Organization:
USDOE; USDOE Laboratory Directed Research and Development (LDRD) Program; USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
89233218CNA000001
OSTI ID:
2514499
Report Number(s):
LA-UR--23-20101
Journal Information:
Quantum Science and Technology, Journal Name: Quantum Science and Technology Journal Issue: 2 Vol. 10; ISSN 2058-9565
Publisher:
IOP PublishingCopyright Statement
Country of Publication:
United States
Language:
English

References (77)

A Mathematical Theory of Communication journal July 1948
Solving Large Maximum Clique Problems on a Quantum Annealer book January 2019
Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies book June 2020
The maximum clique problem journal April 1994
Fast clique minor generation in Chimera qubit connectivity graphs journal October 2015
Efficiently embedding QUBO problems on adiabatic quantum computers journal March 2019
Hard combinatorial problems and minor embeddings on lattice graphs journal May 2019
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems journal April 2022
Finding Maximum Cliques on the D-Wave Quantum Annealer journal May 2018
Factoring larger integers with fewer qubits via quantum annealing with optimized parameters journal January 2019
Charged particle tracking with quantum annealing optimization journal November 2021
Benchmarking Quantum Annealing Against “Hard” Instances of the Bipartite Matching Problem journal February 2021
Quantum annealing: A new method for minimizing multidimensional functions journal March 1994
An exact algorithm for the maximum clique problem journal November 1990
Random generation of combinatorial structures from a uniform distribution journal January 1986
A fast algorithm for the maximum clique problem journal August 2002
Support vector machines on the D-Wave quantum annealer journal March 2020
Computational overhead of locality reduction in binary optimization problems journal December 2021
A review on algorithms for maximum clique problems journal May 2015
Quantum annealing with manufactured spins journal May 2011
Thermally assisted quantum annealing of a 16-qubit problem journal May 2013
Scaling advantage over path-integral Monte Carlo in quantum simulation of geometrically frustrated magnets journal February 2021
Analog errors in quantum annealing: doom and hope journal November 2019
Coherent quantum annealing in a programmable 2,000 qubit Ising chain journal September 2022
Quantum critical dynamics in a 5,000-qubit programmable spin glass journal April 2023
SciPy 1.0: fundamental algorithms for scientific computing in Python journal February 2020
Advantages of Unfair Quantum Ground-State Sampling journal April 2017
Quantum Annealing for Prime Factorization journal December 2018
Parallel quantum annealing journal March 2022
Quantum annealing algorithms for Boolean tensor networks journal May 2022
Prime factorization using quantum annealing and computational algebraic geometry journal February 2017
Mathematical foundation of quantum annealing journal December 2008
Optimization using quantum mechanics: quantum annealing through adiabatic evolution journal August 2006
Perspectives of quantum annealing: methods and implementations journal May 2020
Quantum annealing for industry applications: introduction and review journal September 2022
Ground-state statistics from annealing algorithms: quantum versus classical approaches journal July 2009
Quantum annealing for problems with ground-state degeneracy journal January 2009
Benchmarking embedded chain breaking in quantum annealing * journal March 2022
Quantum-Field-Theoretic Simulation Platform for Observing the Fate of the False Vacuum journal March 2021
Quantum Annealing Simulation of Out-of-Equilibrium Magnetization in a Spin-Chain Compound journal July 2021
Embedding Overhead Scaling of Optimization Problems in Quantum Annealing journal November 2021
Uncertain fate of fair sampling in quantum annealing journal September 2019
Improving nonstoquastic quantum annealing with spin-reversal transformations journal July 2021
Perils of embedding for quantum sampling journal February 2022
Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers journal April 2019
Benchmarking Quantum Annealing Controls with Portfolio Optimization journal January 2021
Improving quantum annealing of the ferromagnetic p -spin model through pausing journal July 2019
Experimental realization of classical Z 2 spin liquids in a programmable quantum device journal August 2021
Quantum annealing in the transverse Ising model journal November 1998
Fair sampling of ground-state configurations of binary optimization problems journal June 2019
Exponentially Biased Ground-State Sampling of Quantum Annealing Machines with Transverse-Field Driving Hamiltonians journal February 2017
Perils of embedding for sampling problems journal April 2020
Entanglement in a Quantum Annealing Processor journal May 2014
Quantum Optimization of Fully Connected Spin Glasses journal September 2015
Colloquium : Quantum annealing and analog quantum computation journal September 2008
Reducing Binary Quadratic Forms for More Scalable Quantum Annealing conference November 2017
Advanced unembedding techniques for quantum annealers conference December 2020
Matplotlib: A 2D Graphics Environment journal January 2007
Sampling on NISQ Devices: "Who’s the Fairest One of All?" conference October 2021
Suppressing Epidemics in Networks Using Priority Planning journal October 2016
Transformation of General Binary MRF Minimization to the First-Order Case journal June 2011
Solving the Max-Flow Problem on a Quantum Annealing Computer journal January 2020
Benchmarking Hamiltonian Noise in the D-Wave Quantum Annealer journal January 2021
Single-Qubit Fidelity Assessment of Quantum Annealing Hardware journal January 2021
Defining and detecting quantum speedup journal June 2014
Quantum Annealing of a Disordered Magnet journal April 1999
Phase transitions in a programmable quantum spin glass simulator journal July 2018
Qubit spin ice journal July 2021
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? journal January 2007
Fair Sampling Error Analysis on NISQ Devices journal June 2022
Assessment of Quantum Annealing for the Construction of Satisfiability Filters journal April 2017
Quantum Computing in the NISQ era and beyond journal August 2018
Exploring Network Structure, Dynamics, and Function using NetworkX conference June 2008
Factoring on a quantum annealing computer journal March 2019
Satisfiability-based Set Membership Filters
  • Weaver, Sean A.; Ray, Katrina J.; Marek, Victor W.
  • Journal on Satisfiability, Boolean Modeling and Computation, Vol. 8, Issue 3-4 https://doi.org/10.3233/SAT190095
journal January 2014
Ising formulations of many NP problems journal January 2014
Benchmark Test of Black-box Optimization Using D-Wave Quantum Annealer journal June 2021