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 Intelligent Computing and Next Generation Networks (ICNGN)

Improved Bloch Quantum Genetic Algorithm Based on Elite Strategy

Maoyu Du, Qiudong Yu, Laiqi Zhao, Naichang Dai

Published Nov 23, 2024• 0 citations
Publisher

Abstract

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.

DOI
10.1109/icngn63705.2024.10871868

Related papers

Improved Quantum Genetic Algorithm and Its Application

Hongsheng Su

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.

Jisuanji gongcheng•Jan 1, 2011•8 citations

High-Order Quantum Genetic Algorithm Based on Quantum Entanglement

Han Qi, Shuai Gong, Abdullah Gani +1 more

Quantum genetic algorithms(QGA) typically construct traditional quantum chromosomes as independent quantum bit systems, which has facilitated the enhancement of search speed and precision in genetic algorithms, demonstrating powerful problem-solving capabilities in optimization issues. Although traditional QGA have enriched population diversity, they still tend to fall into local optima, and the evolutionary update operations require rotation directions to be determined by lookup tables, a process involving multiple conditional judgments that affect algorithm efficiency. To address these issues, an improved method has been proposed to further enhance the performance of QGA. In the initial population selection, a population grouping evolution method based on microhabitat coevolution strategy is used to prevent the algorithm from getting trapped in local optima when solving complex function problems. Additionally, quantum entanglement is introduced on top of quantum super-position by implementing quantum entanglement using quantum registers, and higher-order quantum rotation gates are employed that do not involve multiple conditional judgments of lookup tables, thus improving the efficiency of quantum chromosome measurement and evolutionary updates. Finally, traditional QGA and higher-order quantum genetic algorithms were applied to test functions in multiple experiments. The results indicate that, compared to traditional QGA, the higher-order quantum genetic algorithms have achieved an increase in convergence speed, an approximate 14.3% improvement in convergence precision, and possess enhanced global search capabilities.

International Conference on Electronic Engineering and Informatics (EEI)•Jun 28, 2024•2 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

A Novel Improved Quantum Genetic Algorithm

Sun He-ming

Aimed at the problem of large storage capacity and easily falling into local optimum,a novel improved quantum genetic algorithm is presented.The algorithm adopts an angle-coding method to reduce the storage space of chromosomes.For the quantum chromosomes are distributed averagely in space of initial value,small interval method is used to initialize quanta swarm.It uses the improved quantum rotation gates to renew the population and realizes adaptive search by the adjustment strategy of dynamic quantum step and uses the operation of quantum crossover and quantum mutation to prevent the premature problem.Through the typical multi-peak function optimization test,it shows that the algorithm has the faster convergence rate,the stronger global optimization ability and the shorter computing time.The algorithm can be used for multi-peak function optimization problem.

Science Technology and Engineering•Jan 1, 2012•1 citation

A novel self-adaptive quantum genetic algorithm

Linxiu Sha, Yuyao He

The current quantum evolution algorithms have slow convergence rate and poor robustness. In order to overcome the two shortages, a novel self-adaptive quantum genetic algorithm is proposed. Firstly, the new algorithm adopts an encoding method which is based on the Bloch spherical coordinates. Secondly, in the process of searching the optimal solution, a self-adaptive factor is introduced to reflect the relative change rates which are relative to the difference of the best individual's objective fitness between the parent generation and the child generation. The convergence rate and direction of the algorithm can be improved by adjusting the factor. The rules of updating the rotation angle and are constructed. Finally, using hadamard gate of the quantum in the mutation strategy, it can enhance the diversity of population. The simulation results of the optimizing problem of the multidimensional complex functions show that the new algorithm has not only avoided effectively the premature and improved the convergence rate, but also boosted strikingly efficiency and stability robustness of the algorithm.

International Conference on Natural Computation (ICNC)•May 1, 2012•3 citations

Quantum genetic algorithm based on Boltzmann selection mechanism

Haijing Ji, Junmei Sun

