Classical versus quantum communication in XOR games
- 159 Downloads
We introduce an intermediate setting between quantum nonlocality and communication complexity problems. More precisely, we study the value of XOR games when Alice and Bob are allowed to use a limited amount (c bits) of one-way classical communication compared to their value when they are allowed to use the same amount of one-way quantum communication (c qubits). The key quantity here is the ratio between the quantum and classical value. We provide a universal way to obtain Bell inequality violations of general Bell functionals from XOR games for which the previous quotient is larger than 1. This allows, in particular, to find (unbounded) Bell inequality violations from communication complexity problems in the same spirit as the recent work by Buhrman et al. (PNAS 113(12):3191–3196, 2016). We also provide an example of a XOR game for which the previous quotient is optimal (up to a logarithmic factor) in terms of the amount of information c. Interestingly, this game has only polynomially many inputs per player. For the related problem of separating the classical versus quantum communication complexity of a function, the known examples attaining exponential separation require exponentially many inputs per party.
KeywordsQuantum information Quantum communication XOR games
Funding was provided by National Science Foundation (Grant No. NSF DMS-1201886) and Ministerio de Economía y Competitividad (Grant Nos. RYC-2012-10449, MTM2014-54240-P, SEV-2015-0554).
- 7.Buhrman, H., Regev, O., Scarpa, G., de Wolf, R.: Near-Optimal and Explicit Bell Inequality Violations. In: IEEE Conference on Computational Complexity, pp. 157–166 (2011)Google Scholar
- 8.Cleve, R., Hoyer, P., Toner, B., Watrous, J.: Consequences and limits of nonlocal strategies. In: Proceedings of 19th IEEE Conference on Computational Complexity (CCC’04), pp. 236–249. IEEE Computer Society (2004)Google Scholar
- 11.Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., de Wolf, R.: Exponential separations for one-way quantum communication complexity, with applications to cryptography. In: Proceedings of the 39th ACM STOC, pp. 516–525 (2007)Google Scholar
- 16.Laplante, S., Lauriere, M., Nolin, A., Roland, J., Senno, G.: Robust Bell inequalities from communication complexity. In: 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016), volume 61 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 5:1–5:24 (2016)Google Scholar
- 23.Raz, R.: Exponential separation of quantum and classical communication complexity. In: Proceedings of 31st ACM STOC, pp. 358–367 (1999)Google Scholar
- 24.Regev, O., Klartag, B.: Quantum one-way communication can be exponentially stronger than classical communication. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing (STOC’11), pp. 31–40 (2011)Google Scholar
- 25.Schechtman, G.: More on embeddings subspaces of \(L_p\) in \(\ell _r^n\). Compos. Math. 61, 159–170 (1987)Google Scholar