ACM SIGACT News
Tensor norms and the classical communication complexity of nonlocal quantum measurement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Coins make quantum walks faster
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The communication complexity of the Hamming distance problem
Information Processing Letters
Improved algorithms for quantum identification of Boolean oracles
Theoretical Computer Science
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Spatial search on a honeycomb network
Mathematical Structures in Computer Science
Unitarity plus causality implies localizability
Journal of Computer and System Sciences
Recasting mermin's multi-player game into the framework of pseudo-telepathy
Quantum Information & Computation
Quantum communication complexity of block-composed functions
Quantum Information & Computation
Improved algorithms for quantum identification of boolean oracles
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Promised and distributed quantum search
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Spatial search using the discrete time quantum walk
Natural Computing: an international journal
Quantum walks: a comprehensive review
Quantum Information Processing
The approximate rank of a matrix and its algorithmic applications: approximate rank
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Quantum search in structured database using local adiabatic evolution and spectral methods
Quantum Information Processing
| Hi-index | 0.00 |
Can Grover隆's quantum search algorithm speed up search of a physical region 驴 for example a 2-D grid of size \sqrt n\times \sqrt n? The problem is that \sqrt n time seems tobe 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 Benio. In particular, we show how to search a d-dimensional hypercube in time 0(\sqrt n ) for d \geqslant 3, or 0(\sqrt {n\log ^3 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 0(\sqrt {n)}-qubit communication protocol for the disjointness problem, which improves an upper bound of H驴yer and de Wolf and matches a lower bound of Razborov.