  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.
