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

Jisuanji gongcheng

Improved Quantum Genetic Algorithm and Its Application

Hongsheng Su

Published Jan 1, 2011• 8 citations
OpenAlex

Abstract

In order to solve the problems of optimization efficiency and inferior local search of quantum genetic algorithm whose coding is based on bloch coordinates,this paper proposes two improvements,combines local search with global search which is based on comparative population,and expands the search space from one sphere to three-sphere according to the characteristics of three chains.With the application of function extreme optimization of multi-variables,simulation results show that the improved algorithm has lower generation,higher efficiency,diverse populations,and it proves that the improvement is efficient.

Related papers

Quantum genetic algorithm based on multi-chain coding scheme

He Jian

In order to improve the efficiency of the quantum genetic algorithm,this paper proposed a quantum genetic algorithm based on a expanded multi-chain coding scheme.The algorithm took qubit as chromosome.Each chromosome generated multiple and parallel gene chains which were mapping to multiple optimized solutions by separating qubit into multiple and parallel genes.The expanded genes chains expanded the searching space effectively and increased evolutionary rate for quantum genetic algorithm.It introduced the dynamic adjusting rotation angle mechanism to quantum rotation gate to guide individual evolution and used quantum not-gate to prevent algorithm occurring premature convergence.The method further improved searching efficiency.In the simulation experiment,analysed the influence for the algorithm with different variation probability([0,0.1,…,0.9,1])and used different code schemes to optimize extremal function.The simulation experiment result shows that it can obviously improve the efficiency of quantum genetic algorithm by adding gene chain,and the quantum genetic algorithm based on a expanded multi-chain coding scheme is efficient.

Jisuanji yingyong yanjiu•Jan 1, 2012•2 citations

Improved Bloch Quantum Genetic Algorithm Based on Elite Strategy

Maoyu Du, Qiudong Yu, Laiqi Zhao +1 more

Function optimization is an important problem in the fields of mathematics and computer science, with wide applications in various real-world domains. Quantum genetic algorithm is a global, parallel, and efficient search method used to solve function optimization and search problems. The Bloch Quantum Evolution Algorithm (BQEA) based on quantum bit Bloch sphere coordinates greatly expands the proportion of optimal solutions, but also expands the search space, making the algorithm prone to falling into local optima. This article proposes a new improved Bloch Elite Quantum Genetic Algorithm (BEQGA) by increasing the number of elite individuals and improving the optimization method of fixed rotation angles. Through multiple simulation experiments, it has been proven that BEQGA has a certain improvement in search ability compared to BQEA, and this has been validated in the research of key technologies for high-precision flexible bag feeding packaging equipment.

International Conference on Intelligent Computing and Next Generation Networks (ICNGN)•Nov 23, 2024•0 citations

Adaptive quantum genetic algorithm based on Bloch sphere

Rong-hua HE

An adaptive quantum genetic algorithm based on Bloch sphere is proposed based on the quantum genetic algorithm which is based on Bloch coordinates of qubits.The algorithm uses two ways to select a part of the Bloch sphere for searching:along the warp direction and weft direction.The paper proves that the two methods are able to contain all the solutions of the continuous optimization problem in theory,and proposes a method of approximately equal-area to search the selected Bloch sphere,and derives the inverse relationship between the two-phase.The chromosomes mutation is modified to meet the restrictions of selected region.The simulation results show that the approach is equal to quantum genetic algorithm based on Bloch coordinates of qubits in search capability,but the optimization efficiency is significantly improved.

Computer Engineering and Applications Journal•Jan 1, 2012•2 citations

Generalized Quantum Genetic Algorithm of Multidimensional Space

Xiaofeng Zhang, Wei Miao, Guifang Sui +1 more

Quantum coding plays an important role in quantum genetic algorithm and affects the optimizing efficiency of algorithm, However, there are some defects in existing quantum genetic algorithm: the quantum coding scheme reduces the stability of the algorithm, making the algorithm easily occurs premature convergence and falls into local extremums.Therefore, coding scheme of multi gene chain is extended in a four dimensional space and multidimensional space based on an improved algorithm.Through simulation experiments of function extremum, combine double and triplestranded coding scheme, in accordance with the characteristics of qubits and the normalization condition.Through the experiment, study the effect of multiple genes encoding scheme chain on the performance of the algorithm.The results show that the optimal results of the algorithm can be better and the precision of solution can be higher by increasing the genetic chain.It is an effective strategy to improve the performance of algorithm.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2014•0 citations

Improved quantum genetic algorithm and its application

YU Rui-qin

New methods are joined into the quantum genetic algorithm to solve the defects of poor local search ability and more iterative times.The algorithm is the core of a new quantum rotation gate adjustment strategy,which updates the population,so it has better diversity than the classical genetic algorithm,rapid convergence and good global search capacity characterize the performance of the quantum genetic algorithm.According to the test of typical complex function,the results show that the algorithm to the quality of opti-mization and efficiency are superior to traditional genetic algorithm and general quantum genetic algorithm.

Jisuanji gongcheng yu sheji•Jan 1, 2009•3 citations

Multiple Quantum Spaces Based Genetic Coding Method

Tao Gao

