pith. sign in

arxiv: 1302.5843 · v3 · pith:7CWJNXJMnew · submitted 2013-02-23 · ❄️ cond-mat.stat-mech · cs.CC· cs.DS· quant-ph

Ising formulations of many NP problems

Andrew Lucas This is my paper
classification ❄️ cond-mat.stat-mech cs.CCcs.DSquant-ph
keywords isingproblemsformulationsmanynp-completeadiabaticalgorithmscase
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Towards Classical Software Verification using Quantum Computers

    quant-ph 2024-04 unverdicted novelty 4.0

    The authors convert classical software bug detection into quantum optimization instances and test QAOA, Grover, and QSVT on small examples for potential polynomial speedup.

  2. Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics

    quant-ph 2026-05 unverdicted novelty 1.0

    Quantum annealing is described as a heuristic for discrete optimization and sampling that also serves as a platform for studying non-equilibrium many-body quantum dynamics with programmable spin systems.