loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 IEEE 23rd Annual Conference on Computational Complexity
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
June 22-June 26
ISBN: 978-0-7695-3169-4
ASCII Text
x 
 
Dmitry Gavinsky, Pavel Pudl?, "Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity," Computational Complexity, Annual IEEE Conference on, pp. 332-339, 2008 IEEE 23rd Annual Conference on Computational Complexity, 2008.
 
 
BibTex
x
 
@article{ 10.1109/CCC.2008.27,
author = {Dmitry Gavinsky and Pavel Pudl?},
title = {Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity},
journal ={Computational Complexity, Annual IEEE Conference on},
volume = {0},
year = {2008},
issn = {1093-0159},
pages = {332-339},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.2008.27},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computational Complexity, Annual IEEE Conference on
TI - Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
SN - 1093-0159
SP332
EP339
A1 - Dmitry Gavinsky,
A1 - Pavel Pudl?,
PY - 2008
KW - communication complexity
KW - quantum communication
KW - separation of communication classes
VL - 0
JA - Computational Complexity, Annual IEEE Conference on
ER -
 
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing settings.
Index Terms:
communication complexity, quantum communication, separation of communication classes
Citation:
Dmitry Gavinsky, Pavel Pudl?, "Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity," ccc, pp.332-339, 2008 IEEE 23rd Annual Conference on Computational Complexity, 2008
Usage of this product signifies your acceptance of the Terms of Use.