Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems
Bas Lodewijks
TL;DR
This paper corrects and extends mappings of NP-hard and NP-complete problems to QUBO formulations, addressing inaccuracies in prior work and broadening the scope of problems represented.
Contribution
It provides corrected mappings from NP-hard problems to QUBO, including new formulations for additional problems, improving the accuracy and scope of QUBO representations.
Findings
Corrected inaccuracies in previous NP-hard problem mappings
Extended QUBO formulations to include more problems
Provided counterexamples to previous claims
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Quantum Computing Algorithms and Architecture · Polynomial and algebraic computation