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 Journal of Bio-Inspired Computation

Expediting population diversification in evolutionary computation with quantum algorithm

Chang Wook Ahn, Jun Suk Kim

Published Jan 1, 2021• 0 citations
Publisher
DOI
10.1504/ijbic.2021.10035834

Related papers

Quantum Inspired Evolutionary Algorithms

Anthony Brabazon, Michael O’Neill, Seán McGarraghy

Natural computing series•Jan 1, 2015•0 citations

Expediting population diversification in evolutionary computation with quantum algorithm

Jun Suk Kim, Chang Wook Ahn

Quantum computing's uniqueness in commencing parallel computation renders unprecedented efficient optimisation as possible. This paper introduces the adaptation of quantum processing to crowding, one of the genetic algorithmic procedures to secure undeveloped individual chromosomes in pursuit of diversifying the target population. We argue that the nature of genetic algorithm to find the best solution in the process of optimisation can be greatly enhanced by the capability of quantum computing to perform multiple computations in parallel. By introducing the relevant quantum mathematics based on Grover's selection algorithm and constructing its mechanism in a quantum simulator, we come to conclusion that our proposed approach is valid in such a way that it can precisely reduce the amount of computation query to finish the crowding process without any impairment in the middle of genetic operations.

International Journal of Bio-Inspired Computation•Jan 1, 2021•1 citation

A New Combinatorial Optimal Algorithm Based on QEA

Yongqiang Zhang, Guihong Li

This paper combines quantum evolutionary algorithm with the available evolutionary algorithms, uses quantum computing parallelism to search solution space efficiently, uses the traditional evolutionary algorithm to optimize the result observed by quantum population and then uses the optimized result to guide the generation of some individuals of quantum population. It maintains the population diversity of quantum evolutionary algorithm and avoids premature. Meanwhile it adopts the different evolutionary algorithms to combine with quantum evolutionary algorithm to solve different problems, which will improve the adaptability of algorithm.

International Conference on E-Business and Information System Security (EBISS)•May 1, 2009•0 citations

Quantum-inspired evolutionary algorithms: a survey and empirical study

Gexiang Zhang

Journal of Heuristics•Jun 28, 2010•297 citations

Effect of Population Structures on Quantum-Inspired Evolutionary Algorithm

Nija Mani, G.P. Srivastava, A. K. Sinha +1 more

Quantum-inspired evolutionary algorithm (QEA) has been designed by integrating some quantum mechanical principles in the framework of evolutionary algorithms. They have been successfully employed as a computational technique in solving difficult optimization problems. It is well known that QEAs provide better balance between exploration and exploitation as compared to the conventional evolutionary algorithms. The population in QEA is evolved by variation operators, which move the Q-bit towards an attractor. A modification for improving the performance of QEA was proposed by changing the selection of attractors, namely, versatile QEA. The improvement attained by versatile QEA over QEA indicates the impact of population structure on the performance of QEA and motivates further investigation into employing fine-grained model. The QEA with fine-grained population model (FQEA) is similar to QEA with the exception that every individual is located in a unique position on a two-dimensional toroidal grid and has four neighbors amongst which it selects its attractor. Further, FQEA does not use migrations, which is employed by QEAs. This paper empirically investigates the effect of the three different population structures on the performance of QEA by solving well-known discrete benchmark optimization problems.

Applied Computational Intelligence and Soft Computing•Jan 1, 2014•6 citations

QUANTUM AND GENETIC ALGORITHMS AS A NEW TECHNOLOGY OF EVOLUTIONARY SEARCH

Victor M. Kureichik

Vestnik Yuzhnogo nauchnogo tsentra•Jan 1, 2005•1 citation
Quantum computing's uniqueness in commencing parallel computation renders unprecedented efficient optimisation as possible. This paper introduces the adaptation of quantum processing to crowding, one of the genetic algorithmic procedures to secure undeveloped individual chromosomes in pursuit of diversifying the target population. We argue that the nature of genetic algorithm to find the best solution in the process of optimisation can be greatly enhanced by the capability of quantum computing to perform multiple computations in parallel. By introducing the relevant quantum mathematics based on Grover's selection algorithm and constructing its mechanism in a quantum simulator, we come to conclusion that our proposed approach is valid in such a way that it can precisely reduce the amount of computation query to finish the crowding process without any impairment in the middle of genetic operations.
This paper combines quantum evolutionary algorithm with the available evolutionary algorithms, uses quantum computing parallelism to search solution space efficiently, uses the traditional evolutionary algorithm to optimize the result observed by quantum population and then uses the optimized result to guide the generation of some individuals of quantum population. It maintains the population diversity of quantum evolutionary algorithm and avoids premature. Meanwhile it adopts the different evolutionary algorithms to combine with quantum evolutionary algorithm to solve different problems, which will improve the adaptability of algorithm.
Quantum-inspired evolutionary algorithm (QEA) has been designed by integrating some quantum mechanical principles in the framework of evolutionary algorithms. They have been successfully employed as a computational technique in solving difficult optimization problems. It is well known that QEAs provide better balance between exploration and exploitation as compared to the conventional evolutionary algorithms. The population in QEA is evolved by variation operators, which move the Q-bit towards an attractor. A modification for improving the performance of QEA was proposed by changing the selection of attractors, namely, versatile QEA. The improvement attained by versatile QEA over QEA indicates the impact of population structure on the performance of QEA and motivates further investigation into employing fine-grained model. The QEA with fine-grained population model (FQEA) is similar to QEA with the exception that every individual is located in a unique position on a two-dimensional toroidal grid and has four neighbors amongst which it selects its attractor. Further, FQEA does not use migrations, which is employed by QEAs. This paper empirically investigates the effect of the three different population structures on the performance of QEA by solving well-known discrete benchmark optimization problems.