Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization

More Info
expand_more

Abstract

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.

Files

978-3-031-36030-5_3.pdf
(pdf | 0.445 Mb)
- Embargo expired in 10-02-2025
Unknown license