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

WORLD SCIENTIFIC (EUROPE) eBooks

METAHEURISTIC SEARCH TECHNIQUES: GENETIC ALGORITHMS AND QUANTUM ANNEALING

Published Jul 19, 2026• 0 citations
Publisher

Abstract

This part of the course introduces heuristic search methods — optimization techniques typically inspired by naturally occurring phenomena. We will focus on two such methods: genetic algorithms and quantum annealing. These represent opposite ends of the heuristic spectrum: in one, the problem of interest is largely decoupled from the mechanics of the search, while in the other, the problem is directly embedded within it. Although many other heuristic techniques exist, these two examples illustrate key advantages (e.g., broad applicability, potential speed-ups in suitable settings) and drawbacks (e.g., limited explainability) shared by many heuristic methods. In the tutorials, we will consider several discrete problems, such as Taxicab numbers and the Knapsack problem. The former is a well-known curiosity in number theory, while the latter is a classic problem in combinatorial optimization. Both are also morally analogous to certain discrete structures that arise in physics, such as anomaly cancellation conditions and partition function computations.

DOI
10.1142/9781807290016_others02

Related papers

Efficient Combinatorial Optimization Using Quantum Annealing

Hristo N. Djidjev, Guillaume Chapuis, Georg Hahn +1 more

The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techniques. However, it is unclear if the current state of quantum computing already provides a quantum advantage over the current state of the art in classical computing. This article assesses the performance of the D-Wave 2X quantum annealer on two NP hard graph problems, in particular clique finding and graph partitioning. For this, we provide formulations as Qubo and Ising Hamiltonians suitable for the quantum annealer and compare a variety of quantum solvers (Sapi, QBSolv, QSage provided by D-Wave Sys, Inc.) to current classical algorithms (METIS, Simulated Annealing, third-party clique finding and graph splitting heuristics) on certain test sets of graphs. We demonstrate that for small graph instances, classical methods still outperform the quantum annealer in terms of computing time, even though the quality of the best solutions obtained is comparable. Nevertheless, due to the limited problem size which can be embedded on the D-Wave 2X chip, the aforementioned finding applies to most of problems of general nature solvable on the quantum annealer. For instances specifically designed to fit the D-Wave 2X architecture, we observe substantial speed-ups in computing time over classical approaches.

arXiv:1801.08653•Jan 26, 2018•65 citations

An Overview of Quantum Algorithms

Seiichiro Tani

量子コンピュータは,量子力学の原理を用いて計算を行うコンピュータであり,現在のコンピュータを超える計算能力を発揮することが期待されている.そのためには,量子コンピュータのハードウェアを効果的に使って計算を行うアルゴリズム(量子アルゴリズム)が必要となる.本稿では,これまで行われてきた量子アルゴリズム研究を概観し,課題と展望について議論する

Denshi Jouhou Tsuushin Gakkai Tsuushin Sosaieti magajin/B-plus/Denshi Jouhou Tsuushin Gakkai Tsuushin Sosaeti magajin•Jan 1, 2020•0 citations

Quantum-inspired metaheuristic algorithms: comprehensive survey and classification

Farhad Soleimanian Gharehchopogh

Artificial Intelligence Review•Nov 2, 2022•286 citations

Quantum-Inspired Heuristics for Complex Optimization

Jincheng Zhang

This paper explores the application of quantum-inspired heuristics to tackle complex optimization problems. The core idea stems from leveraging quantum mechanical principles, specifically superposition and interference, to design novel heuristic algorithms. Instead of relying on traditional approaches like simulated annealing or genetic algorithms, we propose algorithms that mimic the evolution of wave functions within complex search spaces. These algorithms incorporate principles analogous to quantum annealing, allowing them to effectively navigate local minima and accelerate convergence rates. The novelty of this work lies in its direct application of quantum concepts to classical optimization, offering a potentially more efficient solution method without the need for specialized quantum computing hardware. The methodology outlined herein provides a framework for developing a new generation of optimization algorithms inspired by the underlying principles of quantum mechanics. The performance of these algorithms is evaluated through theoretical analysis and conceptual demonstrations, highlighting their potential advantages over conventional heuristic techniques.

•Aug 28, 2026•0 citations

Designing a Quantum Genetic Controller for Tracking the Path of Quantum Systems

