Assessing Solution Quality of 3SAT on a Quantum Annealing Platform
Emerging Technologies
2019-02-14 v1 Computational Complexity
Quantum Physics
Abstract
When solving propositional logic satisfiability (specifically 3SAT) using quantum annealing, we analyze the effect the difficulty of different instances of the problem has on the quality of the answer returned by the quantum annealer. A high-quality response from the annealer in this case is defined by a high percentage of correct solutions among the returned answers. We show that the phase transition regarding the computational complexity of the problem, which is well-known to occur for 3SAT on classical machines (where it causes a detrimental increase in runtime), persists in some form (but possibly to a lesser extent) for quantum annealing.
Keywords
Cite
@article{arxiv.1902.04703,
title = {Assessing Solution Quality of 3SAT on a Quantum Annealing Platform},
author = {Thomas Gabor and Sebastian Zielinski and Sebastian Feld and Christoph Roch and Christian Seidel and Florian Neukart and Isabella Galter and Wolfgang Mauerer and Claudia Linnhoff-Popien},
journal= {arXiv preprint arXiv:1902.04703},
year = {2019}
}
Comments
13 pages, published at QTOP 2019