Solving Combinatorial Optimization Problems Based on QUBO Models

Authors:

Abstract
Combinatorial optimization problems are of great significance in many fields, and this paper explores the application of quantum annealing-based QUBO (Quadratic Unconstrained Binary Optimization) model to combinatorial optimization problems, including the 0/1 knapsack problem, the traveler's problem, the maximum cut problem, and the graph coloring problem. The quantum annealing algorithm can effectively avoid falling into local optimal solutions by virtue of its unique quantum tunneling advantage, and shows significant advantages in solving complex combinatorial optimization problems, especially in dealing with large-scale data and multiple constraints, quantum annealing provides an efficient solution.
Funding Information
  • Science and Technology Commission of Shanghai Municipality
  • China Electronics Technology Group Corporation

This publication has 10 references indexed in Scilit: