33 search results - page 2 / 7 » Unbounded-Error One-Way Classical and Quantum Communication ... |
SIAMCOMP
2008
13 years 7 months ago
2008
DAGSTUHL
2007
13 years 8 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...
STOC
2004
ACM
14 years 7 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...
COLT
2010
Springer
13 years 5 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...
COCO
2000
Springer
13 years 11 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...