Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms

01/19/2021
by   Gian Giacomo Guerreschi, et al.
0

Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several approximate methods have been devised to reduce such cost. With the growing maturity of quantum computing, quantum algorithms have been proposed to speed up the solution by using either quantum annealers or universal quantum computers. Here we apply the divide-and-conquer approach to reduce the original problem to a collection of smaller problems whose solutions can be assembled to form a single Polynomial Binary Unconstrained Optimization instance with fewer variables. This technique can be applied to any QUBO instance and leads to either an all-classical or a hybrid quantum-classical approach. When quantum heuristics like the Quantum Approximate Optimization Algorithm (QAOA) are used, our proposal leads to a double advantage: a substantial reduction of quantum resources, specifically an average of  42 random 3-regular graphs, together with an improvement in the quality of the approximate solutions reached.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/23/2022

Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization

We present a hybrid classical-quantum framework based on the Frank-Wolfe...
research
04/29/2020

Insights on Training Neural Networks for QUBO Tasks

Current hardware limitations restrict the potential when solving quadrat...
research
11/01/2022

Quantum-inspired optimization for routing and wavelength assignment

Problems related to routing and wavelength assignment (RWA) in optical c...
research
11/13/2018

A Tutorial on Formulating and Using QUBO Models

Recent years have witnessed the remarkable discovery that the Quadratic ...
research
09/21/2023

Variational Quantum Harmonizer: Generating Chord Progressions and Other Sonification Methods with the VQE Algorithm

This work investigates a case study of using physical-based sonification...
research
06/14/2023

Qubit efficient quantum algorithms for the vehicle routing problem on quantum computers of the NISQ era

The vehicle routing problem with time windows (VRPTW) is a classic optim...
research
10/12/2022

Efficient Hamiltonian Reduction for Quantum Annealing on SatCom Beam Placement Problem

Beam Placement (BP) is a well-known problem in Low-Earth Orbit (LEO) sat...

Please sign up or login with your details

Forgot password? Click here to reset