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 Symposium on Computer Science and Computational Technology

Explaining the Implicit Parallelism of Genetic Algorithm and Computational Complexity by Quantum Theory

Peng Wang

Published Jan 1, 2008• 3 citations
Publisher

Abstract

Superposition principle of quantum theory is introduced in this paper. The genetic algorithm has been described by quantum superposition theory. It implies genetic algorithm is essentially a kind of quantum algorithm in the classical computer on the reduced order to achieve. It through genetic manipulation to input superposition states data into classical computer. In the evolutionary process, a lot of implicit modes have been measured, so as to realize the parallel search and processing in the model space. It is implicit parallelism of genetic algorithm. The quantum theory can also be used to analyze the problem¿s computational complexity. Quantum superposition theory and entropy are used to get the problem¿s lower bound of computational complexity. Using this method the problem¿s lower bound of computational complexity is only decided by itself. It is independent of the algorithm¿s details.

DOI
10.1109/iscsct.2008.111

Related papers

Quantum Model of Genetic Algorithm

Peng Wang

Similarities of genetic algorithm and quantum algorithm have been analyzed based on implicit parallelism. The genetic algorithm has been described by quantum theory. Some genetic operators are seen as a kind of quantum operator. So it implies genetic algorithm is essentially a kind of quantum algorithm in the classical computer on the reduced order to achieve. It through genetic manipulation to input superposition states data into classical computer. In the evolutionary process, a lot of implicit modes have been measured, so as to realize the parallel search and processing in the model space. The uncertainty characteristic of genetic algorithm is the essential cause of implicit parallelism. This thinking could explain the immanent cause of artificial intelligence.

International Symposium on Knowledge Acquisition and Modeling (KAM)•Dec 1, 2008•3 citations

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

Quantum-Enhanced Genetic Algorithms for Complex Optimization

Jincheng Zhang

This paper presents a novel approach to complex optimization problems utilizing a hybrid Genetic Algorithm (GA) enhanced with quantum computing techniques. Classical GAs often struggle with slow convergence rates in high-dimensional search spaces. This research addresses this limitation by integrating quantum superposition and interference into the core operations of the GA, specifically crossover and mutation. The proposed method, termed Quantum-Enhanced Genetic Algorithm (Q-GA), aims to significantly accelerate the optimization process by exploring the solution space more efficiently. The core idea is to represent potential solutions within a quantum state, allowing for parallel exploration facilitated by superposition. We detail the architecture of the Q-GA, outlining the integration of classical GA components with quantum algorithms. The performance of the Q-GA is theoretically analyzed, focusing on the potential speedup achievable through quantum computation. The results presented demonstrate the promise of this hybrid approach for tackling computationally intensive optimization problems where classical GAs fall short.

•Sep 6, 2026•0 citations

Higher-Order Quantum Genetic Algorithm and Its Application on Non-Linear Equations

Lei Jin, Zheng Shan, Chunchao Hu +1 more

Abstract The high efficiency of quantum algorithms is caused by the quantum parallelism of the superposition principle and the quantum entangled, but traditional quantum genetic algorithms only use the quantum superposition principle. In order to further improve the performance of the algorithm, this paper proposes a new higher-order quantum genetic algorithm, which adds quantum entanglement properties on the basis of the principle of quantum superposition. Finally, the traditional quantum genetic algorithm and the higher-order quantum genetic algorithm are used to test a set of nonlinear equations many times. The results show that compared with the traditional quantum genetic algorithm, the evolutionary update operation of the higher-order quantum genetic algorithm does not involve multiple judgment conditions of the traditional quantum gate, requires less evolutionary algebra, and can converge quickly.

Journal of Physics Conference Series•Mar 1, 2021•0 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

Parallel quantum-inspired genetic algorithm for combinatorial optimization problem

Kuk-Hyun Han, Kui-Hong Park, Ci-Ho Lee +1 more

