Quantum strategies are better than classical in almost any XOR game
Andris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitry Kravcenko,, Raitis Ozols, Juris Smotrovs, Madars Virza

TL;DR
This paper demonstrates that quantum strategies outperform classical ones in nearly all large random 2-player XOR games, highlighting the advantage of quantum over classical approaches in nonlocal game scenarios.
Contribution
It establishes that for most large random XOR games, quantum strategies significantly outperform classical strategies, a novel result in the study of nonlocal games.
Findings
Quantum strategies outperform classical in almost all large XOR games.
Entangled value exceeds classical value by at least 1.21 times for most games.
Results apply to a 1-o(1) fraction of all such games.
Abstract
We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n questions to every player is at least 1.21... times the classical value, for 1-o(1) fraction of all 2-player XOR games.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Quantum Computing Algorithms and Architecture · Complexity and Algorithms in Graphs
