The utility of satisfiability (SAT) as an application focused hard computational problem is well established. We explore the potential of quantum annealing to enhance classical SAT solving, especially where sampling from the space of all possible solutions is of interest. We address the formulation of SAT problems to make them suitable for commercial quantum annealers, practical concerns in their implementation, and how the performance of the resulting quantum solver compares to and complements classical SAT solvers.
@article{arxiv.1612.07258,
title = {Quantum Annealing and the Satisfiability Problem},
author = {Kristen L. Pudenz and Gregory S. Tallant and Todd R. Belote and Steven H. Adachi},
journal= {arXiv preprint arXiv:1612.07258},
year = {2016}
}