Spatial search in a honeycomb network
Quantum Physics
2012-05-18 v3 Computational Complexity
Data Structures and Algorithms
Abstract
The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. In this paper, a quantum algorithm for the spatial search problem on a honeycomb lattice with sites and torus-like boundary conditions. The search algorithm is based on a modified quantum walk on a hexagonal lattice and the general framework proposed by Ambainis, Kempe and Rivosh is used to show that the time complexity of this quantum search algorithm is .
Keywords
Cite
@article{arxiv.1001.1139,
title = {Spatial search in a honeycomb network},
author = {G. Abal and R. Donangelo and F. L. Marquezino and R. Portugal},
journal= {arXiv preprint arXiv:1001.1139},
year = {2012}
}
Comments
10 pages, 2 figures; Minor typos corrected, one Reference added. accepted in Math. Structures in Computer Science, special volume on Quantum Computing