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

An Improved Quantum Genetic Algorithm of Quantum Revolving Gate

Yang Guo-weia

Published Jan 1, 2013• 5 citations
OpenAlex

Abstract

Aiming at the problems that the Quantum Genetic Algorithm(QGA) easily falls into local extremum,an improved QGA algorithm of quantum revolving gate is proposed.In order to achieve the goal of optimization solving,quantum bit probability amplitude is applied to the chromosome encoding,and quantum rotation gate is used to chromosome updating.The theoretical derivation proves that the proposed algorithm converges with probability 1,and the algorithm converges strongly to 1?e.Comparing with double QGA,simulation results show that the algorithm increases complexity,the average time extension,but convergence times increase,convergence times of the function 1 increases from 3 to 7,and convergence times of the function 2 increases from 8 to 9.

Related papers

Quantum genetic algorithm based on phase comparison

Hao Li

Aiming at the issue that quantum genetic algorithm is not suitable for continuons function optimization,an improved quantum genetic algorithm is proposed.This algorithm directly compares the quantum chromosomes with the current best solution to determine the rotating angle of the rotating gate.Every individual in population evolves with different rates to complete local search and global search simultaneously.Mutation operation is used to prevent the premature convergence.After analyzing the algorithm and its global convergence,this algorithm is applied to solve the function extremum and to optimize the PID controller parameters,and it is compared with the standard genetic algorithm and the quantum genetic algorithm.Experimental results illustrate that the proposed algorithm has better performance.

Systems engineering and electronics•Jan 1, 2010•2 citations

A Novel Quantum Genetic Algorithm for Continuous Function Optimization

Hao Li, Shi Yong Li

In this paper, a novel quantum genetic algorithm is proposed. This algorithm compares the probability expectation of the quantum chromosome with the best binary solution to determine rotation angle of rotation gate. Different individual in population evolve with different rate to complete local search and global search simultaneously. Hε gate is used to prevent the algorithm from premature convergence. After analyzing the algorithm and its global convergence, applying this approach to the optimization of function extremum, and comparing with the simple genetic algorithm and the quantum genetic algorithm, the simulation result illustrates that the algorithm has the characteristic of quick convergence speed and high solution precision.

Advanced materials research•Sep 23, 2013•0 citations

An Improved Quantum Genetic Algorithm

Jian Bao Guo, Lijuan Sun, Ruchuan Wang +1 more

Quantum genetic algorithm (QGA) is the combination between genetic algorithm and quantum computing. In this paper, a chromosome of the standard QGA is seen as a node and the chromosome population is regarded as a network. Then the reasons for the prematurity and the stagnation of the standard QGA are analyzed from the perspective of network structure. To solve the two problems, an improved quantum genetic algorithm (IQGA) based on the small world theory is proposed. In IQGA, chromosomes encoded with qubits are divided into some sub-groups and the NW network model is introduced into the population structure. When updating chromosomes, an optimal chromosome in locality or in other sub-groups is chosen based on a certain probability as the evolution target for each chromosome. The new network structure of the chromosome population has a relatively moderate clustering coefficient and is favorable to the diversity of individual chromosomes. Tests of three classic functions prove the effectiveness and superiority of IQGA.

International Conference on Genetic and Evolutionary Computing•Oct 1, 2009•22 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

Quantum genetic algorithm with application in fuzzy controller parameter optimization

Yuan Li-ying

A quantum genetic algorithm based on real number encoding and gradient of fitness function is proposed in this paper.Chromosomes comprised of quantum bits are updated by quantum rotating gates,and are mutated by quantum non-gate.A convenient method to choose the direction of rotation angle of quantum rotation gate is proposed.The computation formula of the rotation angle value is constructed by the gradients of fitness function.In this method,two probability amplitude of each quantum bit are regarded as two coordinate genes;each chromosome contains two chains of genes;and each chain of genes represents an optimization result.This method can accelerate convergence process and increase successful probability with the same number of chromosomes.Its application to fuzzy controller parameters optimization illustrates that the approach is superior to common quantum genetic algorithm in searching ability.

Systems engineering and electronics•Jan 1, 2007•6 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
Aiming at the problems that the Quantum Genetic Algorithm(QGA) easily falls into local extremum,an improved QGA algorithm of quantum revolving gate is proposed.In order to achieve the goal of optimization solving,quantum bit probability amplitude is applied to the chromosome encoding,and quantum rotation gate is used to chromosome updating.The theoretical derivation proves that the proposed algorithm converges with probability 1,and the algorithm converges strongly to 1?e.Comparing with double QGA,simulation results show that the algorithm increases complexity,the average time extension,but convergence times increase,convergence times of the function 1 increases from 3 to 7,and convergence times of the function 2 increases from 8 to 9.
Aiming at the issue that quantum genetic algorithm is not suitable for continuons function optimization,an improved quantum genetic algorithm is proposed.This algorithm directly compares the quantum chromosomes with the current best solution to determine the rotating angle of the rotating gate.Every individual in population evolves with different rates to complete local search and global search simultaneously.Mutation operation is used to prevent the premature convergence.After analyzing the algorithm and its global convergence,this algorithm is applied to solve the function extremum and to optimize the PID controller parameters,and it is compared with the standard genetic algorithm and the quantum genetic algorithm.Experimental results illustrate that the proposed algorithm has better performance.
In this paper, a novel quantum genetic algorithm is proposed. This algorithm compares the probability expectation of the quantum chromosome with the best binary solution to determine rotation angle of rotation gate. Different individual in population evolve with different rate to complete local search and global search simultaneously. Hε gate is used to prevent the algorithm from premature convergence. After analyzing the algorithm and its global convergence, applying this approach to the optimization of function extremum, and comparing with the simple genetic algorithm and the quantum genetic algorithm, the simulation result illustrates that the algorithm has the characteristic of quick convergence speed and high solution precision.
Quantum genetic algorithm (QGA) is the combination between genetic algorithm and quantum computing. In this paper, a chromosome of the standard QGA is seen as a node and the chromosome population is regarded as a network. Then the reasons for the prematurity and the stagnation of the standard QGA are analyzed from the perspective of network structure. To solve the two problems, an improved quantum genetic algorithm (IQGA) based on the small world theory is proposed. In IQGA, chromosomes encoded with qubits are divided into some sub-groups and the NW network model is introduced into the population structure. When updating chromosomes, an optimal chromosome in locality or in other sub-groups is chosen based on a certain probability as the evolution target for each chromosome. The new network structure of the chromosome population has a relatively moderate clustering coefficient and is favorable to the diversity of individual chromosomes. Tests of three classic functions prove the effectiveness and superiority of IQGA.
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).
A quantum genetic algorithm based on real number encoding and gradient of fitness function is proposed in this paper.Chromosomes comprised of quantum bits are updated by quantum rotating gates,and are mutated by quantum non-gate.A convenient method to choose the direction of rotation angle of quantum rotation gate is proposed.The computation formula of the rotation angle value is constructed by the gradients of fitness function.In this method,two probability amplitude of each quantum bit are regarded as two coordinate genes;each chromosome contains two chains of genes;and each chain of genes represents an optimization result.This method can accelerate convergence process and increase successful probability with the same number of chromosomes.Its application to fuzzy controller parameters optimization illustrates that the approach is superior to common quantum genetic algorithm in searching ability.
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.