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

Lecture notes in computer science

Genetic Algorithm Based-On the Quantum Probability Representation

Bin Li, Zhenquan Zhuang

Published Jan 1, 2002• 28 citations
Publisher
DOI
10.1007/3-540-45675-9_75

Related papers

An Improved Quantum Genetic Algorithm Based on Population Partition and Dynamic Probability Amplitude

Cheng Yao Shi, Zhao Cheng Xuan, Chao Yang +1 more

Advances in intelligent systems and computing•Nov 6, 2019•0 citations

A New Parallel Quantum Genetic Algorithm with Probability-Gate and Its Probability Analysis

MA Shu-xia, Weidong Jin

In this paper, a novel Quantum Genetic Algorithm (QGA) called Parallel Probability-gate Quantum Genetic Algorithm (PPQGA) is proposed.The main points of PPQGA are that a new chromosome representation called qubit representation, a new updating gate called probability-gate and a novel evolutionary strategy being used in update procedure are introduced.Based on the concepts and principles of quantum computing introduced, PPQGA is characterized by rapid convergence, good global search capability and the ability of possessing exploitation simultaneously.The experimental results of several special functions show that PPQGA can speedup the migration of the top individuals of subpopulations and is superior to other several genetic algorithms greatly in quality and efficiency.

International Conference on Intelligent Systems and Knowledge Engineering (ISKE)•Jan 1, 2007•5 citations

PROBABILISTIC QUANTUM CROSSOVER BASED GENETIC ALGORITHM AND ITS APPLICATION

Yang Yu, Hongwei Dai, Hui Li

ICIC express letters. Part B, Applications•Apr 1, 2014•0 citations

A Variant of Quantum Genetic Algorithm and Its Possible Applications

Pawan Kumar Tiwari, Deo Prakash Vidyarthi

Advances in intelligent and soft computing•Jan 1, 2012•5 citations

Searching ability of qubit-inspired genetic algorithm

Noriyuki Muramoto, Nobuyuki Matsui, Teijiro Isokawa

Qubit-inspired Genetic Algorithm (QGA) is an extension of genetic algorithm in which quantum mechanics and its representations are introduced. A chromosome in our QGA is concretized as a series of quantum-bit (qubit) described by its complex-valued representation, and phase-rotation gates are embedded into the selection process over generations. In our previous work, it has been shown that this scheme has better performances than the classical ones in several problems such as N-K landscape problem, Knapsack Problem, Maximum Search, and Construction of image filters. In this paper, we make clear the effectiveness of the QGA by comparing QGA with GA through minimum solution problem on De Jong's functions.

Society of Instrument and Control Engineers of Japan•Jan 1, 2012•0 citations

Novel Quantum Genetic Algorithm and Its Applications

Gexiang Zhang, Na Li, Weidong Jin +1 more

Frontiers of Electrical and Electronic Engineering in China•Jan 1, 2006•66 citations
In this paper, a novel Quantum Genetic Algorithm (QGA) called Parallel Probability-gate Quantum Genetic Algorithm (PPQGA) is proposed.The main points of PPQGA are that a new chromosome representation called qubit representation, a new updating gate called probability-gate and a novel evolutionary strategy being used in update procedure are introduced.Based on the concepts and principles of quantum computing introduced, PPQGA is characterized by rapid convergence, good global search capability and the ability of possessing exploitation simultaneously.The experimental results of several special functions show that PPQGA can speedup the migration of the top individuals of subpopulations and is superior to other several genetic algorithms greatly in quality and efficiency.
Qubit-inspired Genetic Algorithm (QGA) is an extension of genetic algorithm in which quantum mechanics and its representations are introduced. A chromosome in our QGA is concretized as a series of quantum-bit (qubit) described by its complex-valued representation, and phase-rotation gates are embedded into the selection process over generations. In our previous work, it has been shown that this scheme has better performances than the classical ones in several problems such as N-K landscape problem, Knapsack Problem, Maximum Search, and Construction of image filters. In this paper, we make clear the effectiveness of the QGA by comparing QGA with GA through minimum solution problem on De Jong's functions.