Quantum Search of Spatial Regions

: 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 surmounted, 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 n) for d = 2. More generally, we introduce a model of quantum query complexity on graphs, motivated by fundamental physical limits on information storage, particularly the holographic principle from black hole thermodynamics. Our results in this model include almost-tight upper and lower bounds for many search tasks; a generalized algorithm that works for any graph with good expansion properties, not just hypercubes; and relationships among several notions of ‘locality’ for unitary matrices acting on graphs. As an application of our results, we give an O( √ n)-q...

• Type: Conference
• Year: 2003
• Where: FOCS
• Authors: Scott Aaronson, Andris Ambainis
• Keywords: FOCS 2003, Grover’s Algorithm Speed, Lower Bound, Physical Region—for Example, Theoretical Computer Science