Author:
ABAL G.,DONANGELO R.,FORETS M.,PORTUGAL R.
Abstract
The spatial search problem consists of minimising the number of steps required to find a given site in a network, with the restriction that only an oracle query or a translation to a neighbouring site is allowed at each step. We propose a quantum algorithm for the spatial search problem on a triangular lattice with N sites and torus-like boundary conditions. The proposed algorithm is a special case of the general framework for abstract search proposed by Ambainis, Kempe and Rivosh (AKR) in Ambainis et al. (2005) and Tulsi in Tulsi (2008) applied to a triangular network. The AKR–Tulsi formalism was employed to show that the time complexity of the quantum search on the triangular lattice is $O(\sqrt{N \log N})$.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference11 articles.
1. Ambainis A. and Aaronson S. (2003) Quantum search of spatial regions. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 200–209.
2. Quantum Mechanics Helps in Searching for a Needle in a Haystack
3. On the hitting times of quantum versus random walks
4. Coins make quantum walks faster;Ambainis;SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms,2005
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献