Garden optimization problems for benchmarking quantum annealers

Abstract

We benchmark the 5000+ qubit system Advantage coupled with the Hybrid Solver Service 2 released by D-Wave Systems Inc. in September 2020 by using a new class of optimization problems called garden optimization problems known in companion planting. These problems are scalable to an arbitrarily large number of variables and intuitively find application in real-world scenarios. We derive their QUBO formulation and illustrate their relation to the quadratic assignment problem. We demonstrate that the Advantage system and the new hybrid solver can solve larger problems in less time than their predecessors. However, we also show that the solvers based on the 2000+ qubit system DW2000Q sometimes produce more favourable results if they can solve the problems.

arXiv commentopen-source code available at https://jugit.fz-juelich.de/qip/garden-optimization-problem.git

References in corpus (14)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Annealing in the Transverse Ising Model
• Quantum Annealing: A New Method for Minimizing Multidimensional Functions
• Architectural considerations in the design of a superconducting quantum annealing processor
• Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
• Support vector machines on the D-Wave quantum annealer
• Searching for quantum speedup in quasistatic quantum annealers
• Benchmarking the Quantum Approximate Optimization Algorithm
• Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
• Quantum adiabatic machine learning
• Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
• SU(2) lattice gauge theory on a quantum annealer
• Readiness of Quantum Optimization Machines for Industrial Applications
• Larger Sparse Quadratic Assignment Problem Optimization Using Quantum Annealing and a Bit-Flip Heuristic Algorithm

Cited by in corpus (6)

• 3-Regular 3-XORSAT Planted Solutions Benchmark of Classical and Quantum Heuristic Optimizers
• GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
• Quantum Annealing for Jet Clustering with Thrust
• Guided quantum walk
• Test Case Minimization with Quantum Annealers
• Quantum Annealing based Power Grid Partitioning for Parallel Simulation