Quantum search algorithms on a regular lattice

Details Quantum search algorithms on a regular lattice Quantum search algorithms on a regular lattice

2010-05-20

arxiv.org/abs/1005.3676v1

Physics

Quantum Physics

Scientific paper

Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms of the level dynamics near an avoided crossing of a one-parameter family of quantum random walks. We give approximations for both the level-splitting at the avoided crossing and the effectively two-dimensional subspace of the full Hilbert space spanning the level crossing. This makes it possible to give the leading order behaviour for the search time and the localisation probability in the limit of large lattice size including the leading order coefficients. For d=2 and d=3, these coefficients are calculated explicitly. Closed form expressions are given for higher dimensions.

Affiliated with

Also associated with

No associations

Rating

Quantum search algorithms on a regular lattice 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 Quantum search algorithms on a regular lattice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum search algorithms on a regular lattice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-210603