Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1911.08043

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

Bas Lodewijks

Published Nov 18, 2019• 31 citations
arXivHTMLPDF

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.
DOI
10.48550/arxiv.1911.08043

Related papers

QUBO formulations of three NP problems

Anuradha Mahasinghe, Vishmi Fernando, Paduma Samarawickrama

With the recent advancements in the field of combinatorial optimization, QUBO (quadratic unconstrained binary optimization) has become a topic of intense interest, as a problem format acceptable to several hardware heuristics such as quantum and digital annealers. Accordingly, transforming hard mathematical problems into QUBO problems is of particular importance. In this paper, we restate three problems in NP-complete and NP-hard classes as QUBO problems with proofs of equivalence. Our problems of interest are the numerical three-dimensional matching problem, the monochromatic triangle problem and the optimum facility location problem. Furthermore, we comment on the feasibility of these formulations on sophisticated QUBO solving platforms.

Journal of Information and Optimization Sciences•Oct 3, 2021•10 citations

CUBO-to-QUBO Conversion: Reducing Cubic Formulations to Quadratic Formulations

Shunsuke Tsukiyama, Xiaotian Li, Koji Nakano +5 more

Quadratic Unconstrained Binary Optimization (QUBO) models are defined by quadratic expressions composed of binary variables, each taking a value of either 0 or 1. The objective of the QUBO problem is to find an optimal assignment of these binary variables that minimizes the value of the QUBO model. The QUBO problem has attracted significant research interest due to its versatility in reformulating various NP-complete problems and its potential for efficiently finding heuristic solutions through quantum annealing. This paper focuses on converting Cubic Unconstrained Binary Optimization (CUBO) problems, defined by cubic expressions, into equivalent QUBO models. Through this conversion, CUBO problems can be solved using quantum annealing. Since the important NP-hard problem 3-SAT can be straightforwardly represented as a CUBO problem, investigating the conversion from CUBO to QUBO models is a meaningful endeavor.

IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum•Jun 3, 2025•1 citation

Various QUBO Formulations of the Graph Isomorphism Problem and Related Problems

Daisuke Takafuji, Koji Nakano, Yasuaki Ito +6 more

Quadratic Unconstrained Binary Optimization (QUBO) is a combinatorial optimization to find an optimal binary solution vector that minimizes the energy value defined by a quadratic formula of binary variables in the vector. The graph isomorphism problem is one of the applications of combinatorial optimization, and is not known to be solvable in polynomial time. The problem is also not known to be NP-complete. We propose four QUBO formulations for graph isomorphism problem instances. We also propose four QUBO formulations for induced subgraph isomorphism problem instances and two QUBO formulations for subgraph isomorphism problem instances, which are NP-complete problems. We solve QUBO instances defined by our QUBO formulations, using known QUBO solvers: Gurobi optimizer, Fixstars Amplify AE and OpenJij with SA.

Bulletin of Networking, Computing, Systems, and Software•Mar 1, 2024•0 citations

A new tool for automated transformation of Quadratic Assignment Problem instances to Quadratic Unconstrained Binary Optimisation models

Umut Tosun

Expert Systems with Applications•Apr 9, 2022•13 citations

An Optimal Constraint for QUBO Models

Clark Alexander

A quadratic binary unconstrained optimization model, hereafter QUBO, by definition is unconstrained. This, however, is not ideal if one needs to select a model containing only a fixed size binary vector. In this work we show how to add a constraint to a QUBO to force a particular size solution.

arXiv:2101.02730•Jan 7, 2021•0 citations

Formulation of the Social Workers’ Problem in Quadratic Unconstrained Binary Optimization Form and Solve It on a Quantum Computer

Parfait Atchade-Adelomou, Elisabet Golobardes Ribé, X. Vilasis-Cardona

The problem of social workers visiting their patients at home is a class of combinatorial optimization problems and belongs to the class of problems known as NP-Hard.These problems require heuristic techniques to provide an efficient solution in the best of cases.In this article, in addition to providing a detailed resolution of the social workers' problem using the Quadratic Unconstrained Binary Optimization Problems (QUBO) formulation, an approach to mapping the inequality constraints in the QUBO form is given.Finally, we map it in the Hamiltonian of the Ising model to solve it with the Quantum Exact Solver and Variational Quantum Eigensolvers (VQE).The quantum feasibility of the algorithm will be tested on IBMQ computers.

Journal of Computer and Communications•Jan 1, 2020•9 citations
With the recent advancements in the field of combinatorial optimization, QUBO (quadratic unconstrained binary optimization) has become a topic of intense interest, as a problem format acceptable to several hardware heuristics such as quantum and digital annealers. Accordingly, transforming hard mathematical problems into QUBO problems is of particular importance. In this paper, we restate three problems in NP-complete and NP-hard classes as QUBO problems with proofs of equivalence. Our problems of interest are the numerical three-dimensional matching problem, the monochromatic triangle problem and the optimum facility location problem. Furthermore, we comment on the feasibility of these formulations on sophisticated QUBO solving platforms.
Quadratic Unconstrained Binary Optimization (QUBO) models are defined by quadratic expressions composed of binary variables, each taking a value of either 0 or 1. The objective of the QUBO problem is to find an optimal assignment of these binary variables that minimizes the value of the QUBO model. The QUBO problem has attracted significant research interest due to its versatility in reformulating various NP-complete problems and its potential for efficiently finding heuristic solutions through quantum annealing. This paper focuses on converting Cubic Unconstrained Binary Optimization (CUBO) problems, defined by cubic expressions, into equivalent QUBO models. Through this conversion, CUBO problems can be solved using quantum annealing. Since the important NP-hard problem 3-SAT can be straightforwardly represented as a CUBO problem, investigating the conversion from CUBO to QUBO models is a meaningful endeavor.
Quadratic Unconstrained Binary Optimization (QUBO) is a combinatorial optimization to find an optimal binary solution vector that minimizes the energy value defined by a quadratic formula of binary variables in the vector. The graph isomorphism problem is one of the applications of combinatorial optimization, and is not known to be solvable in polynomial time. The problem is also not known to be NP-complete. We propose four QUBO formulations for graph isomorphism problem instances. We also propose four QUBO formulations for induced subgraph isomorphism problem instances and two QUBO formulations for subgraph isomorphism problem instances, which are NP-complete problems. We solve QUBO instances defined by our QUBO formulations, using known QUBO solvers: Gurobi optimizer, Fixstars Amplify AE and OpenJij with SA.
The problem of social workers visiting their patients at home is a class of combinatorial optimization problems and belongs to the class of problems known as NP-Hard.These problems require heuristic techniques to provide an efficient solution in the best of cases.In this article, in addition to providing a detailed resolution of the social workers' problem using the Quadratic Unconstrained Binary Optimization Problems (QUBO) formulation, an approach to mapping the inequality constraints in the QUBO form is given.Finally, we map it in the Hamiltonian of the Ising model to solve it with the Quantum Exact Solver and Variational Quantum Eigensolvers (VQE).The quantum feasibility of the algorithm will be tested on IBMQ computers.