Spatial search on a honeycomb network

  • Authors:

  • G. Abal;R. Donangelo;F. l. Marquezino;R. Portugal

  • Affiliations:

  • Instituto de física, facultad de ingeniería, udelar, herrera y reissig 565, c.c. 30, c.p. 11300, montevideo, uruguay email: abal@fing.edu.uy, donangel@fing.edu.uy;Instituto de física, facultad de ingeniería, udelar, herrera y reissig 565, c.c. 30, c.p. 11300, montevideo, uruguay email: abal@fing.edu.uy, donangel@fing.edu.uy;Laboratório nacional de computação científica-lncc, av. getúlio vargas 333, petrópolis, rj, 25651-075, brazil email: franklin.marquezino@gmail.com, portugal@lncc.br;Laboratório nacional de computação científica-lncc, av. getúlio vargas 333, petrópolis, rj, 25651-075, brazil email: franklin.marquezino@gmail.com, portugal@lncc.br

  • Venue:
  • Mathematical Structures in Computer Science
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The spatial search problem consists of minimising the number of steps required to find a given site in a network under the restriction that only oracle queries or translations to neighbouring sites are allowed. We propose a quantum algorithm for the spatial search problem on a honeycomb lattice with N sites and torus-like boundary conditions. The search algorithm is based on a modified quantum walk on an hexagonal lattice and the general framework proposed by Ambainis, Kempe and Rivosh (Ambainis et al. 2005) is employed to show that the time complexity of this quantum search algorithm is $O(\sqrt{N \log N})$.