Highly Influenced

@inproceedings{SchulmanGeorgia1998TheQC, title={The Quantum Communication Complexity of Sampling}, author={Leonard J. SchulmanGeorgia}, year={1998} }

- Published 1998

y Abstract Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X Y ! f0; 1g and a probability distribution D over X Y , we de-ne the sampling complexity of (f; D) as the minimum number of bits Alice and Bob must communicate for Alice to pick x 2 X and Bob to pick y 2 Yâ€¦Â CONTINUE READING

Citations per Year

Semantic Scholar estimates that this publication has **102** citations based on the available data.

See our **FAQ** for additional information.

### Presentations referencing similar topics