Ising formulations of many NP problems
Statistical Mechanics
2014-01-28 v3 Computational Complexity
Data Structures and Algorithms
Quantum Physics
Abstract
We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This collects and extends mappings to the Ising model from partitioning, covering and satisfiability. In each case, the required number of spins is at most cubic in the size of the problem. This work may be useful in designing adiabatic quantum optimization algorithms.
Keywords
Cite
@article{arxiv.1302.5843,
title = {Ising formulations of many NP problems},
author = {Andrew Lucas},
journal= {arXiv preprint arXiv:1302.5843},
year = {2014}
}
Comments
27 pages; v2: substantial revision to intro/conclusion, many more references; v3: substantial revision and extension, to-be-published version