Quantum genetic coding method plays an important role in improving the efficiency of optimization algorithm. The existing quantum genetic algorithm has some defects, that quantum encoding scheme is tend to reduce the stability, so that the algorithm is prone to premature convergence and falls into local minima. Therefore, the chain of multiple genes encoding scheme is used to extend in the multi-dimensional space for improving this algorithm. By function extremum and simulation of neural network weights optimization, according to the characteristics of qubits and the normalization condition, double and triple chain binding coding schemes are proposed. By experiments on multiple genes encoding scheme chain, the performance of the algorithm is tested. It shows that the algorithm can get better results by increasing the higher accuracy of solution chain genes. It is an effective strategy to improve the performance of genetic coding.

International Journal of Advanced Pervasive and Ubiquitous Computing•Apr 1, 2014•0 citations
In order to solve the problems of optimization efficiency and inferior local search of quantum genetic algorithm whose coding is based on bloch coordinates,this paper proposes two improvements,combines local search with global search which is based on comparative population,and expands the search space from one sphere to three-sphere according to the characteristics of three chains.With the application of function extreme optimization of multi-variables,simulation results show that the improved algorithm has lower generation,higher efficiency,diverse populations,and it proves that the improvement is efficient.
In order to improve the efficiency of the quantum genetic algorithm,this paper proposed a quantum genetic algorithm based on a expanded multi-chain coding scheme.The algorithm took qubit as chromosome.Each chromosome generated multiple and parallel gene chains which were mapping to multiple optimized solutions by separating qubit into multiple and parallel genes.The expanded genes chains expanded the searching space effectively and increased evolutionary rate for quantum genetic algorithm.It introduced the dynamic adjusting rotation angle mechanism to quantum rotation gate to guide individual evolution and used quantum not-gate to prevent algorithm occurring premature convergence.The method further improved searching efficiency.In the simulation experiment,analysed the influence for the algorithm with different variation probability([0,0.1,…,0.9,1])and used different code schemes to optimize extremal function.The simulation experiment result shows that it can obviously improve the efficiency of quantum genetic algorithm by adding gene chain,and the quantum genetic algorithm based on a expanded multi-chain coding scheme is efficient.
Function optimization is an important problem in the fields of mathematics and computer science, with wide applications in various real-world domains. Quantum genetic algorithm is a global, parallel, and efficient search method used to solve function optimization and search problems. The Bloch Quantum Evolution Algorithm (BQEA) based on quantum bit Bloch sphere coordinates greatly expands the proportion of optimal solutions, but also expands the search space, making the algorithm prone to falling into local optima. This article proposes a new improved Bloch Elite Quantum Genetic Algorithm (BEQGA) by increasing the number of elite individuals and improving the optimization method of fixed rotation angles. Through multiple simulation experiments, it has been proven that BEQGA has a certain improvement in search ability compared to BQEA, and this has been validated in the research of key technologies for high-precision flexible bag feeding packaging equipment.
An adaptive quantum genetic algorithm based on Bloch sphere is proposed based on the quantum genetic algorithm which is based on Bloch coordinates of qubits.The algorithm uses two ways to select a part of the Bloch sphere for searching:along the warp direction and weft direction.The paper proves that the two methods are able to contain all the solutions of the continuous optimization problem in theory,and proposes a method of approximately equal-area to search the selected Bloch sphere,and derives the inverse relationship between the two-phase.The chromosomes mutation is modified to meet the restrictions of selected region.The simulation results show that the approach is equal to quantum genetic algorithm based on Bloch coordinates of qubits in search capability,but the optimization efficiency is significantly improved.
Quantum coding plays an important role in quantum genetic algorithm and affects the optimizing efficiency of algorithm, However, there are some defects in existing quantum genetic algorithm: the quantum coding scheme reduces the stability of the algorithm, making the algorithm easily occurs premature convergence and falls into local extremums.Therefore, coding scheme of multi gene chain is extended in a four dimensional space and multidimensional space based on an improved algorithm.Through simulation experiments of function extremum, combine double and triplestranded coding scheme, in accordance with the characteristics of qubits and the normalization condition.Through the experiment, study the effect of multiple genes encoding scheme chain on the performance of the algorithm.The results show that the optimal results of the algorithm can be better and the precision of solution can be higher by increasing the genetic chain.It is an effective strategy to improve the performance of algorithm.
New methods are joined into the quantum genetic algorithm to solve the defects of poor local search ability and more iterative times.The algorithm is the core of a new quantum rotation gate adjustment strategy,which updates the population,so it has better diversity than the classical genetic algorithm,rapid convergence and good global search capacity characterize the performance of the quantum genetic algorithm.According to the test of typical complex function,the results show that the algorithm to the quality of opti-mization and efficiency are superior to traditional genetic algorithm and general quantum genetic algorithm.
Quantum genetic coding method plays an important role in improving the efficiency of optimization algorithm. The existing quantum genetic algorithm has some defects, that quantum encoding scheme is tend to reduce the stability, so that the algorithm is prone to premature convergence and falls into local minima. Therefore, the chain of multiple genes encoding scheme is used to extend in the multi-dimensional space for improving this algorithm. By function extremum and simulation of neural network weights optimization, according to the characteristics of qubits and the normalization condition, double and triple chain binding coding schemes are proposed. By experiments on multiple genes encoding scheme chain, the performance of the algorithm is tested. It shows that the algorithm can get better results by increasing the higher accuracy of solution chain genes. It is an effective strategy to improve the performance of genetic coding.