Work

SAT, gadgets, Max2XOR, and quantum annealers

Year: 2025

Type: article

Abstract: Quantum annealers are presented as quantum computers that can, with a high probability, optimize certain quadratic functions on Boolean variables in constant time. These functions are basically the Hamiltonian of Ising models that reach the ground energy state with a high probability after an annealing process. In some preliminary works, they have been proposed as a way to solve SAT. These Hamiltonians can be seen as Max2XOR problems, i.e., as the problem of finding an assignment that maximizes the number of XOR clauses of at most two variables that are satisfied. In this paper, we focus on introducing several gadgets to reduce SAT to Max2XOR. We show how they can be used to translate SAT instances to initial configurations of a quantum annealer.

Source: Quantum Information Processing

DOI: 10.1007/s11128-025-04948-7

Authors: Carlos Ansótegui, Jordi Levy

Institutions: Universitat de Lleida, Consejo Superior de Investigaciones Científicas, Artificial Intelligence Research Institute

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,990

Funder: Agencia Estatal de Investigación