# On the power of quantum entanglement in multipartite quantum XOR games

## TL;DR

This paper demonstrates that in multipartite quantum XOR games with three or more players, quantum entanglement can significantly outperform separable strategies, highlighting its powerful role beyond bipartite scenarios.

## Contribution

The paper proves that for any number of players greater than or equal to three, there exist quantum XOR games where entanglement vastly exceeds classical strategies, unlike the bipartite case.

## Key findings

- Entangled bias can be arbitrarily larger than separable bias in multipartite XOR games.
- Quantum entanglement is a more powerful resource than classical communication in these games.
- Contrast with bipartite case where entangled bias is bounded by a constant.

## Abstract

In this paper we show that, given $k\geq 3$, there exist $k$-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 the entangled bias is always upper bounded by a universal constant times the one-way classical communication bias.