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

Advances in intelligent and soft computing

An Improved Quantum Evolutionary Algorithm Based on Artificial Bee Colony Optimization

Haibin Duan, Zhihui Xing, Chunfang Xu

Published Jan 1, 2009• 15 citations
Publisher
DOI
10.1007/978-3-642-03156-4_27

Related papers

Quantum artificial bee colony optimization algorithm based on Bloch coordinates of quantum bit

Zheng-jun YI, Rong-hua HE, Kun HOU

Journal of Computer Applications•Aug 25, 2013•2 citations

Realization of improved Quantum Particle Swarm Optimization algorithm based on search operator of artificial bee colony

Shuai Yuan, Shen Xiting, Nana Shao

Jisuanji Gongcheng yu Yingyong•Jan 1, 2016•0 citations

Quantum-Circuit-Based Artificial Bee Colony Algorithm for Combinatorial Optimization: A Study on the Traveling Salesman Problem

Rohit Kumar Nonia, Mayukh Sarkar, Dilip Kumar Shaw

•Jan 1, 2026•0 citations

Parallel Improved Quantum Evolutionary Algorithm for Complex Optimization Problems

Yapeng Sun

Lecture notes in computer science•Jan 1, 2022•1 citation

Quantum-Inspired Bee Colony Algorithm

Guorui Li, Sun Mu, Panchi Li

To enhance the performance of the artificial bee colony optimization by integrating the quantum computing model into bee colony optimization, we present a quantum-inspired bee colony optimization algorithm. In our method, the bees are encoded with the qubits described on the Bloch sphere. The classical bee colony algorithm is used to compute the rotation axes and rotation angles. The Pauli matrices are used to construct the rotation matrices. The evolutionary search is achieved by rotating the qubit about the rotation axis to the target qubit on the Bloch sphere. By measuring with the Pauli matrices, the Bloch coordinates of qubit can be obtained, and the optimization solutions can be presented through the solution space transformation. The proposed method can 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 is obviously superior to the classical one for some benchmark functions.

Open Journal of Optimization•Jan 1, 2015•7 citations

A novel quantum swarm evolutionary algorithm and its applications

Yan Wang, Xiaoyue Feng, Yanxin Huang +4 more

Neurocomputing•Nov 29, 2006•170 citations
To enhance the performance of the artificial bee colony optimization by integrating the quantum computing model into bee colony optimization, we present a quantum-inspired bee colony optimization algorithm. In our method, the bees are encoded with the qubits described on the Bloch sphere. The classical bee colony algorithm is used to compute the rotation axes and rotation angles. The Pauli matrices are used to construct the rotation matrices. The evolutionary search is achieved by rotating the qubit about the rotation axis to the target qubit on the Bloch sphere. By measuring with the Pauli matrices, the Bloch coordinates of qubit can be obtained, and the optimization solutions can be presented through the solution space transformation. The proposed method can 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 is obviously superior to the classical one for some benchmark functions.