109 search results - page 3 / 22 » Interaction in quantum communication and the complexity of s... |
QCQC
1998
Springer
13 years 11 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
COCO
2008
Springer
2008
Springer
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
13 years 9 months ago
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
ICALP
2007
Springer
14 years 1 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 ...