Optimized QUBO formulation methods for quantum computing

Speaker
Dario De Santis
Affiliation
Scuola Normale Superiore
Date
2024-09-19
Time
11:00
Venue
ON-SITE NEST Meeting Room ONLINE https://tinyurl.com/NanoColloquia
Host
Fabio Taddei
Several combinatorial optimization problems can be solved with a quantum computer once that a corresponding quadratic unconstrained binary optimization (QUBO) form is derived, namely a quadratic form that has no constraint attached. The aim of this work is to drastically reduce the variables needed for these QUBO reformulations in order to unlock the possibility to efficiently obtain optimal solutions for a class of optimization problems with quantum devices already available today. This is achieved by introducing novel tools that allow an efficient use of slack variables, even for problems with non-linear constraints, without the need to approximate the starting problem. We divide our new techniques in two independent parts: the iterative quadratic polynomial and the master-satellite methods. Hence, we show how to apply our techniques in case of an NP-hard optimization problem inspired by a real-world financial scenario called Max-Profit Balance Settlement. We follow by submitting several instances of this problem to two D-wave quantum annealers, namely quantum devices specifically designed to solve QUBO problems, comparing the performances of our novel approach with standard methods.