Quantum communication complexity of sampling

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1998, Pages 342-351

  Ambainis, Andris ^a   Ta Shma, Amnon ^a   Schulman, Leonard J ^a   Vazirani, Umesh ^a   Wigderson, Avi ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; QUANTUM THEORY;

QUANTUM COMMUNICATION COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0032320435     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)