Constructing SAT Filters with a Quantum Annealer

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

Adam Douglass, Andrew D. King, Jack Raymond

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

samplingmaximum cutIsing modelconstraint satisfaction problemquantum annealingSAT filter

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results

Uses Software

• Walksat
• DIMACS
• sharpSAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations
• Reconstruction on trees and spin glass transition
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• Random generation of combinatorial structures from a uniform distribution
• The Power of 1 + α for Memory-Efficient Bloom Filters
• An Ising Model Inspired Extension of the Product-Based MP Framework for SAT
• An Optimal Bloom Filter Replacement Based on Matrix Solving
• Information, Physics, and Computation
• A Space Lower Bound for Dynamic Approximate Membership Data Structures
• Space/time trade-offs in hash coding with allowable errors

This page was built for publication: Constructing SAT Filters with a Quantum Annealer