Speedup in adiabatic evolution based quantum algorithms  

作　　者：SUN Jie LU SongFeng LIU Fang 

机构地区：[1]School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China

出　　处：《Science China(Physics,Mechanics & Astronomy)》2012年第9期1630-1634,共5页中国科学：物理学、力学、天文学（英文版）

基　　金：supported by the National Natural Science Foundation of China (Grant No. 61173050)

摘　　要：In this context,we study three different strategies to improve the time complexity of the widely used adiabatic evolution algorithms when solving a particular class of quantum search problems where both the initial and final Hamiltonians are one-dimensional projector Hamiltonians on the corresponding ground state.After some simple analysis,we find the time complexity improvement is always accompanied by the increase of some other "complexities" that should be considered.But this just gives the implication that more feasibilities can be achieved in adiabatic evolution based quantum algorithms over the circuit model,even though the equivalence between the two has been shown.In addition,we also give a rough comparison between these different models for the speedup of the problem.In this context, we study three different strategies to improve the time complexity of the widely used adiabatic evolution algorithms when solving a particular class of quantum search problems where both the initial and final Hamiltonians are one-dimensional projector Hamiltonians on the corresponding ground state. After some simple analysis, we find the time complexity improvement is always accompanied by the increase of some other ＂complexities＂ that should be considered. But this just gives the implication that more feasibilities can be achieved in adiabatic evolution based quantum algorithms over the circuit model, even though the equivalence between the two has been shown. In addition, we also give a rough comparison between these different models for the speedup of the problem.

关 键 词：adiabatic evolution evolution paths quantum computing 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] O413.1[自动化与计算机技术—计算机科学与技术]