Name
Title | ||
|---|---|---|
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results |
Abstract | ||
|---|---|---|
Quantum annealers (QAs) are specialized quantum computers that minimize objective functions over discrete variables by physically exploiting quantum effects. Current QA platforms allow for the optimization of quadratic objectives defined over binary variables (qubits), also known as Ising problems. In the last decade, QA systems as implemented by D-Wave have scaled with Moore-like growth. Current architectures provide 2048 sparsely-connected qubits, and continued exponential growth is anticipated, together with increased connectivity. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ic.2020.104609 | Information and Computation |
Keywords | DocType | Volume |
Quantum annealing (QA),Quadratic unconstrained binary optimization (QUBO),Ising model,Satisfiability modulo theories,Optimization modulo theories,SAT,MaxSAT,Chimera graph | Journal | 275 |
ISSN | Citations | PageRank |
0890-5401 | 1 | 0.35 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhengbing Bian | 1 | 20 | 2.20 |
| Fabián A. Chudak | 2 | 439 | 42.54 |
| William G. Macready | 3 | 161 | 39.07 |
| Aidan Roy | 4 | 72 | 4.26 |
| Roberto Sebastiani | 5 | 2455 | 237.86 |
| Stefano Varotti | 6 | 5 | 0.78 |