RT Journal Article
T1 Quantum one-way versus classical two-way communication in XOR games
A1 Amr, Abderramán
A1 Villanueva, Ignacio
AB In this work, we give an example of exponential separation between quantum and classical resources in the setting of XOR games assisted with communication. Specifically, we show an example of a XOR game for which O(n) bits of two-way classical communication are needed in order to achieve the same value as can be attained with logn qubits of one-way communication. We also find a characterization for the value of a XOR game assisted with a limited amount of two-way communication in terms of tensor norms of normed spaces.
PB Springer
SN 1570-0755
YR 2021
FD 2021
LK https://hdl.handle.net/20.500.14352/8077
UL https://hdl.handle.net/20.500.14352/8077
LA eng
NO 1. Brunner, N., Cavalcanti, D., Pironio, S., Scarani, V., Wehner, S.: Bell nonlocality. Rev. Mod. Phys. 86, 419 (2014)2. Bell, J.S.: On the Einstein–Podolsky–Rosen paradox. Physics 1, 195 (1964)3. Tsirelson, B.S.: Some results and problems on quantum Bell-type inequalities. Hadron. J. Suppl. 8(4), 329–345 (1993)4. Pérez-García, D., Wolf, M.M., Palazuelos, C., Villanueva, I., Junge, M.: Unbounded violation oftripartite Bell inequalities. Commun. Math. Phys. 279, 455–486 (2008)5. Briet, J., Vidick, T.: Explicit lower and upper bounds on the entangled value of multiplayer XOR games. Commun. Math. Phys. 321, 181–207 (2013)6. Palazuelos, C., Vidick, T.: Survey on nonlocal games and operator space theory. J. Math. Phys. 57, 015220 (2016)7. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (2006)8. Yao, A.C.: Quantum circuit complexity. In: Proceedings 34th Annual Symposium on Foundations of Computer Science, FOCS 93, pp. 352–361 (1993)9. Cleve, R., Buhrman, H.: Substituting quantum entanglement for communication. Phys. Rev. A 56, 1201–1204 (1997)10. Bennett, C.H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein–Podolsky–Rosen channels. Phys. Rev. Lett. 70, 1895–1899 (1993)11. Regev, O., Klartag, B.: Quantum one-way communication can be exponentially stronger than classicalcommunication. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp. 31–40. ACM, San Jose, CA, USA (2011)12. Raz, R.: Exponential separation of quantum and classical communication complexity. In: Proceedingsof the 31st Annual ACM Symposium on the Theory of Computing, pp. 358–367 (1999)13. Buhrman, H., Czekaj, L., Grudka, A., Horodecki, M., Horodecki, P., Markiewicz, M., Speelman, F., Strelchuk, S.: Quantum communication complexity advantage implies violation of a Bell inequality. PNAS 113(12), 3191–3196 (2016)14. Junge, M., Palazuelos, C., Villanueva, I.: Classical vs. quantum communication in XOR games. Quantum Inf. Proc. 17, 117 (2018)15. Defant, A., Floret, K.: Tensor Norms and Operator Ideals. North-Holland, Amsterdam (1993)16. Ryan, R.A.: Introduction to Tensor Products of Banach Spaces. ISBN 978-1-4471-3903-4 (2002)
NO Ministerio de Economía y Competitividad (MINECO)
DS Docta Complutense
RD 6 may 2024