Ameneh Arjmandzadeh, دانشکده ریاضی و علوم کامپیوتر دانشگاه لرستان, Majid Yarahmadi +1 more

‫دق‬ ‫ابزار‬ ‫و‬ ‫کنترل‬ ‫مهندسان‬ ‫انجمن‬ ‫کنترل،‬ ‫مجله‬ ‫ي‬ ‫ايران‬ ‫ق‬ -‫طوسي‬ ‫نصيرالدين‬ ‫خواجه‬ ‫صنعتي‬ ‫دانشگاه‬ ‫مكاتبات:‬ ‫دار‬ ‫عهده‬ ‫نويسنده‬ ‫ياراحمدی‬ ‫مجيد‬ ‫سيستم‬ ‫در‬ ‫مسير‬ ‫رديابي‬ ‫منظور‬ ‫به‬ ‫کوانتومي‬ ‫ژنتيكي‬ ‫کننده‬ ‫کنترل‬ ‫يک‬ ‫بر‬ ‫مبتني‬ ‫يادگير‬

Journal of Control•May 1, 2020•0 citations

First application of quantum annealing to IMRT beamlet intensity optimization

Daryl P. Nazareth, J Spaans

Optimization methods are critical to radiation therapy. A new technology, quantum annealing (QA), employs novel hardware and software techniques to address various discrete optimization problems in many fields. We report on the first application of quantum annealing to the process of beamlet intensity optimization for IMRT. We apply recently-developed hardware which natively exploits quantum mechanical effects for improved optimization. The new algorithm, called QA, is most similar to simulated annealing, but relies on natural processes to directly minimize a system's free energy. A simple quantum system is slowly evolved into a classical system representing the objective function. If the evolution is sufficiently slow, there are probabilistic guarantees that a global minimum will be located. To apply QA to IMRT-type optimization, two prostate cases were considered. A reduced number of beamlets were employed, due to the current QA hardware limitations. The beamlet dose matrices were computed using CERR and an objective function was defined based on typical clinical constraints, including dose-volume objectives, which result in a complex non-convex search space. The objective function was discretized and the QA method was compared to two standard optimization methods, simulated annealing and Tabu search, run on a conventional computing cluster. Based on several runs, the average final objective function value achieved by the QA was 16.9 for the first patient, compared with 10.0 for Tabu and 6.7 for the simulated annealing (SA) method. For the second patient, the values were 70.7 for the QA, 120.0 for Tabu and 22.9 for the SA. The QA algorithm required 27-38% of the time required by the other two methods. In this first application of hardware-enabled QA to IMRT optimization, its performance is comparable to Tabu search, but less effective than the SA in terms of final objective function values. However, its speed was 3-4 times faster than the other two methods. This initial experiment suggests that more research into QA-based heuristics may offer significant speedup over conventional clinical optimization methods, as quantum annealing hardware scales to larger sizes.

