par Magniez, Frédéric;Nayak, Ashwin;Roland, Jérémie 
;Santha, Miklos
Référence 39th ACM Symposium on Theory of Computing (STOC'07), page (575-584)
Publication Publié, 2007
;Santha, MiklosRéférence 39th ACM Symposium on Theory of Computing (STOC'07), page (575-584)
Publication Publié, 2007
Publication dans des actes
| Résumé : | We propose a new method for designing quantum search algorithms for finding a ``marked'' element in the state space of a classical Markov chain. The algorithm is based on a quantum walk it à la Szegedy [FOCS'04, pp 32--41] that is defined in terms of the Markov chain. The main new idea is to apply quantum phase estimation to the quantum walk in order to implement an approximate reflection operator, which is used in an amplitude amplification scheme. As a result we considerably expand the scope of the previous approaches of Ambainis [FOCS04, pp 22--31] and Szegedy [FOCS'04, pp 32--41]. Our algorithm combines the benefits of these approaches in terms of being able to find marked elements, incurring the smaller cost of the two, and being applicable to a larger class of Markov chain. In addition, it is conceptually simple, avoids several technical difficulties in the previous analyses, and leads to improvements in various aspects of several algorithms based on quantum walk. |
