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

Neurocomputing

A novel quantum swarm evolutionary algorithm and its applications

Yan Wang, Xiaoyue Feng, Yanxin Huang, Dongbing Pu, Wengang Zhou, Yanchun Liang, Chunguang Zhou

Published Nov 29, 2006• 171 citations
Publisher
DOI
10.1016/j.neucom.2006.10.001

Related papers

A Novel Deterministic Quantum Swarm Evolutionary Algorithm

Xikun Wang, Lin Fang Qian, Ling Wang +3 more

Communications in computer and information science•Jan 1, 2014•0 citations

A Novel Quantum-Behaved Particle Swarm Algorithm and Its Application

Baisong Chen, Ye Xuemei, An Li +1 more

Information Technology Journal•Jan 21, 2012•1 citation

Hybrid quantum particle swarm optimization algorithm and its application

Yukun Wang, Xuebo Chen

Science China Information Sciences•Sep 10, 2019•30 citations

Quantum-Inspired Evolutionary Algorithms and Its Application to Numerical Optimization Problems

André Vargas Abs da Cruz, Carlos Roberto Hall Barbosa, Marco Aurélio C. Pacheco +1 more

Lecture notes in computer science•Jan 1, 2004•26 citations

Quantum particle swarm evolutionary algorithm with application to system identification

Hao Li, Shiyong Li

Based on quantum evolutionary algorithm and particle swarm optimization, a quantum particle swarm evolutionary algorithm is proposed. In this algorithm, quantum angle is used to represent the qubit, a new method learning from the idea of particle swarm algorithm is presented to determine rotation angle, He gate is taken to prevent from premature convergence. Applying this algorithm to identify system parameter, and comparing with conventional genetic algorithm and quantum evolutionary algorithm, the experimental results illustrate that the proposed algorithm has better performance than that of others. Meanwhile, it can also keep high identification ability to the system with the existence of noise.

International Conference on Measurement, Information and Control•May 1, 2012•4 citations

Hybrid Quantum Evolutionary Algorithms and its Application

Yafei Tian

Inspired by the idea of hybrid optimization algorithms,this paper proposes two hybrid Quantum Evolutionary Algorithms(QEA) based on combining QEA with Particle Swarm Optimization(PSO).The main idea of the first method called PSEQEA is to embed the evolutionary equation of PSO in QEA;while the main idea of the second method called QBPSO is to apply the quantum chromosomes of QEA to binary PSO(BPSO).The experiment results of the knapsack problem and multiuser detection problem show that the both of the proposed methods not only have simpler algorithm structure,but also perform better than conventional QEA and BPSO in terms of ability of global optimum.

Computer Engineering and Applications Journal•Jan 1, 2006•2 citations
Based on quantum evolutionary algorithm and particle swarm optimization, a quantum particle swarm evolutionary algorithm is proposed. In this algorithm, quantum angle is used to represent the qubit, a new method learning from the idea of particle swarm algorithm is presented to determine rotation angle, He gate is taken to prevent from premature convergence. Applying this algorithm to identify system parameter, and comparing with conventional genetic algorithm and quantum evolutionary algorithm, the experimental results illustrate that the proposed algorithm has better performance than that of others. Meanwhile, it can also keep high identification ability to the system with the existence of noise.
Inspired by the idea of hybrid optimization algorithms,this paper proposes two hybrid Quantum Evolutionary Algorithms(QEA) based on combining QEA with Particle Swarm Optimization(PSO).The main idea of the first method called PSEQEA is to embed the evolutionary equation of PSO in QEA;while the main idea of the second method called QBPSO is to apply the quantum chromosomes of QEA to binary PSO(BPSO).The experiment results of the knapsack problem and multiuser detection problem show that the both of the proposed methods not only have simpler algorithm structure,but also perform better than conventional QEA and BPSO in terms of ability of global optimum.