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

Jilin Normal University Journal

Brief Analysis Contrast Between Genetic Quantum Algorithm and Genetic Algorithms in Resolving Extremal Problem of the Function

Chen Zhuo-ran

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

Genetic Algorithms is one kind of the algorithm of simulating biological evolution.It is made use of broadly in fields such as signal processing,pattern recognition,artificial life.Genetic Quantum Algorithm combines genetic algorithm with quantum computing.It adopts the quantum place chromosome expression form;the algorithm is based on qubit and the superposition of qubit,and adds quantum gate interferential strategy making various characteristic property of much better feasible evolution chromosome.The experiment indicates that Genetic Quantum Algorithm has more advantage in resolving optimizing problem of the function than Genetic Algorithms.

Related papers

A novel genetic algorithm based on the quantum chromosome

Shuyuan Yang, Fang Liu

The genetic algorithm is an efficient optimization tool for its independence of problems, intrinsic parallelism and inherent learning capacity; however, it has some disadvantages such as slow convergence and prematurity. In this paper, a novel algorithm, called the quantum genetic algorithm—QGA, is proposed based on the combination of the quantum theory with the evolutionary theory. By adopting the qubit chromosome as a representation, QGA can represent a linear superposition of solutions due to its probabilistic representation. The random observation simulating the quantum collapse can bring diverse individuals, and the evolution of quantum chromosome can also pilot the evolution. So it has better diversity than the classical genetic algorithm. Rapid convergence and good global search capacity characterize the performance of QGA. The paper not only proves the global convergence of the QGA, but also some simulation experiments are shown to prove its superiority over other algorithms.

Journal of Xidian University•Jan 1, 2004•13 citations

Genetic quantum algorithm and its application to combinatorial optimization problem

Kuk-Hyun Han, Jong-Hwan Kim

This paper proposes a novel evolutionary computing method called a genetic quantum algorithm (GQA). GQA is based on the concept and principles of quantum computing such as qubits and superposition of states. Instead of binary, numeric, or symbolic representation, by adopting qubit chromosome as a representation GQA can represent a linear superposition of solutions due to its probabilistic representation. As genetic operators, quantum gates are employed for the search of the best solution. Rapid convergence and good global search capability characterize the performance of GQA. The effectiveness and the applicability of GQA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that GQA is superior to other genetic algorithms using penalty functions, repair methods and decoders.

IEEE Congress on Evolutionary Computation (CEC)•Nov 7, 2002•679 citations

A genetic algorithm based on quantum chromosome

Shuyuan Yang, Min Wang, Licheng Jiao

In this paper, we propose a novel genetic algorithm based on the quantum chromosome - QGA. We adopt quantum chromosome to represent a linear superposition of solutions, after the observation that simulates the quantum collapse. The algorithm has better diversity than its counterpart. In addition, the quantum evolutionary operator - quantum mutation is constructed, which is used to speed up the convergence. Rapid convergence and global search capacity characterize the performance of QGA. The paper also gives some simulation experiments to prove its superiority over the classical genetic algorithm.

International Conference on Signal Processing•Jun 28, 2005•20 citations

Optimization with Quantum Genetic Algorithm

Bhaskar Das, Utpal Roy

Recent development in quantum technology have shown that quan-tum computer can provide a dramatic advantage over classical com-puters for some algorithms. In particular, a polynomial-time algo-rithm for factoring, a problem which was previously thought to be hard for classical computers, has recently been developed [13]. Similarly, a quantum algorithm searching for unsorted database in square root of time it would take on a classical computer has also been described by Grover [4]- [3]. Both algorithms rely upon the inherent parallelism, superposition and entanglement property of quantum computing to achieve their improvements. Since most problems of real interest for genetic algorithms have a vast search space, it seems appropriate how quantum parallelism can be ap-plied to Genetic Algorithms. In this paper we provide a brief back-ground of quantum computers. We explain why and how quan-tum algorithms provides a fundamental improvements over classi-cal ones for some problems. Further, we present here the Conven-tional Genetic Algorithm and the quantum approach of Genetical Algorithms(QGA) as well. The benefits and drawbacks of QGA are also analyzed. Moreover, this paper provides an improved version over the con-ventional QGA. This improvement originates from the best partial immigration technique applied to the quantum chromosomes. The main objective of the best partial immigration is to consider the string of qubits from the quantum chromosomes having best fit-ness and transfer the same randomly to the chromosomes of next generation for better mixing. The process is reiterated. To observe the performance the best partial immigration technique we have considered some popular optimization problems and performed the experiment on it. These problems are namely Travelling Salesman Problem(TSP), Binpacking Problem and Vertex Cover Problem. It has been observed that the obtained results outperforms the con-ventional QGA. 1.

