Search
 
loader loading subjects...
cover
Quantum Annealing and the Satisfiability Problem
Kristen L. Pudenz, Gregory S. Tallant, Todd R. Belote, Steven H. Adachi
253 - 260
10.3233/978-1-61499-816-7-253
Advances in Parallel Computing
Volume 30: New Frontiers in High Performance Computing and Big Data
Abstract

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.

$35.00 / €27.50 / £22.00
Add PDF to cart