In order to improve the ability of the optimization of the evolutionary algorithm, a quantum-behaved evolutionary
algorithm is proposed. In this algorithm, the search mechanism is built based on the Bloch sphere. Firstly, the individuals are expressed with qubits, the axis of revolution is established with Pauli matrix, and the evolution search is realized with the rotation of qubits in the Bloch sphere. Then, in order to avoid premature convergence, the mutation of individuals is achieved with Hadamard gates. Such rotation can make the current qubit approximate the target qubit along with the biggest circle on the Bloch sphere, which can accelerate the optimization process. Taking the function extreme value optimization as an example, the experimental results show that the proposed algorithm has higher optimization ability and optimization efficiency.