This paper proposes a new parallel evolutionary algorithm called parallel quantum-inspired genetic algorithm (PQGA). Quantum-inspired genetic algorithm (QGA) 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 the qubit chromosome as a representation, QGA can represent a linear superposition of solutions due to its probabilistic representation. QGA is suitable for parallel structures because of rapid convergence and good global search capability. That is, QGA is able to possess the two characteristics of exploration and exploitation simultaneously. The effectiveness and the applicability of PQGA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that PQGA is superior to QGA as well as other conventional genetic algorithms.

IEEE Congress on Evolutionary Computation (CEC)•Nov 13, 2002•192 citations
Superposition principle of quantum theory is introduced in this paper. The genetic algorithm has been described by quantum superposition theory. It implies genetic algorithm is essentially a kind of quantum algorithm in the classical computer on the reduced order to achieve. It through genetic manipulation to input superposition states data into classical computer. In the evolutionary process, a lot of implicit modes have been measured, so as to realize the parallel search and processing in the model space. It is implicit parallelism of genetic algorithm. The quantum theory can also be used to analyze the problem¿s computational complexity. Quantum superposition theory and entropy are used to get the problem¿s lower bound of computational complexity. Using this method the problem¿s lower bound of computational complexity is only decided by itself. It is independent of the algorithm¿s details.
Similarities of genetic algorithm and quantum algorithm have been analyzed based on implicit parallelism. The genetic algorithm has been described by quantum theory. Some genetic operators are seen as a kind of quantum operator. So it implies genetic algorithm is essentially a kind of quantum algorithm in the classical computer on the reduced order to achieve. It through genetic manipulation to input superposition states data into classical computer. In the evolutionary process, a lot of implicit modes have been measured, so as to realize the parallel search and processing in the model space. The uncertainty characteristic of genetic algorithm is the essential cause of implicit parallelism. This thinking could explain the immanent cause of artificial intelligence.
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 presents a novel approach to complex optimization problems utilizing a hybrid Genetic Algorithm (GA) enhanced with quantum computing techniques. Classical GAs often struggle with slow convergence rates in high-dimensional search spaces. This research addresses this limitation by integrating quantum superposition and interference into the core operations of the GA, specifically crossover and mutation. The proposed method, termed Quantum-Enhanced Genetic Algorithm (Q-GA), aims to significantly accelerate the optimization process by exploring the solution space more efficiently. The core idea is to represent potential solutions within a quantum state, allowing for parallel exploration facilitated by superposition. We detail the architecture of the Q-GA, outlining the integration of classical GA components with quantum algorithms. The performance of the Q-GA is theoretically analyzed, focusing on the potential speedup achievable through quantum computation. The results presented demonstrate the promise of this hybrid approach for tackling computationally intensive optimization problems where classical GAs fall short.
Abstract The high efficiency of quantum algorithms is caused by the quantum parallelism of the superposition principle and the quantum entangled, but traditional quantum genetic algorithms only use the quantum superposition principle. In order to further improve the performance of the algorithm, this paper proposes a new higher-order quantum genetic algorithm, which adds quantum entanglement properties on the basis of the principle of quantum superposition. Finally, the traditional quantum genetic algorithm and the higher-order quantum genetic algorithm are used to test a set of nonlinear equations many times. The results show that compared with the traditional quantum genetic algorithm, the evolutionary update operation of the higher-order quantum genetic algorithm does not involve multiple judgment conditions of the traditional quantum gate, requires less evolutionary algebra, and can converge quickly.
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.
This paper proposes a new parallel evolutionary algorithm called parallel quantum-inspired genetic algorithm (PQGA). Quantum-inspired genetic algorithm (QGA) 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 the qubit chromosome as a representation, QGA can represent a linear superposition of solutions due to its probabilistic representation. QGA is suitable for parallel structures because of rapid convergence and good global search capability. That is, QGA is able to possess the two characteristics of exploration and exploitation simultaneously. The effectiveness and the applicability of PQGA are demonstrated by experimental results on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that PQGA is superior to QGA as well as other conventional genetic algorithms.