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

International Conference on Natural Computation (ICNC)

Convergence analysis on a class of quantum-inspired evolutionary algorithms

Shengqiu Yi, Ming Chen, Zhigao Zeng

Published Jul 1, 2011• 1 citation
Publisher

Abstract

In this article we focus on the theoretical analysis of quantum-inspired evolutionary algorithms with Hϵgate. Applying the theory and analytical techniques in non-homogeneous Markov chains, we obtain the conclusion that quantum-inspired evolutionary algorithms converge in probability under some mild conditions. Moreover, we estimate the convergence rate relating to parameters of algorithms.

DOI
10.1109/icnc.2011.6022161

Related papers

Analysis on the Convergence of Quantum-inspired Evolutionary Algorithms

Ming Chen, Lixin Ding

This article deals with the convergence of quantum-inspired evolutionary algorithms with one quantum individual and multiple observations. Applying the theory and analytical techniques in non-homogeneous Markov chain, we obtain the conclusion that quantuminspired evolutionary algorithms could converge in probability under some mild conditions imposed on the probability amplitude of the Q-bit individual. We also analyze three cases from both theoretical and experimental viewpoints. The QEA with rotation gate can not guarantee convergence in theory, while others with modified Q-gates meet the convergence conditions. Numerical results further illustrate feasibleness and effectiveness of the improved algorithms.

International Journal of Advancements in Computing Technology•May 31, 2011•3 citations

Convergence analysis of quantum-inspired genetic algorithms with the population of a single individual

Mehrshad Khosraviani, Saadat Pourmozafari, Mohammad Mehdi Ebadzadeh

In this paper, the Quantum-inspired Genetic Algorithms with the population of a single individual are formalized by a Markov chain model using a single and the stored best individual. Here, we analyze the convergence property of the Quantum-inspired Genetic Algorithms based on our proposed mathematical model, and with assumption in which its special genetic operation in the generation changes is restricted to a quantum operator; and show by means of the Markov chain analysis that the algorithm with preservation of the best individual in the population and comparison of it with the existing individual, will converge on the global optimal solution.

Genetic and Evolutionary Computation Conference (GECCO)•Jul 12, 2008•6 citations

Quantum-Inspired Evolutionary Algorithms for Optimization

Jincheng Zhang

This paper investigates the potential of incorporating quantum mechanical concepts into evolutionary algorithms (EAs) to improve their optimization capabilities. Traditional EAs, while effective, often struggle with complex search spaces and can get trapped in local optima. We propose a framework for developing quantum-inspired EAs that leverages principles such as superposition and entanglement to enhance exploration and exploitation strategies. The core idea is to introduce probabilistic operators and adaptive parameter control mimicking quantum behaviors. We present a detailed description of the proposed algorithm, focusing on the mathematical formulation of the key components, including the representation of solutions, the selection process, and the mutation operator. The algorithm's performance is evaluated on several benchmark optimization problems, demonstrating its potential to outperform conventional EAs in scenarios demanding high accuracy and rapid convergence. Furthermore, we analyze the theoretical implications of this approach, highlighting the advantages derived from quantum-inspired mechanisms. This work contributes to the ongoing research at the intersection of evolutionary computation and quantum information theory, offering a novel approach to tackling complex optimization challenges.

•Sep 3, 2026•0 citations

Quantum-Inspired Evolutionary Algorithms for Optimization Problems

Jincheng Zhang

This paper investigates the application of quantum-inspired techniques to enhance the performance of evolutionary algorithms (EAs) for solving complex optimization problems. Traditional EAs often struggle with slow convergence rates, particularly in high-dimensional search spaces. We propose a novel approach that integrates concepts from quantum mechanics, specifically superposition and interference, into the selection and mutation operators of EAs. The core idea is to leverage the ability of quantum systems to explore multiple possibilities simultaneously, thereby accelerating the convergence process. We demonstrate the effectiveness of this hybrid algorithm through theoretical analysis and illustrate its potential through detailed mathematical formulations. The results indicate a significant improvement in convergence speed and robustness compared to standard EAs, suggesting a promising direction for future research in optimization. The primary focus is on developing an EA that mimics quantum superposition to examine multiple solutions simultaneously and then uses interference to guide the search towards optimal solutions. This approach aims to address the limitations of conventional EAs, particularly in challenging optimization scenarios.

•Aug 29, 2026•0 citations

Advanced Quantum Inspired Evolutionary Optimization Algorithm

Sai Siddhartha Vivek Dhir Rangoju, Om Prakash Patel, Neha Bharill

In this paper, an advanced quantum-inspired evolutionary optimization algorithm (A-QEOA) is proposed. This algorithm is based on the principle of quantum computing such as quantum bit representation and superposition of states. Like other evolutionary algorithms, the quantum-inspired evolutionary algorithm has characteristics of exploration and exploitation. The quantum-inspired evolutionary algorithm achieves exploration using observation process and exploitation using quantum rotation gate. Exploration helps to find the search space for a parameter that needs to be optimized. However, the observation process needs a random number which may sometimes increase the number of iterations to converge the algorithm or may lead to premature convergence. In this paper, we propose an algorithm with an updated observation process that helps to converge the algorithm optimally and helps to get results faster in comparison to the existing quantum inspired evolutionary algorithm (QEA).

International Conference on Emerging Techniques in Computational Intelligence (ICETCI)•Aug 25, 2022•2 citations

