Sciweavers

222 search results - page 1 / 45
» Lower Bounds on Quantum Multiparty Communication Complexity
Sort
View
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
13 years 10 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
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...
Troy Lee, Gideon Schechtman, Adi Shraibman
COCOON
2008
Springer
13 years 5 months ago
Multi-party Quantum Communication Complexity with Routed Messages
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,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
ICALP
2005
Springer
13 years 9 months ago
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
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...
Jeff Ford, Anna Gál
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
13 years 8 months ago
Communication Complexity Lower Bounds by Polynomials
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...
Harry Buhrman, Ronald de Wolf