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

DOI10.1145/1132516.1132602MaRDI QIDQ2931421zbMATH OpenOpenAlexWikidataFDO

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

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

communication complexityentanglementquantum computingrandomnessstate identification

Mathematics Subject Classification ID

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

Recommendations

• Bounded-error quantum state identification and exponential separations in communication complexity
• scientific article; zbMATH DE number 1860690
• Exponential separation of quantum and classical communication complexity
• Exponential separation of quantum and classical one-way communication complexity
• Exponential Separation of Quantum and Classical One-Way Communication Complexity

Cited in

(3)

• Upper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination
• Unbounded-Error Classical and Quantum Communication Complexity
• scientific article; zbMATH DE number 7651028 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931421)