Exponential separation of quantum and classical one-way communication complexity
From MaRDI portal
Publication:3580963
DOI10.1145/1007352.1007379zbMath1192.81052OpenAlexW2062881383MaRDI QIDQ3580963
Iordanis Kerenidis, T. S. Jayram, Ziv Bar-Yossef
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007379
Related Items (9)
Two-player conflicting interest Bayesian games and Bell nonlocality ⋮ Nonlocal correlations and noise in different settings of a two-player game ⋮ Non-uniformity and quantum advice in the quantum random oracle model ⋮ On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity ⋮ Quantum pseudo-telepathy ⋮ Two party non-local games ⋮ On Approximating Matrix Norms in Data Streams ⋮ Optimal bounds for parity-oblivious random access codes ⋮ Quantum versus randomized communication complexity, with efficient players
This page was built for publication: Exponential separation of quantum and classical one-way communication complexity
