Sciweavers

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

19

FOCS
1998
IEEE

favoriteEmaildiscussreport

93views Theoretical Computer Science» more FOCS 1998»

The Quantum Communication Complexity of Sampling

13 years 11 months ago

The Quantum Communication Complexity of Sampling

Download www.math.ias.edu

Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X

Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shm

Real-time Traffic

Communication Complexity | FOCS 1998 | Quantum | Quantum Algorithms | Theoretical Computer Science |

claim paper

Related Content

» Characterization of NonDeterministic Quantum Query and Quantum Communication Complexity

» A Direct Sum Theorem in Communication Complexity via Message Compression

» The communication complexity of the Hamming distance problem

» The effect of communication costs in solidstate quantum computing architectures

» Lower Bounds on Quantum Multiparty Communication Complexity

» Communication Complexity Lower Bounds by Polynomials

» Limitations of Quantum Advice and OneWay Communication

» Quantum Predictive Learning and Communication Complexity with Single Input

» Quantum Wavelet Transforms Fast Algorithms and Complete Circuits

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1998
Where	FOCS
Authors	Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson

Comments (0)