Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Classical versus quantum communication in XOR games

Marius Junge, Carlos Palazuelos, Ignacio Villanueva

Published Apr 5, 2018• 7 citations
Publisher
DOI
10.1007/s11128-018-1883-0

Related papers

Quantum one-way versus classical two-way communication in XOR games

Abderramán Amr, Ignacio Villanueva

Quantum Information Processing•Feb 1, 2021•0 citations

Quantum strategies for simple two-player XOR games

Ricardo Faleiro

arXiv:1910.04478•Quantum Information Processing•Jul 3, 2020•3 citations

Quantum Strategies Are Better Than Classical in Almost Any XOR Game

Andris Ambainis, Artūrs Bačkurs, Kaspars Balodis +4 more

Lecture notes in computer science•Jan 1, 2012•14 citations

Advantage of Quantum Strategies in Random Symmetric XOR Games

Andris Ambainis, Jānis Iraids, Dmitry Kravchenko +1 more

Lecture notes in computer science•Jan 1, 2013•5 citations

Nonlocal Quantum XOR Games for Large Number of Players

Andris Ambainis, Dmitry Kravchenko, Nikolajs Nahimovs +1 more

Lecture notes in computer science•Jan 1, 2010•11 citations

Quantum one way vs. classical two way communication in XOR games

Abderramán Amr, Ignacio Villanueva

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 $\log n$ 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.

arXiv:2003.09747•Mar 21, 2020•0 citations
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)O(n)O(n) bits of two way classical communication are needed in order to achieve the same value as can be attained with log⁡n\log nlogn 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.