Sciweavers

12 search results - page 1 / 3
» A New Quantum Lower Bound Method, with an Application to a S...
Sort
View
TOC
2010
155views Management» more  TOC 2010»
12 years 11 months ago
A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
Andris Ambainis
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 3 months ago
Strong direct product theorems for quantum communication and query complexity
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Alexander A. Sherstov
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
13 years 8 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 4 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck