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

Computer Engineering and Applications Journal

Fuzzy quantum genetic algorithm and its application

Guoliang Zhao

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

A fuzzy quantum genetic algorithm based on fuzzy logic and quantum theory is presented.Using fuzzy logic controller,chromosomes are renovated by quantum rotating gates,mutated by quantum non-gate adaptively.Rotating angle of rotating gate and mutational probability are adjusted automatically by fuzzy controller.Simulation result indicates that the FQGA is characterized by rapid convergence,good global search capability and less computing time.

Related papers

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 Quantum Genetic Algorithm and Its Application

Gexiang Zhang

This paper proposes a novel quantum genetic algorithm (NQGA),whose core is that the strategies of updating quantum gate using qubit phase comparison approach and adjusting search grid adaptively are introduced.NQGA is characterized by rapid convergence,good global search capability and short computing time.Test results of complex functions and application example demonstrate NQGA is superior to conventional genetic algorithms in quality and efficiency.

Dianzi xuebao•Jan 1, 2004•49 citations

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 with Application

Cao Mao-jun

Due to frequent decoding operations, the efficiency of optimization is severely reduced when the binary quantum genetic algorithm based on qubits measure is applied to the continuous space optimization.To solve this problem, a quantum genetic algorithm based on phase encoding is proposed.In this method, the chromosomes are encoded by the phase of qubits, evolved by quantum rotation gates, and mutated by quantum Pauli-Z gates.As the optimization process is performed in 0,2πn, which has nothing to do with specific issues, therefore, the proposed method has good adaptability for a variety of optimization problems.With application of function extremum optimization, the simulation results show that the approach is superior to common quantum genetic algorithm and simple genetic algorithm in both search capability and optimization efficiency.

Science Technology and Engineering•Jan 1, 2010•0 citations

Quantum genetic algorithm based on real encoding and gradient information of object function

Panchi Li

A quantum genetic algorithm based on real number encoding and gradient of object function is presented. In this study, chromosomes are comprised of quantum bits encoded by real number. Chromosomes are renovated by quantum rotating gates and mutated by quantum non - gate. For direction of rotating angle of rotating gate, a convenient method is shown. The gradients of object function are utilized in choosing the value of rotating angle. In this method each quantum bit is regarded as two coordinate genes, each chromosome contains two chain of genes, each chain of genes represents a optimization result. Therefore, a double searching space is acquired for the same number of chromosomes. Finally the availability of the approach is illustrated by two application examples of function extremum and weighting optimization of neural networks.

Ha'erbin gongye daxue xuebao•Jan 1, 2006•29 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
A fuzzy quantum genetic algorithm based on fuzzy logic and quantum theory is presented.Using fuzzy logic controller,chromosomes are renovated by quantum rotating gates,mutated by quantum non-gate adaptively.Rotating angle of rotating gate and mutational probability are adjusted automatically by fuzzy controller.Simulation result indicates that the FQGA is characterized by rapid convergence,good global search capability and less computing time.
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.
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.
Due to frequent decoding operations, the efficiency of optimization is severely reduced when the binary quantum genetic algorithm based on qubits measure is applied to the continuous space optimization.To solve this problem, a quantum genetic algorithm based on phase encoding is proposed.In this method, the chromosomes are encoded by the phase of qubits, evolved by quantum rotation gates, and mutated by quantum Pauli-Z gates.As the optimization process is performed in 0,2πn, which has nothing to do with specific issues, therefore, the proposed method has good adaptability for a variety of optimization problems.With application of function extremum optimization, the simulation results show that the approach is superior to common quantum genetic algorithm and simple genetic algorithm in both search capability and optimization efficiency.
A quantum genetic algorithm based on real number encoding and gradient of object function is presented. In this study, chromosomes are comprised of quantum bits encoded by real number. Chromosomes are renovated by quantum rotating gates and mutated by quantum non - gate. For direction of rotating angle of rotating gate, a convenient method is shown. The gradients of object function are utilized in choosing the value of rotating angle. In this method each quantum bit is regarded as two coordinate genes, each chromosome contains two chain of genes, each chain of genes represents a optimization result. Therefore, a double searching space is acquired for the same number of chromosomes. Finally the availability of the approach is illustrated by two application examples of function extremum and weighting optimization of neural networks.
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.