Summary: Quantum Search of Spatial Regions (Extended Abstract)
Scott Aaronson
University of California, Berkeley
Andris Ambainis
University of Latvia
Abstract
Can Grover's quantum search algorithm speed up
search of a physical region--for example a 2-D grid of
size

n ×

n? The problem is that

n time seems to
be needed for each query, just to move amplitude across
the grid. Here we show that this problem can be sur-
mounted, refuting a claim to the contrary by Benioff.
In particular, we show how to search a d-dimensional
hypercube in time O(

Source: Aaronson, Scott - Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

Collections: Physics; Computer Technologies and Information Sciences