130 search results - page 5 / 26 » The Quantum Communication Complexity of Sampling |
119
click to vote
CORR
2002
Springer
14 years 9 months ago
2002
Springer
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...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
COCO
2008
Springer
2008
Springer
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
14 years 11 months ago
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...
STOC
2001
ACM
15 years 9 months ago
2001
ACM
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...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...