131 search results - page 8 / 27 » Adversary lower bounds for nonadaptive quantum algorithms |
114
click to vote
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
108
click to vote
COCO
2004
Springer
15 years 6 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
WADS
2005
Springer
15 years 6 months ago
2005
Springer
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...
103
click to vote
COCO
2003
Springer
15 years 6 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
116
click to vote
ALGORITHMICA
2010
15 years 1 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...