International Journal of Computer Applications•Sep 18, 2014•18 citations

Genetic Algorithms and Quantum Computation

Gilson Antonio Giraldi, Renato Portugal, Ricardo N. Thess

Recently, researchers have applied genetic algorithms (GAs) to address some problems in quantum computation. Also, there has been some works in the designing of genetic algorithms based on quantum theoretical concepts and techniques. The so called Quantum Evolutionary Programming has two major sub-areas: Quantum Inspired Genetic Algorithms (QIGAs) and Quantum Genetic Algorithms (QGAs). The former adopts qubit chromosomes as representations and employs quantum gates for the search of the best solution. The later tries to solve a key question in this field: what GAs will look like as an implementation on quantum hardware? As we shall see, there is not a complete answer for this question. An important point for QGAs is to build a quantum algorithm that takes advantage of both the GA and quantum computing parallelism as well as true randomness provided by quantum computers. In the first part of this paper we present a survey of the main works in GAs plus quantum computing including also our works in this area. Henceforth, we review some basic concepts in quantum computation and GAs and emphasize their inherent parallelism. Next, we review the application of GAs for learning quantum operators and circuit design. Then, quantum evolutionary programming is considered. Finally, we present our current research in this field and some perspectives.

arXiv:cs/0403003•Mar 4, 2004•22 citations

Function Optimization Based on Quantum Genetic Algorithm

Ying Sun, Hegen Xiong

Optimization method is important in engineering design and application. Quantum genetic algorithm has the characteristics of good population diversity, rapid convergence and good global search capability and so on. It combines quantum algorithm with genetic algorithm. A novel quantum genetic algorithm is proposed, which is called Variable-boundary-coded Quantum Genetic Algorithm (vbQGA) in which qubit chromosomes are collapsed into variable-boundary-coded chromosomes instead of binary-coded chromosomes. Therefore much shorter chromosome strings can be gained. The method of encoding and decoding of chromosome is first described before a new adaptive selection scheme for angle parameters used for rotation gate is put forward based on the core ideas and principles of quantum computation. Eight typical functions are selected to optimize to evaluate the effectiveness and performance of vbQGA against standard Genetic Algorithm (sGA) and Genetic Quantum Algorithm (GQA). The simulation results show that vbQGA is significantly superior to sGA in all aspects and outperforms GQA in robustness and solving velocity, especially for multidimensional and complicated functions.

