65 search results - page 1 / 13 » Quantum Entanglement and Communication Complexity |
COCO
2001
Springer
13 years 9 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
COCO
2005
Springer
13 years 10 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
2004
Springer
13 years 10 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
QCQC
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
SIAMCOMP
2000
13 years 4 months ago
2000