Spatial quantum search in a triangular network

Details Spatial quantum search in a triangular network Spatial quantum search in a triangular network

2010-09-07

arxiv.org/abs/1009.1422v3

Physics

Quantum Physics

10 pages, 4 Postscript figures, uses sbc-template.sty, appeared in Annals of WECIQ 2010, III Workshop of Quantum Computation a

Scientific paper

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. We propose a quantum algorithm for the spatial search problem on a triangular lattice with N sites and torus-like boundary conditions. The proposed algortithm is a special case of the general framework for abstract search proposed by Ambainis, Kempe and Rivosh [AKR05] (AKR) and Tulsi [Tulsi08], 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 logN)).

Affiliated with

Also associated with

No associations

Rating

Spatial quantum search in a triangular network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spatial quantum search in a triangular network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spatial quantum search in a triangular network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-31495