In order to save computation time and avoid falling into local optima in quantum genetic algorithm (QGA), this paper proposes a quantum genetic algorithm based on Boltzmann selection mechanism (B_QGA). The proposed algorithm has several novel characteristics. Firstly, Quantum bits are encoded by angle and introduce the constant factor, aiming at enhancing calculated amount. Secondly, a new dynamic rotation angle adjustment strategy is presented to achieve updated chromosome, and individuals directly evolve to the current optimal solution with linear increasing rate, which greatly improve the rate of convergence and the ability of global search. Thirdly, instead of roulette selection mode, Boltzmann selection mechanism is employed for avoiding the local optimal problem. Finally, for the selected offspring's individuals, Hadamard door is proposed to perform mutation operation to sustain stability and diversity of population. The experiment results on three complicated continuous functions show the proposed algorithm is able to find the best solution in very short time and has excellent global search ability comparing to quantum genetic algorithm (QGA) and genetic algorithm (GA).

IEEE Conference Anthology•Jan 1, 2013•1 citation
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.
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.
Quantum genetic algorithms(QGA) typically construct traditional quantum chromosomes as independent quantum bit systems, which has facilitated the enhancement of search speed and precision in genetic algorithms, demonstrating powerful problem-solving capabilities in optimization issues. Although traditional QGA have enriched population diversity, they still tend to fall into local optima, and the evolutionary update operations require rotation directions to be determined by lookup tables, a process involving multiple conditional judgments that affect algorithm efficiency. To address these issues, an improved method has been proposed to further enhance the performance of QGA. In the initial population selection, a population grouping evolution method based on microhabitat coevolution strategy is used to prevent the algorithm from getting trapped in local optima when solving complex function problems. Additionally, quantum entanglement is introduced on top of quantum super-position by implementing quantum entanglement using quantum registers, and higher-order quantum rotation gates are employed that do not involve multiple conditional judgments of lookup tables, thus improving the efficiency of quantum chromosome measurement and evolutionary updates. Finally, traditional QGA and higher-order quantum genetic algorithms were applied to test functions in multiple experiments. The results indicate that, compared to traditional QGA, the higher-order quantum genetic algorithms have achieved an increase in convergence speed, an approximate 14.3% improvement in convergence precision, and possess enhanced global search capabilities.
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.
Aimed at the problem of large storage capacity and easily falling into local optimum,a novel improved quantum genetic algorithm is presented.The algorithm adopts an angle-coding method to reduce the storage space of chromosomes.For the quantum chromosomes are distributed averagely in space of initial value,small interval method is used to initialize quanta swarm.It uses the improved quantum rotation gates to renew the population and realizes adaptive search by the adjustment strategy of dynamic quantum step and uses the operation of quantum crossover and quantum mutation to prevent the premature problem.Through the typical multi-peak function optimization test,it shows that the algorithm has the faster convergence rate,the stronger global optimization ability and the shorter computing time.The algorithm can be used for multi-peak function optimization problem.
The current quantum evolution algorithms have slow convergence rate and poor robustness. In order to overcome the two shortages, a novel self-adaptive quantum genetic algorithm is proposed. Firstly, the new algorithm adopts an encoding method which is based on the Bloch spherical coordinates. Secondly, in the process of searching the optimal solution, a self-adaptive factor is introduced to reflect the relative change rates which are relative to the difference of the best individual's objective fitness between the parent generation and the child generation. The convergence rate and direction of the algorithm can be improved by adjusting the factor. The rules of updating the rotation angle and are constructed. Finally, using hadamard gate of the quantum in the mutation strategy, it can enhance the diversity of population. The simulation results of the optimizing problem of the multidimensional complex functions show that the new algorithm has not only avoided effectively the premature and improved the convergence rate, but also boosted strikingly efficiency and stability robustness of the algorithm.
In order to save computation time and avoid falling into local optima in quantum genetic algorithm (QGA), this paper proposes a quantum genetic algorithm based on Boltzmann selection mechanism (B_QGA). The proposed algorithm has several novel characteristics. Firstly, Quantum bits are encoded by angle and introduce the constant factor, aiming at enhancing calculated amount. Secondly, a new dynamic rotation angle adjustment strategy is presented to achieve updated chromosome, and individuals directly evolve to the current optimal solution with linear increasing rate, which greatly improve the rate of convergence and the ability of global search. Thirdly, instead of roulette selection mode, Boltzmann selection mechanism is employed for avoiding the local optimal problem. Finally, for the selected offspring's individuals, Hadamard door is proposed to perform mutation operation to sustain stability and diversity of population. The experiment results on three complicated continuous functions show the proposed algorithm is able to find the best solution in very short time and has excellent global search ability comparing to quantum genetic algorithm (QGA) and genetic algorithm (GA).