19 search results - page 3 / 4 » Exponential separation of quantum and classical one-way comm... |
ALGORITHMICA
2002
13 years 5 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...
COLT
2010
Springer
13 years 3 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...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
COCO
2000
Springer
13 years 9 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 ...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...