DeepAI AI Chat
Log In Sign Up

3XOR Games with Perfect Commuting Operator Strategies Have Perfect Tensor Product Strategies and are Decidable in Polynomial Time

by   Adam Bene Watts, et al.

We consider 3XOR games with perfect commuting operator strategies. Given any 3XOR game, we show existence of a perfect commuting operator strategy for the game can be decided in polynomial time. Previously this problem was not known to be decidable. Our proof leads to a construction, showing a 3XOR game has a perfect commuting operator strategy iff it has a perfect tensor product strategy using a 3 qubit (8 dimensional) GHZ state. This shows that for perfect 3XOR games the advantage of a quantum strategy over a classical strategy (defined by the quantum-classical bias ratio) is bounded. This is in contrast to the general 3XOR case where the optimal quantum strategies can require high dimensional states and there is no bound on the quantum advantage. To prove these results, we first show equivalence between deciding the value of an XOR game and solving an instance of the subgroup membership problem on a class of right angled Coxeter groups. We then show, in a proof that consumes most of this paper, that the instances of this problem corresponding to 3XOR games can be solved in polynomial time.


page 16

page 31

page 32


Algorithms, Bounds, and Strategies for Entangled XOR Games

We study the complexity of computing the commuting-operator value ω^* of...

Complexity limitations on one-turn quantum refereed games

This paper studies complexity theoretic aspects of quantum refereed game...

Noisy three-player dilemma game: Robustness of the quantum advantage

Games involving quantum strategies often yield higher payoff. Here, we s...

Comment on "Quantum Games and Quantum Strategies"

We point out a flaw in the unfair case of the quantum Prisoner's Dilemma...

Quantum Combinatorial Games: Structures and Computational Complexity

Recently, a standardized framework was proposed for introducing quantum-...

Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games

We develop value iteration-based algorithms to solve in a unified manner...

Nonlocal Games, Compression Theorems, and the Arithmetical Hierarchy

We investigate the connection between the complexity of nonlocal games a...