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

TL;DR

This paper presents a new method to convert 3-SAT problems into QUBO form, enabling more efficient quantum annealing solutions with fewer resources and improved solution quality, validated on a D-Wave quantum annealer.

Contribution

The paper introduces a more resource-efficient QUBO encoding for 3-SAT, reducing couplings and qubits compared to existing methods, enhancing practical quantum optimization.

Findings

Fewer couplings and qubits needed for 3-SAT to QUBO conversion.

Improved solution quality on quantum annealing hardware.

Validated approach on D-Wave quantum annealer.

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.