Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

SIAMCOMP
2000

favoriteEmaildiscussreport

59views more SIAMCOMP 2000»

Quantum Entanglement and Communication Complexity

13 years 11 months ago

Quantum Entanglement and Communication Complexity

Download www.brics.dk

Harry Buhrman, Richard Cleve, Wim van Dam

Real-time Traffic

SIAMCOMP 2000 |

claim paper

Related Content

» Communication Complexity Lower Bounds by Polynomials

» Prior Entanglement Message Compression and Privacy in Quantum Communication

» Towards the Classical Communication Complexity of Entanglement Distillation Protocols with...

» Quantum Entanglement and the Communication Complexity of the Inner Product Function

» An Approximation Algorithm for Approximation Rank

» Lower bounds in communication complexity based on factorization norms

» The communication complexity of the Hamming distance problem

» Boundederror quantum state identification and exponential separations in communication com...

» The Bubble Bit Technique as Improvement of HDLBased Quantum Circuits Simulation

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2000
Where	SIAMCOMP
Authors	Harry Buhrman, Richard Cleve, Wim van Dam

Comments (0)