Sciweavers

109 search results - page 1 / 22
» Interaction in quantum communication and the complexity of s...
Sort
View
STOC
2001
ACM
129views Algorithms» more  STOC 2001»
14 years 11 months ago
Interaction in quantum communication and the complexity of set disjointness
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David...
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 5 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
STACS
2005
Springer
14 years 4 months ago
Quantum Interactive Proofs with Competing Provers
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
Gus Gutoski, John Watrous
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 4 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun