  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.
