50 search results - page 1 / 10 » Average-Case Quantum Query Complexity |
STACS
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
DAGSTUHL
2006
13 years 6 months ago
2006
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
ALGORITHMICA
2002
13 years 4 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...