222 search results - page 1 / 45 » Lower Bounds on Quantum Multiparty Communication Complexity |
COCO
2009
Springer
14 years 4 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
TAMC
2007
Springer
14 years 4 months ago
2007
Springer
COCOON
2008
Springer
13 years 12 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
COCO
2001
Springer
14 years 2 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...