How to Approximate any Objective Function via Quadratic Unconstrained Binary Optimization
Thomas Gabor (Ludwig Maximilians University)
Marian Lingsch Rosenfeld (Ludwig Maximilians University)
Claudia Linnhoff-Popien (Ludwig Maximilians University)
S. Feld (TU Delft - Quantum Circuit Architectures and Technology)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Quadratic unconstrained binary optimization (QUBO) has become the standard format for optimization using quantum computers, i.e., for both the quantum approximate optimization algorithm (QAOA) and quantum annealing (QA). We present a toolkit of methods to transform almost arbitrary problems to QUBO by (i) approximating them as a polynomial and then (ii) translating any polynomial to QUBO. We showcase the usage of our approaches on two example problems (ratio cut and logistic regression).