Sciweavers

16 search results - page 1 / 4
» Classical Interaction Cannot Replace a Quantum Message
Sort
View
CORR
2007
Springer
91views Education» more  CORR 2007»
13 years 4 months ago
Classical Interaction Cannot Replace a Quantum Message
We demonstrate a two-player communication problem that can be solved in the oneway quantum model by a 0-error protocol of cost O (log n) but requires exponentially more communicat...
Dmitry Gavinsky
CORR
2004
Springer
114views Education» more  CORR 2004»
13 years 4 months ago
Quantum Communication Cannot Simulate a Public Coin
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
STOC
2001
ACM
129views Algorithms» more  STOC 2001»
14 years 4 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
2005
Springer
141views Algorithms» more  COCO 2005»
13 years 10 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
FOCS
1999
IEEE
13 years 8 months ago
PSPACE Has Constant-Round Quantum Interactive Proof Systems
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
John Watrous