Ising Formulations of Many NP Problems

Andrew Lucas

Computing Research Repository (CoRR)（2013）

Harvard University

被引用1965|浏览39

摘要

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.

更多

查看译文

关键词

Algorithms,complexity theory,spin glasses,adiabatic quantum computation,NP