Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results
- 1 December 2020
- journal article
- research article
- Published by Elsevier in Information and Computation
- Vol. 275
Abstract
No abstract availableKeywords
Funding Information
- D-Wave Systems Inc.
This publication has 38 references indexed in Scilit:
- Steiner Tree Approximation via Iterative Randomized RoundingJournal of the ACM, 2013
- Quantum annealing with manufactured spinsNature, 2011
- Cotunneling in pairs of coupled flux qubitsPhysical Review B, 2010
- Experimental demonstration of a robust and scalable flux qubitPhysical Review B, 2010
- sgen1ACM Journal of Experimental Algorithmics, 2010
- Quantum annealing in the transverse Ising modelPhysical Review E, 1998
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner TreesJournal of Algorithms, 1995
- Efficient and effective placement for very large circuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- Quantum annealing: A new method for minimizing multidimensional functionsChemical Physics Letters, 1994