基于Hadamard门变异的量子遗传算法

Quantum Genetic Algorithm for Hadamard Gate Mutation

为了解决量子遗传算法在函数优化过程中容易陷入局部极值问题，提出了一种Hadamard门变异的量子遗传算法。核心思想是利用小生境协同进化策略初始化种群，并采用动态调整量子旋转门策略对种群进行更新进化，加快算法的收敛速度，在量子变异过程中不采用量子非门变异而是利用Hadamard门变异操作，增加了种群的多样性，提高了全局搜索能力，保留了优秀信息。通过对典型复杂函数的优化测试，实验结果表明，提出的Hadamard门变异的量子遗传算法在效率和质量上与传统遗传算法和一般的量子遗传算法相比具有一定的优势。

One quantum genetic algorithm of Hadamard gate variation has been proposed to solve the problem that quantum genetic algorithm is easy to be trapped in local extremum in the function optimization process. Its core idea is to initialize the population with niche evolutionary strategies and make update evolution for the population with dynamic adjustment of quantum rotation gate strategies to speed up the convergence rate of the algorithm. In the quantum variation process, Hadamard gate variation operation has been adopted instead of quantum not gate variation, which has increased the diversity of the population, improved the global search capacity and kept excellent information. Optimization test has been made for typical complex functions. The experimental results have shown that compared with the traditional genetic algorithm and the general quantum genetic algorithm, the proposed algorithm is with certain advantages in both efficiency and quality.