Assessment of Quantum Annealing for the Construction of Satisfiability Filters
Marlon Azinović, Daniel Herr, Bettina Heim, Ethan Brown, Matthias Troyer
SciPost Phys. 2, 013 (2017) · published 7 April 2017
- doi: 10.21468/SciPostPhys.2.2.013
- Submissions/Reports
Abstract
Satisfiability filters, introduced by S. A. Weaver et al. in 2014, are a new and promising type of filters to address set membership testing. In order to construct satisfiability filters, it is necessary to find disparate solutions to hard random $k$-SAT problems. This paper compares simulated annealing, simulated quantum annealing and walkSAT, an open-source SAT solver, in terms of their ability to find such solutions. The results indicate that solutions found by simulated quantum annealing are generally less disparate than solutions found by the other solvers and therefore less useful for the construction of satisfiability filters.
Cited by 14
Authors / Affiliations: mappings to Contributors and Organizations
See all Organizations.- 1 Marlon Azinović,
- 1 2 Daniel Herr,
- 1 Bettina Heim,
- 3 Ethan Brown,
- 1 4 Matthias Troyer
- 1 Eidgenössische Technische Hochschule Zürich / Swiss Federal Institute of Technology in Zurich (ETH) [ETH Zurich]
- 2 理化学研究所 / RIKEN [RIKEN]
- 3 Mindi Technologies Ltd.
- 4 Microsoft
- Aspen Center for Physics (ACP) (through Organization: Aspen Center For Physics [ACP])
- Intelligence Advanced Research Projects Activity (IARPA) (through Organization: Office of the Director of National Intelligence [ODNI])
- National Science Foundation [NSF]
- Office of the Director of National Intelligence [ODNI]
- U.S. Department of Defense (DOD) (through Organization: United States Department of Defense [DOD])