AI Chat AI Image Generator AI Video Text to Speech

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

11/18/2019

∙

by Bas Lodewijks, et al.

∙

∙

We discuss several mappings from well-known NP-hard problems to Quadratic Unconstrained Binary Optimisation problems which are treated incorrectly by Lucas in <cit.>. 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.

page 1

page 2

page 3

page 4

research

∙ 11/22/2017

Shellability is NP-complete

We prove that for every d≥ 2, deciding if a pure, d-dimensional, simplic...

0 Xavier Goaoc, et al. ∙

research

∙ 09/04/2018

Computing optimal discrete readout weights in reservoir computing is NP-hard

We show NP-hardness of a generalized quadratic programming problem, whic...

0 Fatemeh Hadaeghi, et al. ∙

research

∙ 07/19/2023

Automatic Conversion of MiniZinc Programs to QUBO

Obtaining Quadratic Unconstrained Binary Optimisation models for various...

0 Armin Wolf, et al. ∙

research

∙ 06/22/2016

Étude de Problèmes d'Optimisation Combinatoire à Multiples Composantes Interdépendantes

This extended abstract presents an overview on NP-hard optimization prob...

0 Mohamed El Yafrani, et al. ∙

research

∙ 02/26/2021

Many-Qudit representation for the Travelling Salesman Problem Optimisation

We present a map from the travelling salesman problem (TSP), a prototypi...

0 Vladimir Vargas-Calderón, et al. ∙

research

∙ 08/02/2020

Complexity continuum within Ising formulation of NP problems

A promising approach to achieve computational supremacy over the classic...

0 Kirill P. Kalinin, et al. ∙

research

∙ 12/05/2018

Hard combinatorial problems and minor embeddings on lattice graphs

Today, hardware constraints are an important limitation on quantum adiab...

0 Andrew Lucas, et al. ∙