International Conference on Measurement, Information and Control

Quantum particle swarm evolutionary algorithm with application to system identification

Hao Li, Shiyong Li

Published May 1, 2012• 4 citations

Abstract

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.

DOI: 10.1109/mic.2012.6273477

Related papers

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 ApplicationsJan 1, 20130 citations

A NEW QUANTUM PARTICLE SWARM OPTIMIZATION ALGORITHM WITH LOCAL ATTRACTING

Dong Xiang Shao, Shenghai Hu, Yuting Fei

This paper proposes a new quantum particle swarm optimization algorithm with local attracting (LAQPSO), which is based on quantum-inspired evolutionary algorithm (QEA) and particle swarm optimization algorithm (PSO).In the proposed LAQPSO, a novel quantum bit expression mechanism called quantum angle is employed to encode the solution onto particle, and a new local attractor is proposed to determine the rotation angle of quantum rotation gate automatically.During the process of seeking the global solution, the magnitude of rotation angle is adjusted by an important parameter called contraction coefficient, which can quantitatively determine the tradeoff between exploration ability and exploitation ability.The simulation results for different contraction coefficients are helpful for selecting the key parameter.A set of benchmark functions are used to evaluate the performance of LAQPSO, QEA and QBPSO, and the results show that the proposed algorithm has a fast convergence rate and can effectively avoid premature convergence.

Neural Network WorldJan 1, 20164 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, 200613 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 JournalJan 1, 20062 citations

A Novel Quantum Genetic Algorithm Based on Particle Swarm Optimization Method and Its Application

Ying Ding

This paper proposes a novel quantum genetic algorithm(QGA)——PSQGA,which uses particle swarm optimization method instead of quantum gate to update the state of quantum bit.It has the advantages of particle swarm optimization and quantum genetic algorithm.A variance function is introduced to estimate the stability of the algorithm.Though the experiments of four continuous functions and combination optimization problems,as well as its application to image sparse decomposition.Compared with the improved algorithm which involved quantum gate(IQGA),the ability of finding the best solution and the stability of PSQGA are greatly improved.PSQGA has better convergent property and ability of searching more extensive space.It is fit for the solution of complex optimization problems.

Dianzi xuebaoJan 1, 200614 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.02898Jun 22, 20250 citations