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

Journal of Computer Research and Development

Quantum Annealing Algorithms: State of the Art

Du Weilin, Li Bin, Yu Peng Tian

Published Sep 15, 2008• 2 citations
OpenAlex

Related papers

Optimization algorithms for Quantum Annealing

E. Arvidsson

•Jan 1, 2020•0 citations

Quantum annealing

Alfonso de la Fuente Ruiz

Brief description on the state of the art of some local optimization methods: Quantum annealing Quantum annealing (also known as alloy, crystallization or tempering) is analogous to simulated annealing but in substitution of thermal activation by quantum tunneling. The class of algorithmic methods for quantum annealing (dubbed: 'QA'), sometimes referred by the italian school as Quantum Stochastic Optimization ('QSO'), is a promising metaheuristic tool for solving local search problems in multivariable optimization contexts.

arXiv:1404.2465•Apr 9, 2014•7 citations

Using quantum annealing to generate test cases for cyber-physical systems

Hugo Da Silva Araujo, Xinyi Wang, Mohammadreza Ahmadi Mousavi +1 more

Quantum computing offers the potential to address complex computational challenges, particularly in areas such as simulation and optimisation. Despite this promise, current gate-based quantum devices remain limited in scale and reliability, constraining their practical use. In this context, quantum annealing (QA) emerges as a viable and currently accessible alternative for solving optimisation problems, as it employs adiabatic quantum evolution to efficiently explore large and complex search spaces. This makes it a natural candidate for search-based software testing in the Cyber-Physical Systems (CPS) domain, which demands effective test cases due to their complexity and combination of continuous and discrete domains. This work explores the use of quantum annealing to enhance test case generation for CPS through a mutation-based approach. We employ quantum annealing to identify areas on test cases that can be improved and apply mutations to those areas. We encode test case mutation as a binary optimisation problem, and use quantum annealing to identify and target critical regions of the test cases for improvement. Our approach mechanises this process into an algorithm that uses D-Wave's quantum annealer to find the solution. As a main contribution, we offer insights into how quantum annealing can advance testing methodologies by empirically evaluating the correlation between problem size, hardware limitations, and the effectiveness of the results. Moreover, we compare the proposed method against state-of-the-art classical optimisation algorithms, targeting efficiency (time to generate test cases) and effectiveness (fault detection rates). Our results indicate that quantum annealing may enable faster test case generation (when problem decomposition, sampling and scheduling strategies are applied) while achieving comparable fault detection performance to state-of-the-art alternatives.

arXiv:2504.21684•ACM Transactions on Software Engineering and Methodology•Nov 2, 2026•4 citations

Quantum Annealing and Related Optimization Methods

Arnab Das, Bikas K. Chakrabarti

•Jan 1, 2008•142 citations

Basics and Applications of Quantum Annealing

Shu Tanaka

Journal of Japan Society for Fuzzy Theory and Intelligent Informatics•Feb 15, 2018•0 citations

Quantum annealing for industry applications: introduction and review

Sheir Yarkoni, Elena Raponi, Thomas Bäck +1 more

Quantum annealing (QA) is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale quantum processors that implement the QA algorithm for programmable use. Specifically, QA processors produced by D-Wave systems have been studied and tested extensively in both research and industrial settings across different disciplines. In this paper we provide a literature review of the theoretical motivations for QA as a heuristic quantum optimization algorithm, the software and hardware that is required to use such quantum processors, and the state-of-the-art applications and proofs-of-concepts that have been demonstrated using them. The goal of our review is to provide a centralized and condensed source regarding applications of QA technology. We identify the advantages, limitations, and potential of QA for both researchers and practitioners from various fields.

arXiv:2112.07491•Reports on Progress in Physics•Aug 24, 2022•429 citations
Brief description on the state of the art of some local optimization methods: Quantum annealing Quantum annealing (also known as alloy, crystallization or tempering) is analogous to simulated annealing but in substitution of thermal activation by quantum tunneling. The class of algorithmic methods for quantum annealing (dubbed: 'QA'), sometimes referred by the italian school as Quantum Stochastic Optimization ('QSO'), is a promising metaheuristic tool for solving local search problems in multivariable optimization contexts.
Quantum computing offers the potential to address complex computational challenges, particularly in areas such as simulation and optimisation. Despite this promise, current gate-based quantum devices remain limited in scale and reliability, constraining their practical use. In this context, quantum annealing (QA) emerges as a viable and currently accessible alternative for solving optimisation problems, as it employs adiabatic quantum evolution to efficiently explore large and complex search spaces. This makes it a natural candidate for search-based software testing in the Cyber-Physical Systems (CPS) domain, which demands effective test cases due to their complexity and combination of continuous and discrete domains. This work explores the use of quantum annealing to enhance test case generation for CPS through a mutation-based approach. We employ quantum annealing to identify areas on test cases that can be improved and apply mutations to those areas. We encode test case mutation as a binary optimisation problem, and use quantum annealing to identify and target critical regions of the test cases for improvement. Our approach mechanises this process into an algorithm that uses D-Wave's quantum annealer to find the solution. As a main contribution, we offer insights into how quantum annealing can advance testing methodologies by empirically evaluating the correlation between problem size, hardware limitations, and the effectiveness of the results. Moreover, we compare the proposed method against state-of-the-art classical optimisation algorithms, targeting efficiency (time to generate test cases) and effectiveness (fault detection rates). Our results indicate that quantum annealing may enable faster test case generation (when problem decomposition, sampling and scheduling strategies are applied) while achieving comparable fault detection performance to state-of-the-art alternatives.
Quantum annealing (QA) is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale quantum processors that implement the QA algorithm for programmable use. Specifically, QA processors produced by D-Wave systems have been studied and tested extensively in both research and industrial settings across different disciplines. In this paper we provide a literature review of the theoretical motivations for QA as a heuristic quantum optimization algorithm, the software and hardware that is required to use such quantum processors, and the state-of-the-art applications and proofs-of-concepts that have been demonstrated using them. The goal of our review is to provide a centralized and condensed source regarding applications of QA technology. We identify the advantages, limitations, and potential of QA for both researchers and practitioners from various fields.