A Novel Pauli Evolutionary Quantum Algorithm for Combinatorial Optimization  

作　　者：XIONG Yan LIANG Xiao MIAO Fuyou 

机构地区：[1]Department of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, China

出　　处：《Chinese Journal of Electronics》2010年第3期399-402,共4页电子学报（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China （No.90818007） and Chinese 863 High-tech Project （No.2009AA01Z203）

摘　　要：In this paper, a novel evolutionary quantum algorithm with Pauli mutation PEQA is proposed to solve the combinatorial optimization problem. PEQA utilizes quantum bit strings, quantum gate and Pauli mutation to obtain the best solution with only one individual in a short time. The analysis of Markov chain and empirical experiments on 0/1 knapsack problem are carried out. The results show that PEQA can outperform traditional genetic and quantum evolutionary algorithms.

关 键 词：Quantum evolutionary algorithm Quantum computation Markov chain Pauli evolutionary quantum algorithm （PEQA）. 

分 类 号：O224[理学—运筹学与控制论] TP18[理学—数学]