International Conference on Theory and Applications of Satisfiability Testing

Theory and Applications of Satisfiability Testing -- SAT 2015 pp 104-120

Constructing SAT Filters with a Quantum Annealer

Open AccessConference paper

DOI: 10.1007/978-3-319-24318-4_9

Volume 9340 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Douglass A., King A.D., Raymond J. (2015) Constructing SAT Filters with a Quantum Annealer. In: Heule M., Weaver S. (eds) Theory and Applications of Satisfiability Testing -- SAT 2015. Lecture Notes in Computer Science, vol 9340. Springer, Cham

Abstract

SAT filters are a novel and compact data structure that can be used to quickly query a word for membership in a fixed set. They have the potential to store more information in a fixed storage limit than a Bloom filter. Constructing a SAT filter requires sampling diverse solutions to randomly constructed constraint satisfaction instances, but there is flexibility in the choice of constraint satisfaction problem. Presented here is a case study of SAT filter construction with a focus on constraint satisfaction problems based on MAX-CUT clauses (Not-all-equal 3-SAT, 2-in-4-SAT, etc.) and frustrated cycles in the Ising model. Solutions are sampled using a D-Wave quantum annealer, and results are measured against classical approaches. The SAT variants studied are of interest in the context of SAT filters, independent of the solvers used.

Keywords

SAT filter Quantum annealing Ising model Maximum cut Sampling Constraint satisfaction problem 
Download to read the full conference paper text

Copyright information

© Springer International Publishing Switzerland 2015

Open Access This chapter is distributed under the terms of the Creative Commons Attribution Noncommercial License, which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

Authors and Affiliations

  1. 1.D-Wave Systems Inc.BurnabyCanada