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

Genetic and Evolutionary Computation Conference (GECCO)

Hybrid quantum particle swarm optimization algorithm for combinatorial optimization problem

Jiahai Wang, Yanlan Zhou

Published Jul 7, 2007• 3 citations
Publisher

Abstract

In this paper, a framework of hybrid PSO is proposed by reasonablycombining the Q-bit evolutionary search of quantum PSO and binary bit evolutionary search of genetic PSO.
DOI
10.1145/1276958.1276999

Related papers

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

Improved Quantum Evolutionary Computation Based on Particle Swarm Optimization and Two-Crossovers

Duan Hai-Bin, Xing Zhi-Hui

A quantum evolutionary computation (QEC) algorithm with particle swarm optimization (PSO) and two-crossovers is proposed to overcome identified limitations. PSO is adopted to update the Q-bit automatically, and two-crossovers are applied to improve the convergence quality in the basic QEC model. This hybrid strategy can effectively employ both the ability to jump out of the local minima and the capacity of searching the global optimum. The performance of the proposed approach is compared with basic QEC on the standard unconstrained scalable benchmark problem that numerous hard combinatorial optimization problems can be formulated. The experimental results show that the proposed method outperforms the basic QEC quite significantly.

Chinese Physics Letters•Dec 1, 2009•3 citations

Hybrid Quantum Evolutionary Algorithms Based on Particle Swarm Theory

Yang Yu, Yafei Tian, Zhifeng Yin

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) to improve the performance of QEA . The main idea of the first method called PSEQEA is to embed the evolutionary equation of PSO in the evolutionary operator of QEA; while the main idea of the second method called PSSQEA is to replace the evolutionary operator of QEA using the evolutionary equation of PSO which is redefined the meanings of the original evolutionary equations. The experiment results of the knapsack problem, the function optimization problems 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 PSO in terms of ability of global optimum

IEEE Conference on Industrial Electronics and Applications (ICIEA)•May 1, 2006•13 citations

Quantum particle swarm optimization based on Bloch coordinates of qubits

Yafei Huang

To improve the efficiency of Particle Swarm Optimization(PSO),a quantum particle swarm optimization algorithm combined with quantum theory on the basis of Bloch sphere was proposed.In Bloch spherical coordinates,the particle automatically updated rotation angle and particle position,without setting the rotation angle in the form of look-up table(or setting fixed value of the interval),making up for the deficiency of quantum evolutionary algorithm and quantum genetic algorithm on the basis of Bloch sphere,and the algorithm is more generalizable.Using quantum Hadamard gate to realize the variation of particle enhanced the diversity of population,and prompted particle jump out of local extreme value.The simulation results of the typical function optimization problem show that the algorithm is stable with high precision and fast convergence rate,and it is practical.

Journal of Computer Applications•Jan 1, 2013•0 citations

Hybrid quantum algorithm and its application in flow shop problem

Xie Jin-hua

Quantum Evolutionary Algorithm(QEA) is a distinctive type of algorithm for optimization currently,and the theoretical basis of QEA is quantum computation.The algorithm takes advantage of intervention and parallelism of quantum bit thoroughly,which enables QEA to solve combinatorial optimization problems.While solving scheduling problems,QEA has defects that it converges slowly and doesn’t use other immature individual.Hybrid Quantum Algorithm(HQA) is formed and it sucks Particle Swarm Optimization algorithm(PSO) and evolutionary computation into QEA.Classical flow shop problem is employed to test the algorithm,and the result shows that the hybrid algorithm overcomes the defects of QEA and it has universality to solve scheduling problems.

Computer Engineering and Applications Journal•Jan 1, 2008•0 citations

Particle Swarm Optimization for Quantum Circuit Synthesis: Performance Analysis and Insights

Mirza Hizriyan Nubli Hidayat, Tan Chye Cheah

This paper discusses how particle swarm optimization (PSO) can be used to generate quantum circuits to solve an instance of the MaxOne problem. It then analyzes previous studies on evolutionary algorithms for circuit synthesis. With a brief introduction to PSO, including its parameters and algorithm flow, the paper focuses on a method of quantum circuit encoding and representation as PSO parameters. The fitness evaluation used in this paper is the MaxOne problem. The paper presents experimental results that compare different learning abilities and inertia weight variations in the PSO algorithm. A comparison is further made between the PSO algorithm and a genetic algorithm for quantum circuit synthesis. The results suggest PSO converges more quickly to the optimal solution.

arXiv:2507.02898•Jun 22, 2025•0 citations
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.
A quantum evolutionary computation (QEC) algorithm with particle swarm optimization (PSO) and two-crossovers is proposed to overcome identified limitations. PSO is adopted to update the Q-bit automatically, and two-crossovers are applied to improve the convergence quality in the basic QEC model. This hybrid strategy can effectively employ both the ability to jump out of the local minima and the capacity of searching the global optimum. The performance of the proposed approach is compared with basic QEC on the standard unconstrained scalable benchmark problem that numerous hard combinatorial optimization problems can be formulated. The experimental results show that the proposed method outperforms the basic QEC quite significantly.
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) to improve the performance of QEA . The main idea of the first method called PSEQEA is to embed the evolutionary equation of PSO in the evolutionary operator of QEA; while the main idea of the second method called PSSQEA is to replace the evolutionary operator of QEA using the evolutionary equation of PSO which is redefined the meanings of the original evolutionary equations. The experiment results of the knapsack problem, the function optimization problems 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 PSO in terms of ability of global optimum
To improve the efficiency of Particle Swarm Optimization(PSO),a quantum particle swarm optimization algorithm combined with quantum theory on the basis of Bloch sphere was proposed.In Bloch spherical coordinates,the particle automatically updated rotation angle and particle position,without setting the rotation angle in the form of look-up table(or setting fixed value of the interval),making up for the deficiency of quantum evolutionary algorithm and quantum genetic algorithm on the basis of Bloch sphere,and the algorithm is more generalizable.Using quantum Hadamard gate to realize the variation of particle enhanced the diversity of population,and prompted particle jump out of local extreme value.The simulation results of the typical function optimization problem show that the algorithm is stable with high precision and fast convergence rate,and it is practical.
Quantum Evolutionary Algorithm(QEA) is a distinctive type of algorithm for optimization currently,and the theoretical basis of QEA is quantum computation.The algorithm takes advantage of intervention and parallelism of quantum bit thoroughly,which enables QEA to solve combinatorial optimization problems.While solving scheduling problems,QEA has defects that it converges slowly and doesn’t use other immature individual.Hybrid Quantum Algorithm(HQA) is formed and it sucks Particle Swarm Optimization algorithm(PSO) and evolutionary computation into QEA.Classical flow shop problem is employed to test the algorithm,and the result shows that the hybrid algorithm overcomes the defects of QEA and it has universality to solve scheduling problems.
This paper discusses how particle swarm optimization (PSO) can be used to generate quantum circuits to solve an instance of the MaxOne problem. It then analyzes previous studies on evolutionary algorithms for circuit synthesis. With a brief introduction to PSO, including its parameters and algorithm flow, the paper focuses on a method of quantum circuit encoding and representation as PSO parameters. The fitness evaluation used in this paper is the MaxOne problem. The paper presents experimental results that compare different learning abilities and inertia weight variations in the PSO algorithm. A comparison is further made between the PSO algorithm and a genetic algorithm for quantum circuit synthesis. The results suggest PSO converges more quickly to the optimal solution.