.png){kind=icon}
Return
A quantum-behaved evolutionary algorithm based on the Bloch spherical search
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cnsns.2013.08.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In order to enhance the optimization ability of the quantum evolutionary algorithms, a new quantum-behaved evolutionary algorithm is proposed. In this algorithm, the search mechanism is established based on the Bloch sphere. First, the individuals are expressed by qubits described on the Bloch sphere, then the rotation axis is established by Pauli matrixes, and the evolution search is realized by rotating qubits on the Bloch sphere about the rotating axis. In order to avoid premature convergence, the mutation of individuals is achieved by the Hadamard gates. Such rotation can make the current qubit approximate the target qubit along with the great circle on the Bloch sphere, which can accelerate optimization process. Taking the function extreme value optimization as an example, the experimental results show that the proposed algorithm is obviously superior to other similar algorithms. (C) 2013 Elsevier B. V. All rights reserved.
Keywords:
Quantum computing
Bloch spherical coordinates
Pauli matrix
Rotation matrix
Algorithm design
Journal
IF:
3.8
Papers:
9.4K
Citations:
1.8W
Organization
No organization information available
.png){kind=icon}
