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

Quantum Information Processing

A quantum genetic algorithm for optimization problems on the Bloch sphere

R. S. Amal, J. Solomon Ivan

Published Jan 19, 2022• 11 citations
Publisher
DOI
10.1007/s11128-021-03368-7

Related papers

A quantum-behaved evolutionary algorithm based on the Bloch spherical search

Panchi Li

Communications in Nonlinear Science and Numerical Simulation•Aug 27, 2013•9 citations

Adaptive quantum genetic algorithm based on Bloch sphere

Rong-hua HE

An adaptive quantum genetic algorithm based on Bloch sphere is proposed based on the quantum genetic algorithm which is based on Bloch coordinates of qubits.The algorithm uses two ways to select a part of the Bloch sphere for searching:along the warp direction and weft direction.The paper proves that the two methods are able to contain all the solutions of the continuous optimization problem in theory,and proposes a method of approximately equal-area to search the selected Bloch sphere,and derives the inverse relationship between the two-phase.The chromosomes mutation is modified to meet the restrictions of selected region.The simulation results show that the approach is equal to quantum genetic algorithm based on Bloch coordinates of qubits in search capability,but the optimization efficiency is significantly improved.

Computer Engineering and Applications Journal•Jan 1, 2012•2 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

Improved Bloch Quantum Genetic Algorithm Based on Elite Strategy

Maoyu Du, Qiudong Yu, Laiqi Zhao +1 more

Function optimization is an important problem in the fields of mathematics and computer science, with wide applications in various real-world domains. Quantum genetic algorithm is a global, parallel, and efficient search method used to solve function optimization and search problems. The Bloch Quantum Evolution Algorithm (BQEA) based on quantum bit Bloch sphere coordinates greatly expands the proportion of optimal solutions, but also expands the search space, making the algorithm prone to falling into local optima. This article proposes a new improved Bloch Elite Quantum Genetic Algorithm (BEQGA) by increasing the number of elite individuals and improving the optimization method of fixed rotation angles. Through multiple simulation experiments, it has been proven that BEQGA has a certain improvement in search ability compared to BQEA, and this has been validated in the research of key technologies for high-precision flexible bag feeding packaging equipment.

International Conference on Intelligent Computing and Next Generation Networks (ICNGN)•Nov 23, 2024•0 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

Quantum-inspired evolutionary algorithm for continuous space optimization based on Bloch coordinates of qubits

Panchi Li, Shiyong Li

Neurocomputing•Jan 3, 2008•76 citations
An adaptive quantum genetic algorithm based on Bloch sphere is proposed based on the quantum genetic algorithm which is based on Bloch coordinates of qubits.The algorithm uses two ways to select a part of the Bloch sphere for searching:along the warp direction and weft direction.The paper proves that the two methods are able to contain all the solutions of the continuous optimization problem in theory,and proposes a method of approximately equal-area to search the selected Bloch sphere,and derives the inverse relationship between the two-phase.The chromosomes mutation is modified to meet the restrictions of selected region.The simulation results show that the approach is equal to quantum genetic algorithm based on Bloch coordinates of qubits in search capability,but the optimization efficiency is significantly improved.
Function optimization is an important problem in the fields of mathematics and computer science, with wide applications in various real-world domains. Quantum genetic algorithm is a global, parallel, and efficient search method used to solve function optimization and search problems. The Bloch Quantum Evolution Algorithm (BQEA) based on quantum bit Bloch sphere coordinates greatly expands the proportion of optimal solutions, but also expands the search space, making the algorithm prone to falling into local optima. This article proposes a new improved Bloch Elite Quantum Genetic Algorithm (BEQGA) by increasing the number of elite individuals and improving the optimization method of fixed rotation angles. Through multiple simulation experiments, it has been proven that BEQGA has a certain improvement in search ability compared to BQEA, and this has been validated in the research of key technologies for high-precision flexible bag feeding packaging equipment.
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.