Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2

Details Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2 Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2

2010-02-27

arxiv.org/abs/1003.0065v2

Phys. Rev. A82 (2010) 032330

Physics

Quantum Physics

11 pages, Revtex (v2) Introduction and references expanded. Published version

Scientific paper

Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by staggered lattice fermions. We use it to investigate the spatial search problem, i.e. finding a marked vertex on a $d$-dimensional hypercubic lattice. The restriction on movement hardly matters for $d>2$, and scaling behaviour close to Grover's optimal algorithm (which has no restriction on movement) can be achieved. Using numerical simulations, we optimise the proportionality constants of the scaling behaviour, and demonstrate the approach to that for Grover's algorithm (equivalent to the mean field theory or the $d\to\infty$ limit). In particular, the scaling behaviour for $d=3$ is only about 25% higher than the optimal $d\to\infty$ value.

Affiliated with

Also associated with

No associations

Rating

Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2 has received 1 rating(s) and 1 review(s), resulting in an average rating of 4.50 on a scale from 1 to 5. The overall rating for this scientific paper is excellent.

If you have personal experience with Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2 will most certainly appreciate the feedback.

Rate now

Comments { 1 }

---

Profile ID: LFWR-SCP-O-629213