Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Quantum Search of Spatial Regions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
ACM SIGACT News
| Hi-index | 0.00 |
Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state space of a graph. The algorithm is based on a local adiabatic evolution of the Hamiltonian associated with the graph. The main new idea is to apply some techniques such as Krylov subspace projection methods, Lanczos algorithm and spectral distribution methods. Indeed, using these techniques together with the second-order perturbation theory, we give a systematic method for calculating the approximate search time at which the marked state can be reached. That is, for any undirected regular connected graph which is considered as the state space of the database, the introduced algorithm provides a systematic and programmable way for evaluation of the search time, in terms of the corresponding graph polynomials.