Journal
PHYSICAL REVIEW A
Volume 70, Issue 4, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevA.70.042312
Keywords
-
Categories
Ask authors/readers for more resources
We consider the problem of searching a d-dimensional lattice of N sites for a single marked location. We present a Hamiltonian that solves this problem in time of order rootN for d > 2 and of order rootN log N in the critical dimension d=2. This improves upon the performance of our previous quantum walk search algorithm (which has a critical dimension of d=4), and matches the performance of a corresponding discrete-time quantum walk algorithm. The improvement uses a lattice version of the Dirac Hamiltonian, and thus requires the introduction of spin (or coin) degrees of freedom.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available