The Quantum Communication Complexity of Sampling

@inproceedings{SchulmanGeorgia1998TheQC,
  title={The Quantum Communication Complexity of Sampling},
  author={Leonard J. SchulmanGeorgia},
  year={1998}
}
  • Leonard J. SchulmanGeorgia
  • 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

Topics

Statistics

051015'00'02'04'06'08'10'12'14'16'18
Citations per Year

102 Citations

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

See our FAQ for additional information.