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

arXiv:2003.09747 · Quantum Information Processing

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

Abderramán Amr, Ignacio Villanueva

Published Feb 1, 2021• 1 citation
arXivHTMLPDF
DOI
10.1007/s11128-021-03014-2

Related papers

Classical versus quantum communication in XOR games

Marius Junge, Carlos Palazuelos, Ignacio Villanueva

arXiv:1706.02653•Quantum Information Processing•Apr 5, 2018•9 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•12 citations

Quantum strategies for simple two-player XOR games

Ricardo Faleiro

arXiv:1910.04478•Quantum Information Processing•Jul 3, 2020•3 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•4 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•10 citations

On the power of quantum entanglement in multipartite quantum XOR games

Marius Junge, Carlos Palazuelos

Abstract We show that, given , there exist ‐player quantum XOR games for which the entangled bias can be arbitrarily larger than the bias of the game when the players are restricted to separable strategies. In particular, quantum entanglement can be a much more powerful resource than local operations and classical communication to play these games. This result shows a strong contrast to the bipartite case, where it was recently proved that, as a consequence of a noncommutative version of Grothendieck theorem, the entangled bias is always upper bounded by a universal constant times the one‐way classical communication bias. In this sense, our main result can be understood as a counterexample to an extension of such a noncommutative Grothendieck theorem to multilinear forms.

arXiv:2302.11800•Journal of the London Mathematical Society•Oct 25, 2024•1 citation
Abstract We show that, given , there exist ‐player quantum XOR games for which the entangled bias can be arbitrarily larger than the bias of the game when the players are restricted to separable strategies. In particular, quantum entanglement can be a much more powerful resource than local operations and classical communication to play these games. This result shows a strong contrast to the bipartite case, where it was recently proved that, as a consequence of a noncommutative version of Grothendieck theorem, the entangled bias is always upper bounded by a universal constant times the one‐way classical communication bias. In this sense, our main result can be understood as a counterexample to an extension of such a noncommutative Grothendieck theorem to multilinear forms.