The Quantum Communication Complexity of Sampling

DOI10.1137/S009753979935476zbMath1041.68002OpenAlexW2155834086WikidataQ62398484 ScholiaQ62398484MaRDI QIDQ4441894

Amnon Ta-Shma, Leonard J. Schulman, Avi Wigderson, Umesh V. Vazirani, Andris Ambainis

Publication date: 8 January 2004

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753979935476

zbMATH Keywords

quantum information theorycommunication complexityquantum communication complexityset-disjointnessthe log-rank conjecture in communication complexity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (6)

Communication complexity with small advantage ⋮ Unnamed Item ⋮ Bounded-depth circuits cannot sample good codes ⋮ Multipartite quantum correlation and communication complexities ⋮ Unnamed Item ⋮ Quantum communication and complexity.

This page was built for publication: The Quantum Communication Complexity of Sampling