Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
THEORY OF COMPUTING, Volume 1 (2005), pp. 4779 http://www.theoryofcomputing.org
 

Summary: THEORY OF COMPUTING, Volume 1 (2005), pp. 4779
http://www.theoryofcomputing.org
Quantum Search of Spatial Regions
Scott Aaronson Andris Ambainis
Received: June 13, 2004; published: June ?, 2005.
Abstract: Can Grover's 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(

n) for d 3, or O(

nlog5/2

  

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

 

Collections: Physics; Computer Technologies and Information Sciences