Convergence Analysis of Double Chains Quantum Genetic Algorithm

Yang Guo-weia

The double chains quantum genetic algorithm based on real coded and gradient of objective function increases the diversity of population,expands the search field about space,accelerates the algorithm evolutionary process,avoids the premature convergence phenomenon,is an effective optimization algorithm,but does prove theoretically convergence.This paper gives the corresponding theorem on the basis of previous work,theoretically proves the convergence of the algorithm by the theorem,and discusses the effects of the quantum coding and quantum rotation gate in terms of the algorithm convergence and optimization efficiency by simulation example.Results show that his research enriches and improves the double chains quantum genetic theory.

Jisuanji gongcheng•Jan 1, 2012•3 citations
In this article we focus on the theoretical analysis of quantum-inspired evolutionary algorithms with Hϵgate. Applying the theory and analytical techniques in non-homogeneous Markov chains, we obtain the conclusion that quantum-inspired evolutionary algorithms converge in probability under some mild conditions. Moreover, we estimate the convergence rate relating to parameters of algorithms.
This article deals with the convergence of quantum-inspired evolutionary algorithms with one quantum individual and multiple observations. Applying the theory and analytical techniques in non-homogeneous Markov chain, we obtain the conclusion that quantuminspired evolutionary algorithms could converge in probability under some mild conditions imposed on the probability amplitude of the Q-bit individual. We also analyze three cases from both theoretical and experimental viewpoints. The QEA with rotation gate can not guarantee convergence in theory, while others with modified Q-gates meet the convergence conditions. Numerical results further illustrate feasibleness and effectiveness of the improved algorithms.
In this paper, the Quantum-inspired Genetic Algorithms with the population of a single individual are formalized by a Markov chain model using a single and the stored best individual. Here, we analyze the convergence property of the Quantum-inspired Genetic Algorithms based on our proposed mathematical model, and with assumption in which its special genetic operation in the generation changes is restricted to a quantum operator; and show by means of the Markov chain analysis that the algorithm with preservation of the best individual in the population and comparison of it with the existing individual, will converge on the global optimal solution.
This paper investigates the potential of incorporating quantum mechanical concepts into evolutionary algorithms (EAs) to improve their optimization capabilities. Traditional EAs, while effective, often struggle with complex search spaces and can get trapped in local optima. We propose a framework for developing quantum-inspired EAs that leverages principles such as superposition and entanglement to enhance exploration and exploitation strategies. The core idea is to introduce probabilistic operators and adaptive parameter control mimicking quantum behaviors. We present a detailed description of the proposed algorithm, focusing on the mathematical formulation of the key components, including the representation of solutions, the selection process, and the mutation operator. The algorithm's performance is evaluated on several benchmark optimization problems, demonstrating its potential to outperform conventional EAs in scenarios demanding high accuracy and rapid convergence. Furthermore, we analyze the theoretical implications of this approach, highlighting the advantages derived from quantum-inspired mechanisms. This work contributes to the ongoing research at the intersection of evolutionary computation and quantum information theory, offering a novel approach to tackling complex optimization challenges.
This paper investigates the application of quantum-inspired techniques to enhance the performance of evolutionary algorithms (EAs) for solving complex optimization problems. Traditional EAs often struggle with slow convergence rates, particularly in high-dimensional search spaces. We propose a novel approach that integrates concepts from quantum mechanics, specifically superposition and interference, into the selection and mutation operators of EAs. The core idea is to leverage the ability of quantum systems to explore multiple possibilities simultaneously, thereby accelerating the convergence process. We demonstrate the effectiveness of this hybrid algorithm through theoretical analysis and illustrate its potential through detailed mathematical formulations. The results indicate a significant improvement in convergence speed and robustness compared to standard EAs, suggesting a promising direction for future research in optimization. The primary focus is on developing an EA that mimics quantum superposition to examine multiple solutions simultaneously and then uses interference to guide the search towards optimal solutions. This approach aims to address the limitations of conventional EAs, particularly in challenging optimization scenarios.
In this paper, an advanced quantum-inspired evolutionary optimization algorithm (A-QEOA) is proposed. This algorithm is based on the principle of quantum computing such as quantum bit representation and superposition of states. Like other evolutionary algorithms, the quantum-inspired evolutionary algorithm has characteristics of exploration and exploitation. The quantum-inspired evolutionary algorithm achieves exploration using observation process and exploitation using quantum rotation gate. Exploration helps to find the search space for a parameter that needs to be optimized. However, the observation process needs a random number which may sometimes increase the number of iterations to converge the algorithm or may lead to premature convergence. In this paper, we propose an algorithm with an updated observation process that helps to converge the algorithm optimally and helps to get results faster in comparison to the existing quantum inspired evolutionary algorithm (QEA).
The double chains quantum genetic algorithm based on real coded and gradient of objective function increases the diversity of population,expands the search field about space,accelerates the algorithm evolutionary process,avoids the premature convergence phenomenon,is an effective optimization algorithm,but does prove theoretically convergence.This paper gives the corresponding theorem on the basis of previous work,theoretically proves the convergence of the algorithm by the theorem,and discusses the effects of the quantum coding and quantum rotation gate in terms of the algorithm convergence and optimization efficiency by simulation example.Results show that his research enriches and improves the double chains quantum genetic theory.