Constructing SAT Filters with a Quantum Annealer

DOI10.1007/978-3-319-24318-4_9zbMath1471.68242MaRDI QIDQ3453216

Andrew D. King, Jack Raymond, Adam Douglass

Publication date: 20 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24318-4_9

zbMATH Keywords

sampling; maximum cut; Ising model; constraint satisfaction problem; quantum annealing; SAT filter

Mathematics Subject Classification ID

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68P05: Data structures

68Q12: Quantum algorithms and complexity in the theory of computing

Uses Software

• Walksat
• DIMACS
• sharpSAT