Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems
Data Structures and Algorithms
2020-08-04 v4 Statistical Mechanics
Computational Complexity
Quantum Physics
Abstract
We discuss several mappings from well-known NP-hard problems to Quadratic Unconstrained Binary Optimisation problems which are treated incorrectly by Lucas. We provide counterexamples and correct the mappings. We also extend the body of QUBO formulations of NP-complete and NP-hard optimisation problems by discussing additional problems.
Cite
@article{arxiv.1911.08043,
title = {Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems},
author = {Bas Lodewijks},
journal= {arXiv preprint arXiv:1911.08043},
year = {2020}
}
Comments
14 pages, 6 figures