We introduce a novel approach to translate arbitrary 3-SAT instances to Quadratic Unconstrained Binary Optimization (QUBO) as they are used by quantum annealing (QA) or the quantum approximate optimization algorithm (QAOA). Our approach requires fewer couplings and fewer physical qubits than the current state-of-the-art, which results in higher solution quality. We verified the practical applicability of the approach by testing it on a D-Wave quantum annealer.
@article{arxiv.2302.03536,
title = {Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization},
author = {Jonas Nüßlein and Sebastian Zielinski and Thomas Gabor and Claudia Linnhoff-Popien and Sebastian Feld},
journal= {arXiv preprint arXiv:2302.03536},
year = {2023}
}