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

Jisuan wuli

Quantum Particle Swarm Optimization Algorithm Based on Bloch Spherical Search

Guangyao Shi

Published Jan 1, 2013• 2 citations
OpenAlex

Abstract

To enhance optimization ability of quantum potential well-based particle swarm optimization algorithm,a quantum particle swarm optimization algorithm based on Bloch spherical search is proposed by analyzing the design of quantum potential well-based particle swarm optimization algorithms.Firstly,particles are expressed with qubits,axis of rotation is established with Pauli matrix,the angle of rotation is obtained with a model of Delta potential well,and search is realized with rotation of qubits in Bloch sphere.Then,to avoid premature convergence,mutation of particles is achieved with Hadamard gates.Such rotation makes current qubit approximates target qubit along with the biggest circle on Bloch sphere,which accelerates optimization process.It shows that the proposed algorithm is superior to the original one in optimization ability.

Related papers

Chaos quantum immune algorithm based on Bloch sphere

Jingjing Lin

In the existing quantum intelligent optimization algorithms,almost all of the individuals are encoded by qubits described on plane unit circle.Since there is only one adjustable parameter,quantum properties have not been fully embodied,which limits the improvement of the optimization ability further.To address this issue,a chaos quantum immune algorithm based on Bloch sphere is proposed.In the proposed algorithm,the antibodies are encoded by qubits described on Bloch sphere,the axis of rotation is designed by using Pauli matrix,the clone of the excellent antibodies is performed by rotating qubits on Bloch sphere,and the local searching is achieved by employing the chaos variables in the rotation angles.The global searching is achieved by the mutations of the inferior individuals based on the Hadamard gates.The simulation results show that the proposed algorithm is superior to other quantum intelligent optimization algorithms in both search capability and optimization efficiency.

Systems engineering and electronics•Jan 1, 2012•1 citation

Quantum particle swarm optimization based on Bloch coordinates of qubits

Xiande Liu, Xiaoming Liu

To improve the efficiency of particle swarm optimization, a quantum particle swarm optimization algorithm is proposed on the basis of analyzing the search process of particle swarm optimization algorithm. In the proposed algorithm, particles are endoded by qubits described on the Bloch sphere, each particle occupy three locations of the search space, and each location represents a optimization solution. By employing the search method of general PSO to adjust the two parameters of qubit, the qubits rotation are performed on the Bloch sphere, which can simultaneously update three locations occupied by a qubit and quickly approach the global optimal solution. The experimental results of standard test function extreme optimization and fuzzy controller parameters optimization show that the proposed algorithm is superior to other similar algorithm in optimization ability and optimization efficiency.

International Conference on Natural Computation (ICNC)•Jul 1, 2013•2 citations

Quantum-inspired artificial fish swarm algorithm based on the Bloch sphere searching

Irjes, Jianping Li

To enhance the performance of the intelligent optimization algorithm, a new model of performing search on the Bloch sphere is proposed. Then, by integrating the model into the artificial fish swarm optimization, we present a quantum-inspired artificial fish swarm optimization algorithm. In proposed method, the fishes are encoded with the qubits described on the Bloch sphere. The vector product theory is adopted to establish the axis of rotation, and the Pauli matrices are used to construct the rotation matrices. The four fish behaviors, such as moving, tracking, capturing, aggregating, are achieved by rotating the current qubit about the rotation axis to the target qubit on the Bloch sphere. The Bloch coordinates of qubit can be obtained by measuring with the Pauli matrices, and the optimization solutions can be presented through the solution space transformation. The highlight advantages of this method are the ability to simultaneously adjust two parameters of a qubit and automatically achieve the best match between two adjustment quantities, which may accelerate the optimization process. The experimental results show that the proposed method obviously outperforms the classical one in convergence speed and achieves better levels for some benchmark functions.

•May 29, 2015•2 citations

Bloch Coordinates-Based Quantum Particle Swarm Optimization Algorithm and Its Application

Li Pan

To improve the efficiency of particle swarm optimization,a quantum particle swarm optimization algorithm is proposed on the basis of analyzing the search process of particle swarm optimization algorithm.In the proposed algorithm,particles are endoded by qubits described on the Bloch sphere,each particle occupy three locations of the search space,and each location represents a optimization solution.By employing the search method of general PSO to adjust the two parameters of qubit,the qubits rotation are performed on the Bloch sphere,which can simultaneously update three loations occupied by a qubit and quickly approach the global optimal solution.The experimental results of standard test function extreme optimization and fuzzy controller parameters optimization show that the proposed algorithm is superior to other similar algorithm in optimization ability and optimization efficiency.

Computer Systems and Applications•Jan 1, 2012•1 citation

Quantum particle swarms algorithm for continuous space optimization

Shiyong Li

To improve search ability and optimization efficiency and to avoid premature con- vergence for particle swarms optimization,a novel quantum particle swarm optimization for continuous space optimization is proposed.The positions of particles are encoded by the prob- ability amplitudes of quantum bits,the movements of particles are performed by quantum rotation gates,which achieve particles searching.The mutations of particles are performed by quantum non-gate,which increase the diversity Of particles.As each quantum bit contains two probability amplitudes,each particle occupies two positions in space.Hence,the process of searching is accelerated.The experimental results show that the algorithm proposed is superior to the basic particle swarms optimization.

Chinese Journal of Quantum Electronics•Jan 1, 2007•23 citations

Research on Particle Swarm Optimization Algorithm Based on Quantum Computing Technology

Guanghui Wang

