Bounded-error quantum state identification and exponential separations in communication complexity

DOI10.1145/1132516.1132602zbMath1301.81045OpenAlexW2080925904MaRDI QIDQ2931421

Dmitry Gavinsky, Julia Kempe, Ronald de Wolf, Oded Regev

Publication date: 25 November 2014

Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.9280

zbMATH Keywords

entanglementquantum computingcommunication complexityrandomnessstate identification

Mathematics Subject Classification ID

Quantum computation (81P68) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (1)

Unbounded-Error Classical and Quantum Communication Complexity

This page was built for publication: Bounded-error quantum state identification and exponential separations in communication complexity