Assessment of Quantum Annealing for the Construction of Satisfiability Filters

TL;DR

This paper evaluates the effectiveness of quantum annealing in constructing satisfiability filters, finding it less effective than classical methods in generating diverse solutions needed for filter construction.

Contribution

It provides a comparative analysis of quantum annealing, simulated annealing, and walkSAT for generating solutions for satisfiability filters, highlighting the limitations of quantum approaches.

Findings

Quantum annealing finds less disparate solutions than classical methods.

Classical methods outperform quantum annealing in solution diversity.

Quantum annealing is less suitable for satisfiability filter construction.

Abstract

Satisfiability filters, introduced by S. A. Weaver et al. in 2014, are a new and promising type of filters to address set membership testing. In order to construct satisfiability filters, it is necessary to find disparate solutions to hard random $k$-SAT problems. This paper compares simulated annealing, simulated quantum annealing and walkSAT, an open-source SAT solver, in terms of their ability to find such solutions. The results indicate that solutions found by simulated quantum annealing are generally less disparate than solutions found by the other solvers and therefore less useful for the construction of satisfiability filters.