2661 search results - page 27 / 533 » Quantum Complexity Classes |
105
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
87
Voted
ALGORITHMICA
2002
15 years 15 days ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
132
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
102
Voted
STOC
2007
ACM
16 years 28 days ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer