Sciweavers

65 search results - page 5 / 13
» Quantum Entanglement and Communication Complexity
Sort
View
ICQNM
2008
IEEE
138views Chemistry» more  ICQNM 2008»
14 years 1 months ago
Multiparty Distributed Compression of Quantum Information
—We study a protocol in which many parties use quantum communication to transfer a shared state to a receiver without communicating with each other. This protocol is a multiparty...
David Avis, Patrick Hayden, Ivan Savov
TIT
2002
72views more  TIT 2002»
13 years 6 months ago
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
The entanglement-assisted classical capacity of a noisy quantum channel ( ) is the amount of information per channel use that can be sent over the channel in the limit of many uses...
Charles H. Bennett, Peter W. Shor, John A. Smolin,...
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 1 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
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
COLT
2010
Springer
13 years 4 months ago
Quantum Predictive Learning and Communication Complexity with Single Input
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
Dmitry Gavinsky