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

**Based on Quantum Annealing Algorithm for Solving Combinatorial Optimization Problems**

Jincheng Zhang

Published Aug 31, 2026• 0 citations
Publisher
DOI
10.5281/zenodo.22204037

Related papers

A Comprehensive Review of Quantum Annealing for Combinatorial Routing Problems

A. Karunamurthy, V. Vasanth

Quing International Journal of Innovative Research in Science and Engineering•Dec 30, 2023•0 citations

Solving Combinatorial Optimization Problems Based on QUBO Models

Siwei Kong, Y Ye, Yongzheng Wu +3 more

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.

International Symposium on Computer Technology and Information Science (ISCTIS)•Jul 12, 2024•4 citations

Adaptive Quantum Annealing for Combinatorial Optimization

Jincheng Zhang

This paper presents an adaptive quantum annealing algorithm designed to improve the performance of quantum annealing in solving combinatorial optimization problems. Traditional quantum annealing relies on a fixed annealing schedule, which may not be optimal for all problems. This work introduces a novel approach that utilizes reinforcement learning to dynamically adjust the annealing parameters during the annealing process, based on the observed progress towards a solution. The algorithm learns an optimal annealing schedule by interacting with the quantum annealing system, maximizing the probability of finding a good solution within a given time limit. We demonstrate the theoretical framework and outline the core components of the adaptive algorithm, highlighting its potential advantages over conventional fixed-schedule quantum annealing. The key performance metric is the solution quality (e.g., objective function value) achieved after annealing. The algorithm's effectiveness is evaluated through conceptual analysis and design considerations. This approach aims to bridge the gap between the theoretical potential of quantum annealing and its practical application in solving real-world combinatorial optimization challenges.

•Aug 28, 2026•0 citations

Solving Combinatorial Optimization Problems using the Quantum Approximation Optimization Algorithm

Nicholas J. Guerrero

•Mar 26, 2020•3 citations

Quantum Annealing and Other Optimization Methods

Das, Arnab, Chakrabarti, Bikas

Lecture notes in physics•Jan 1, 2005•325 citations

Optimization Algorithms for Combinatorial Problems: A Comparative Study of Quantum Annealing and Classical Methods

Suresh A. J.

Optimization algorithms for combinatorial problems play a critical role in a wide range of applications, from logistics and scheduling to cryptography and artificial intelligence. Traditional classical methods, such as simulated annealing, genetic algorithms, and branch-and-bound techniques, have been widely employed to solve these problems, but they often face limitations in terms of computational efficiency and scalability as problem complexity grows. In recent years, quantum computing has emerged as a promising alternative, with quantum annealing offering a novel approach to solving combinatorial optimization problems. This study provides a comparative analysis of quantum annealing and classical optimization methods, highlighting their respective strengths and limitations. We explore how quantum annealing, through leveraging quantum tunnelling and superposition, has the potential to outperform classical algorithms in specific problem domains and Noisy Mean Field Annealing (NMFA) is used to comparisons of all algorithms. Benchmarking various combinatorial problems, such as the Traveling Salesman Problem (TSP), Max-Cut, Knapsack, and Quadratic Assignment Problem (QAP), this paper discusses performance metrics, computational time, and scalability. The findings suggest that while classical methods remain robust and practical for many real-world problems, quantum annealing holds significant promise, especially as quantum hardware continues to mature. However, there remain challenges in terms of noise, coherence, and problem mapping, which currently limit the full realization of quantum annealing's potential. This study offers insights into the future directions of optimization techniques and the evolving role of quantum computing in solving complex combinatorial problems.

International Journal of Intelligent Systems and Applications in Engineering•Mar 30, 2023•0 citations
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.
This paper presents an adaptive quantum annealing algorithm designed to improve the performance of quantum annealing in solving combinatorial optimization problems. Traditional quantum annealing relies on a fixed annealing schedule, which may not be optimal for all problems. This work introduces a novel approach that utilizes reinforcement learning to dynamically adjust the annealing parameters during the annealing process, based on the observed progress towards a solution. The algorithm learns an optimal annealing schedule by interacting with the quantum annealing system, maximizing the probability of finding a good solution within a given time limit. We demonstrate the theoretical framework and outline the core components of the adaptive algorithm, highlighting its potential advantages over conventional fixed-schedule quantum annealing. The key performance metric is the solution quality (e.g., objective function value) achieved after annealing. The algorithm's effectiveness is evaluated through conceptual analysis and design considerations. This approach aims to bridge the gap between the theoretical potential of quantum annealing and its practical application in solving real-world combinatorial optimization challenges.
Optimization algorithms for combinatorial problems play a critical role in a wide range of applications, from logistics and scheduling to cryptography and artificial intelligence. Traditional classical methods, such as simulated annealing, genetic algorithms, and branch-and-bound techniques, have been widely employed to solve these problems, but they often face limitations in terms of computational efficiency and scalability as problem complexity grows. In recent years, quantum computing has emerged as a promising alternative, with quantum annealing offering a novel approach to solving combinatorial optimization problems. This study provides a comparative analysis of quantum annealing and classical optimization methods, highlighting their respective strengths and limitations. We explore how quantum annealing, through leveraging quantum tunnelling and superposition, has the potential to outperform classical algorithms in specific problem domains and Noisy Mean Field Annealing (NMFA) is used to comparisons of all algorithms. Benchmarking various combinatorial problems, such as the Traveling Salesman Problem (TSP), Max-Cut, Knapsack, and Quadratic Assignment Problem (QAP), this paper discusses performance metrics, computational time, and scalability. The findings suggest that while classical methods remain robust and practical for many real-world problems, quantum annealing holds significant promise, especially as quantum hardware continues to mature. However, there remain challenges in terms of noise, coherence, and problem mapping, which currently limit the full realization of quantum annealing's potential. This study offers insights into the future directions of optimization techniques and the evolving role of quantum computing in solving complex combinatorial problems.