Sciweavers

9 search results - page 2 / 2
» Strong direct product theorems for quantum communication and...
Sort
View
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
13 years 10 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 7 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 6 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 6 months ago
On the Role of Shared Entanglement
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
Dmitry Gavinsky