Hybrid quantum annealing for larger-than-QPU lattice-structured problems

Abstract

Quantum processing units (QPUs) executing annealing algorithms have shown promise in optimization and simulation applications. Hybrid algorithms are a natural bridge to additional applications of larger scale. We present a straightforward and effective method for solving larger-than-QPU lattice-structured Ising optimization problems. Performance is compared against simulated annealing with promising results, and improvement is shown as a function of the generation of D-Wave QPU used.

21 pages, 15 figures, supplementary code attachment

References in corpus (5)

• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
• Probing Noise in Flux Qubits via Macroscopic Resonant Tunneling
• Comparing Monte Carlo methods for finding ground states of Ising spin glasses: population annealing, simulated annealing and parallel tempering
• Quantum versus classical annealing: insights from scaling theory and results for spin glasses on 3-regular graphs

Cited by in corpus (8)

• An Optimization Case Study for solving a Transport Robot Scheduling Problem on Quantum-Hybrid and Quantum-Inspired Hardware
• Hybrid adiabatic quantum computing for tomographic image reconstruction -- opportunities and limitations
• Many-body quantum sign structures as non-glassy Ising models
• A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
• Hyperoptimized approximate contraction of tensor networks for rugged-energy-landscape spin glasses on periodic square and cubic lattices
• Enhancing Quantum Algorithms for Quadratic Unconstrained Binary Optimization via Integer Programming
• Testing Quantum and Simulated Annealers on the Drone Delivery Packing Problem
• Limitations in Parallel Ising Machine Networks: Theory and Practice