Partial evolution based local adiabatic quantum search

Abstract

Recently, Zhang and Lu provided a quantum search algorithm based on partial adiabatic evolution, which beats the time bound of local adiabatic search when the number of marked items in the unsorted database is larger than one. Later, they found that the above two adiabatic search algorithms had the same time complexity when there is only one marked item in the database. In the present paper, following the idea of Roland and Cerf [Roland J and Cerf N J 2002 Phys. Rev. A 65 042308], if within the small symmetric evolution interval defined by Zhang et al., a local adiabatic evolution is performed instead of the original “global" one, this “new" algorithm exhibits slightly better performance, although they are progressively equivalent with M increasing. In addition, the proof of the optimality for this partial evolution based local adiabatic search when M = 1 is also presented. Two other special cases of the adiabatic algorithm obtained by appropriately tuning the evolution interval of partial adiabatic evolution based quantum search, which are found to have the same phenomenon above, are also discussed.

Effects of systematic phase errors on optimized quantum random-walk search algorithm

“…[5][6][7] In addition to Grover's algorithm, other research on quantum algorithms is also developing rapidly. [8,9] In practice, systematic and random errors are inevitable during the implementation of phase inversion. The error in each step may be very small; however, because the scale of quantum computation is usually exponential, small errors may accumulate into large errors and significantly affect the algorithm results.…”

An adiabatic quantum optimization for exact cover 3 problem

“…Quantum computation is widely believed to be able to provide a speedup for computationally hard problems. [1][2][3] Efficient quantum algorithms have been designed to solve computational problems such as factorization, [1] unstructured search, [2,[4][5][6][7][8] etc. In the mean time, several quantum computational models have been proposed, one of which is the adiabatic quantum optimization (ADO) model.…”