Physics in Medicine and Biology•May 1, 2015•32 citations
This part of the course introduces heuristic search methods — optimization techniques typically inspired by naturally occurring phenomena. We will focus on two such methods: genetic algorithms and quantum annealing. These represent opposite ends of the heuristic spectrum: in one, the problem of interest is largely decoupled from the mechanics of the search, while in the other, the problem is directly embedded within it. Although many other heuristic techniques exist, these two examples illustrate key advantages (e.g., broad applicability, potential speed-ups in suitable settings) and drawbacks (e.g., limited explainability) shared by many heuristic methods. In the tutorials, we will consider several discrete problems, such as Taxicab numbers and the Knapsack problem. The former is a well-known curiosity in number theory, while the latter is a classic problem in combinatorial optimization. Both are also morally analogous to certain discrete structures that arise in physics, such as anomaly cancellation conditions and partition function computations.
The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techniques. However, it is unclear if the current state of quantum computing already provides a quantum advantage over the current state of the art in classical computing. This article assesses the performance of the D-Wave 2X quantum annealer on two NP hard graph problems, in particular clique finding and graph partitioning. For this, we provide formulations as Qubo and Ising Hamiltonians suitable for the quantum annealer and compare a variety of quantum solvers (Sapi, QBSolv, QSage provided by D-Wave Sys, Inc.) to current classical algorithms (METIS, Simulated Annealing, third-party clique finding and graph splitting heuristics) on certain test sets of graphs. We demonstrate that for small graph instances, classical methods still outperform the quantum annealer in terms of computing time, even though the quality of the best solutions obtained is comparable. Nevertheless, due to the limited problem size which can be embedded on the D-Wave 2X chip, the aforementioned finding applies to most of problems of general nature solvable on the quantum annealer. For instances specifically designed to fit the D-Wave 2X architecture, we observe substantial speed-ups in computing time over classical approaches.
量子コンピュータは,量子力学の原理を用いて計算を行うコンピュータであり,現在のコンピュータを超える計算能力を発揮することが期待されている.そのためには,量子コンピュータのハードウェアを効果的に使って計算を行うアルゴリズム(量子アルゴリズム)が必要となる.本稿では,これまで行われてきた量子アルゴリズム研究を概観し,課題と展望について議論する
This paper explores the application of quantum-inspired heuristics to tackle complex optimization problems. The core idea stems from leveraging quantum mechanical principles, specifically superposition and interference, to design novel heuristic algorithms. Instead of relying on traditional approaches like simulated annealing or genetic algorithms, we propose algorithms that mimic the evolution of wave functions within complex search spaces. These algorithms incorporate principles analogous to quantum annealing, allowing them to effectively navigate local minima and accelerate convergence rates. The novelty of this work lies in its direct application of quantum concepts to classical optimization, offering a potentially more efficient solution method without the need for specialized quantum computing hardware. The methodology outlined herein provides a framework for developing a new generation of optimization algorithms inspired by the underlying principles of quantum mechanics. The performance of these algorithms is evaluated through theoretical analysis and conceptual demonstrations, highlighting their potential advantages over conventional heuristic techniques.
‫دق‬ ‫ابزار‬ ‫و‬ ‫کنترل‬ ‫مهندسان‬ ‫انجمن‬ ‫کنترل،‬ ‫مجله‬ ‫ي‬ ‫ايران‬ ‫ق‬ -‫طوسي‬ ‫نصيرالدين‬ ‫خواجه‬ ‫صنعتي‬ ‫دانشگاه‬ ‫مكاتبات:‬ ‫دار‬ ‫عهده‬ ‫نويسنده‬ ‫ياراحمدی‬ ‫مجيد‬ ‫سيستم‬ ‫در‬ ‫مسير‬ ‫رديابي‬ ‫منظور‬ ‫به‬ ‫کوانتومي‬ ‫ژنتيكي‬ ‫کننده‬ ‫کنترل‬ ‫يک‬ ‫بر‬ ‫مبتني‬ ‫يادگير‬
Optimization methods are critical to radiation therapy. A new technology, quantum annealing (QA), employs novel hardware and software techniques to address various discrete optimization problems in many fields. We report on the first application of quantum annealing to the process of beamlet intensity optimization for IMRT. We apply recently-developed hardware which natively exploits quantum mechanical effects for improved optimization. The new algorithm, called QA, is most similar to simulated annealing, but relies on natural processes to directly minimize a system's free energy. A simple quantum system is slowly evolved into a classical system representing the objective function. If the evolution is sufficiently slow, there are probabilistic guarantees that a global minimum will be located. To apply QA to IMRT-type optimization, two prostate cases were considered. A reduced number of beamlets were employed, due to the current QA hardware limitations. The beamlet dose matrices were computed using CERR and an objective function was defined based on typical clinical constraints, including dose-volume objectives, which result in a complex non-convex search space. The objective function was discretized and the QA method was compared to two standard optimization methods, simulated annealing and Tabu search, run on a conventional computing cluster. Based on several runs, the average final objective function value achieved by the QA was 16.9 for the first patient, compared with 10.0 for Tabu and 6.7 for the simulated annealing (SA) method. For the second patient, the values were 70.7 for the QA, 120.0 for Tabu and 22.9 for the SA. The QA algorithm required 27-38% of the time required by the other two methods. In this first application of hardware-enabled QA to IMRT optimization, its performance is comparable to Tabu search, but less effective than the SA in terms of final objective function values. However, its speed was 3-4 times faster than the other two methods. This initial experiment suggests that more research into QA-based heuristics may offer significant speedup over conventional clinical optimization methods, as quantum annealing hardware scales to larger sizes.