关键词: 量子计算, 量子遗传算法, Bloch球面坐标, 优化问题

Abstract: 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.

Key words: quantum computation, quantum genetic algorithm, Bloch coordinates, optimization problem