Quantum strategies are better than classical in almost any XOR game

Authors:
Andris Ambainis;Artūrs Bačkurs;Kaspars Balodis;Dmitrijs Kravčenko;Raitis Ozols;Juris Smotrovs;Madars Virza
Affiliations:
Faculty of Computing, University of Latvia, Riga, Latvia;Faculty of Computing, University of Latvia, Riga, Latvia;Faculty of Computing, University of Latvia, Riga, Latvia;Faculty of Computing, University of Latvia, Riga, Latvia;Faculty of Computing, University of Latvia, Riga, Latvia;Faculty of Computing, University of Latvia, Riga, Latvia;Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA
Venue:
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Year:
2012

Citing 8
Cited 0

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Consequences and Limits of Nonlocal Strategies

CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Complexity measures of sign matrices

Combinatorica
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
On the power of quantum computation

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Near-Optimal and Explicit Bell Inequality Violations

CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
The Grothendieck Constant is Strictly Smaller than Krivine's Bound

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.