Research Journal of Applied Sciences Engineering and Technology•Jan 1, 2014•12 citations
Genetic Algorithms is one kind of the algorithm of simulating biological evolution.It is made use of broadly in fields such as signal processing,pattern recognition,artificial life.Genetic Quantum Algorithm combines genetic algorithm with quantum computing.It adopts the quantum place chromosome expression form;the algorithm is based on qubit and the superposition of qubit,and adds quantum gate interferential strategy making various characteristic property of much better feasible evolution chromosome.The experiment indicates that Genetic Quantum Algorithm has more advantage in resolving optimizing problem of the function than Genetic Algorithms.
The genetic algorithm is an efficient optimization tool for its independence of problems, intrinsic parallelism and inherent learning capacity; however, it has some disadvantages such as slow convergence and prematurity. In this paper, a novel algorithm, called the quantum genetic algorithm—QGA, is proposed based on the combination of the quantum theory with the evolutionary theory. By adopting the qubit chromosome as a representation, QGA can represent a linear superposition of solutions due to its probabilistic representation. The random observation simulating the quantum collapse can bring diverse individuals, and the evolution of quantum chromosome can also pilot the evolution. So it has better diversity than the classical genetic algorithm. Rapid convergence and good global search capacity characterize the performance of QGA. The paper not only proves the global convergence of the QGA, but also some simulation experiments are shown to prove its superiority over other algorithms.
This paper proposes a novel evolutionary computing method called a genetic quantum algorithm (GQA). GQA is based on the concept and principles of quantum computing such as qubits and superposition of states. Instead of binary, numeric, or symbolic representation, by adopting qubit chromosome as a representation GQA can represent a linear superposition of solutions due to its probabilistic representation. As genetic operators, quantum gates are employed for the search of the best solution. Rapid convergence and good global search capability characterize the performance of GQA. The effectiveness and the applicability of GQA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that GQA is superior to other genetic algorithms using penalty functions, repair methods and decoders.
In this paper, we propose a novel genetic algorithm based on the quantum chromosome - QGA. We adopt quantum chromosome to represent a linear superposition of solutions, after the observation that simulates the quantum collapse. The algorithm has better diversity than its counterpart. In addition, the quantum evolutionary operator - quantum mutation is constructed, which is used to speed up the convergence. Rapid convergence and global search capacity characterize the performance of QGA. The paper also gives some simulation experiments to prove its superiority over the classical genetic algorithm.
Recent development in quantum technology have shown that quan-tum computer can provide a dramatic advantage over classical com-puters for some algorithms. In particular, a polynomial-time algo-rithm for factoring, a problem which was previously thought to be hard for classical computers, has recently been developed [13]. Similarly, a quantum algorithm searching for unsorted database in square root of time it would take on a classical computer has also been described by Grover [4]- [3]. Both algorithms rely upon the inherent parallelism, superposition and entanglement property of quantum computing to achieve their improvements. Since most problems of real interest for genetic algorithms have a vast search space, it seems appropriate how quantum parallelism can be ap-plied to Genetic Algorithms. In this paper we provide a brief back-ground of quantum computers. We explain why and how quan-tum algorithms provides a fundamental improvements over classi-cal ones for some problems. Further, we present here the Conven-tional Genetic Algorithm and the quantum approach of Genetical Algorithms(QGA) as well. The benefits and drawbacks of QGA are also analyzed. Moreover, this paper provides an improved version over the con-ventional QGA. This improvement originates from the best partial immigration technique applied to the quantum chromosomes. The main objective of the best partial immigration is to consider the string of qubits from the quantum chromosomes having best fit-ness and transfer the same randomly to the chromosomes of next generation for better mixing. The process is reiterated. To observe the performance the best partial immigration technique we have considered some popular optimization problems and performed the experiment on it. These problems are namely Travelling Salesman Problem(TSP), Binpacking Problem and Vertex Cover Problem. It has been observed that the obtained results outperforms the con-ventional QGA. 1.
Recently, researchers have applied genetic algorithms (GAs) to address some problems in quantum computation. Also, there has been some works in the designing of genetic algorithms based on quantum theoretical concepts and techniques. The so called Quantum Evolutionary Programming has two major sub-areas: Quantum Inspired Genetic Algorithms (QIGAs) and Quantum Genetic Algorithms (QGAs). The former adopts qubit chromosomes as representations and employs quantum gates for the search of the best solution. The later tries to solve a key question in this field: what GAs will look like as an implementation on quantum hardware? As we shall see, there is not a complete answer for this question. An important point for QGAs is to build a quantum algorithm that takes advantage of both the GA and quantum computing parallelism as well as true randomness provided by quantum computers. In the first part of this paper we present a survey of the main works in GAs plus quantum computing including also our works in this area. Henceforth, we review some basic concepts in quantum computation and GAs and emphasize their inherent parallelism. Next, we review the application of GAs for learning quantum operators and circuit design. Then, quantum evolutionary programming is considered. Finally, we present our current research in this field and some perspectives.
Optimization method is important in engineering design and application. Quantum genetic algorithm has the characteristics of good population diversity, rapid convergence and good global search capability and so on. It combines quantum algorithm with genetic algorithm. A novel quantum genetic algorithm is proposed, which is called Variable-boundary-coded Quantum Genetic Algorithm (vbQGA) in which qubit chromosomes are collapsed into variable-boundary-coded chromosomes instead of binary-coded chromosomes. Therefore much shorter chromosome strings can be gained. The method of encoding and decoding of chromosome is first described before a new adaptive selection scheme for angle parameters used for rotation gate is put forward based on the core ideas and principles of quantum computation. Eight typical functions are selected to optimize to evaluate the effectiveness and performance of vbQGA against standard Genetic Algorithm (sGA) and Genetic Quantum Algorithm (GQA). The simulation results show that vbQGA is significantly superior to sGA in all aspects and outperforms GQA in robustness and solving velocity, especially for multidimensional and complicated functions.