Study on Discrete Adiabatic Quantum Computation in NPcomplete problem

绝热量子计算作为一种具有绝热演化的量子算法被提出来解决组合优化问题，并被应用于求解NP完全问题的可满足性问题，以及隐子群问题的多伊奇问题、Deutsch-Jozsa问题、Bernstein-Vazirani问题、Simon问题等。我们用非线性步长参数代替线性步长参数来改进绝热量子计算，并提出了一种更有效的方法来解决这些问题，该方法具有更高的观测概率。

In this report, adiabatic quantum computation has been proposed as a quantum algorithm with adiabatic evolution to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem as NP complete problem, and Deutsch problem, Deutsch-Jozsa problem, Bernstein-Vazirani problem, Simon problem as hidden subgroup problem. We modify the adiabatic quantum computation with nonlinear step parameter instead of linear step parameter, and propose to solve these problems more efficiently by a method with higher observation probability.