primary paper · identifier verified 2026-07-29
Ising formulations of many NP problems
Andrew Lucas · 2013
- Identifier
- arXiv:1302.5843
- Canonical URL
- https://arxiv.org/abs/1302.5843
Why it is in this atlas
Catalogues explicit Ising encodings for NP-hard problems — the step that turns a combinatorial problem into a spin model a tensor network can act on.
Claims citing this source
- tn-007 · Established resultQuadratic unconstrained binary optimization problems map exactly onto Ising spin models, and explicit Ising formulations exist for a catalogue of NP-hard problems.
- tn-013 · Active researchWhether QAOA delivers a practical advantage over strong classical baselines on real optimization instances remains unresolved.