88 search results - page 2 / 18 » Quantum lower bounds by quantum arguments |
COCO
2004
Springer
13 years 10 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
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...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
ECCC
2008
13 years 5 months ago
2008
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...