Partial adiabatic quantum search algorithm and its extensions

In this paper, we again discuss quantum search by partial adiabatic evolution, which was first proposed by Zhang et al. In contrast to previous conclusions, we show that partial adiabatic search does not improve the time complexity of a local adiabatic algorithm. Firstly, we show a variant of this algorithm and find that it is equivalent to the original partial adiabatic algorithm, in the sense of the same time complexity. But we give two alternate viewpoints on this “new” adiabatic algorithm—“global” adiabatic evolution and local adiabatic evolution approaches, respectively. Then, we discuss how global and local adiabatic quantum search can be recast in the framework of partial adiabatic search algorithm. It is found here that the former two algorithms could be considered as special cases of the later one when appropriately tuning the evolution interval of it. Also this implies the flexibility of quantum search based on partial adiabatic evolution.

[1]  E. Sjoqvist,et al.  Robustness of the adiabatic quantum search , 2004, quant-ph/0412124.

[2]  Ben Reichardt,et al.  The quantum adiabatic optimization algorithm and local minima , 2004, STOC '04.

[3]  Christof Zalka.  GROVER'S QUANTUM SEARCHING ALGORITHM IS OPTIMAL , 1997, quant-ph/9711070.

[4]  M. Sipser,et al.  Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.

[5]  N. Cerf,et al.  Quantum search by local adiabatic evolution , 2001, quant-ph/0107015.

[6]  J. Linnett,et al.  Quantum mechanics , 1975, Nature.

[7]  Avatar Tulsi.  Adiabatic quantum computation with a one-dimensional projector Hamiltonian , 2008, 0806.0385.

[8]  Jérémie Roland,et al.  Adiabatic quantum optimization fails for random instances of NP-complete problems , 2009, ArXiv.

[9]  Andrew M. Childs,et al.  Robustness of adiabatic quantum computation , 2001, quant-ph/0108048.

[10]  Vicky Choi,et al.  Different adiabatic quantum optimization algorithms for the NP-complete exact cover problem , 2010, Proceedings of the National Academy of Sciences.

[11]  C. H. Oh,et al.  Sufficiency criterion for the validity of the adiabatic approximation. , 2007, Physical review letters.

[12]  胡和平,et al.  A quantum search algorithm based on partial adiabatic evolution , 2011 .

[13]  E. Farhi,et al.  A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.

[14]  Lov K. Grover.  Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[15]  M. Amin,et al.  Does adiabatic quantum optimization fail for NP-complete problems? , 2010, Physical review letters.

[16]  D. Averin,et al.  Decoherence in adiabatic quantum computation , 2007, 0708.0384.

[17]  Song-Feng Lu,et al.  Quantum search by partial adiabatic evolution , 2010, ArXiv.

[18]  Umesh V. Vazirani,et al.  How powerful is adiabatic quantum computation? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.