31 search results - page 1 / 7 » Unbounded-Error Classical and Quantum Communication Complexi... |
ICALP
2007
Springer
13 years 11 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 ...
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
DAGSTUHL
2007
13 years 6 months ago
2007
We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function w...
COLT
2010
Springer
13 years 2 months ago
2010
Springer
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...