In view of the shortcomings of particle swarm optimization such as premature convergence to local optimization, particle swarm optimization algorithm based on quantum gate and particle swarm optimization algorithm based on quantum behavior are studied in this paper. The first algorithm uses the random observation method of quantum bit coding particles to simulate quantum particle collapse for generating a population and uses the quantum rotating gate to generate a new population. The adaptive mutation operator is used for ensuring the diversity of the population, effectively reducing the impact of local optimization; therefore, the robustness of the algorithm is improved. The second algorithm uses the probability density function of quantum computation to make the particles jump out of the local extreme points and fulfils the global search, which is more suitable for continuous optimization. The results of computational experiments show that both the two particle swarm optimization algorithms based on quantum technology have a good global convergence.

American journal of electrical and electronic engineering•Jan 5, 2020•3 citations
To enhance optimization ability of quantum potential well-based particle swarm optimization algorithm,a quantum particle swarm optimization algorithm based on Bloch spherical search is proposed by analyzing the design of quantum potential well-based particle swarm optimization algorithms.Firstly,particles are expressed with qubits,axis of rotation is established with Pauli matrix,the angle of rotation is obtained with a model of Delta potential well,and search is realized with rotation of qubits in Bloch sphere.Then,to avoid premature convergence,mutation of particles is achieved with Hadamard gates.Such rotation makes current qubit approximates target qubit along with the biggest circle on Bloch sphere,which accelerates optimization process.It shows that the proposed algorithm is superior to the original one in optimization ability.
In the existing quantum intelligent optimization algorithms,almost all of the individuals are encoded by qubits described on plane unit circle.Since there is only one adjustable parameter,quantum properties have not been fully embodied,which limits the improvement of the optimization ability further.To address this issue,a chaos quantum immune algorithm based on Bloch sphere is proposed.In the proposed algorithm,the antibodies are encoded by qubits described on Bloch sphere,the axis of rotation is designed by using Pauli matrix,the clone of the excellent antibodies is performed by rotating qubits on Bloch sphere,and the local searching is achieved by employing the chaos variables in the rotation angles.The global searching is achieved by the mutations of the inferior individuals based on the Hadamard gates.The simulation results show that the proposed algorithm is superior to other quantum intelligent optimization algorithms in both search capability and optimization efficiency.
To improve the efficiency of particle swarm optimization, a quantum particle swarm optimization algorithm is proposed on the basis of analyzing the search process of particle swarm optimization algorithm. In the proposed algorithm, particles are endoded by qubits described on the Bloch sphere, each particle occupy three locations of the search space, and each location represents a optimization solution. By employing the search method of general PSO to adjust the two parameters of qubit, the qubits rotation are performed on the Bloch sphere, which can simultaneously update three locations occupied by a qubit and quickly approach the global optimal solution. The experimental results of standard test function extreme optimization and fuzzy controller parameters optimization show that the proposed algorithm is superior to other similar algorithm in optimization ability and optimization efficiency.
To enhance the performance of the intelligent optimization algorithm, a new model of performing search on the Bloch sphere is proposed. Then, by integrating the model into the artificial fish swarm optimization, we present a quantum-inspired artificial fish swarm optimization algorithm. In proposed method, the fishes are encoded with the qubits described on the Bloch sphere. The vector product theory is adopted to establish the axis of rotation, and the Pauli matrices are used to construct the rotation matrices. The four fish behaviors, such as moving, tracking, capturing, aggregating, are achieved by rotating the current qubit about the rotation axis to the target qubit on the Bloch sphere. The Bloch coordinates of qubit can be obtained by measuring with the Pauli matrices, and the optimization solutions can be presented through the solution space transformation. The highlight advantages of this method are the ability to simultaneously adjust two parameters of a qubit and automatically achieve the best match between two adjustment quantities, which may accelerate the optimization process. The experimental results show that the proposed method obviously outperforms the classical one in convergence speed and achieves better levels for some benchmark functions.
To improve the efficiency of particle swarm optimization,a quantum particle swarm optimization algorithm is proposed on the basis of analyzing the search process of particle swarm optimization algorithm.In the proposed algorithm,particles are endoded by qubits described on the Bloch sphere,each particle occupy three locations of the search space,and each location represents a optimization solution.By employing the search method of general PSO to adjust the two parameters of qubit,the qubits rotation are performed on the Bloch sphere,which can simultaneously update three loations occupied by a qubit and quickly approach the global optimal solution.The experimental results of standard test function extreme optimization and fuzzy controller parameters optimization show that the proposed algorithm is superior to other similar algorithm in optimization ability and optimization efficiency.
To improve search ability and optimization efficiency and to avoid premature con- vergence for particle swarms optimization,a novel quantum particle swarm optimization for continuous space optimization is proposed.The positions of particles are encoded by the prob- ability amplitudes of quantum bits,the movements of particles are performed by quantum rotation gates,which achieve particles searching.The mutations of particles are performed by quantum non-gate,which increase the diversity Of particles.As each quantum bit contains two probability amplitudes,each particle occupies two positions in space.Hence,the process of searching is accelerated.The experimental results show that the algorithm proposed is superior to the basic particle swarms optimization.
In view of the shortcomings of particle swarm optimization such as premature convergence to local optimization, particle swarm optimization algorithm based on quantum gate and particle swarm optimization algorithm based on quantum behavior are studied in this paper. The first algorithm uses the random observation method of quantum bit coding particles to simulate quantum particle collapse for generating a population and uses the quantum rotating gate to generate a new population. The adaptive mutation operator is used for ensuring the diversity of the population, effectively reducing the impact of local optimization; therefore, the robustness of the algorithm is improved. The second algorithm uses the probability density function of quantum computation to make the particles jump out of the local extreme points and fulfils the global search, which is more suitable for continuous optimization. The results of computational experiments show that both the two particle swarm optimization algorithms based on quantum technology have a good global convergence.