Title of article :
A quantum-behaved evolutionary algorithm based on the Bloch spherical search
Author/Authors :
Li، نويسنده , , Panchi، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2014
Abstract :
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.
Keywords :
algorithm design , quantum computing , Bloch spherical coordinates , Pauli matrix , Rotation matrix
Journal title :
Communications in Nonlinear Science and Numerical Simulation
Journal title :
Communications in Nonlinear Science and Numerical Simulation