Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication

Topics

Quantum Optimization

Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems

arXiv
Authors: Bas Lodewijks

Year

2019

Paper ID

14718

Status

Preprint

Abstract Read

~2 min

Abstract Words

45

Citations

N/A

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.

Why This Paper Matters

  • This paper contributes to the Quantum Optimization research area in the Quantum Articles archive.
  • It adds a 2019 reference point for readers tracking recent quantum research.
  • We discuss several mappings from well-known NP-hard problems to Quadratic Unconstrained Binary Optimisation problems which are treated incorrectly by Lucas.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in
Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:1911.08043 [2] arXiv https://arxiv.org/abs/1911.08043 [3] Publisher https://arxiv.org/abs/1911.08043

Local Citation Graph (Related-Paper Links)

Current Paper #14718

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.