We study the two-player hat game as a two-input, three-output non-local game. We calculate the quantum commuting value and show that it coincides with the quantum one. In particular, we show that \[ω_{\rm q}(H_2)=ω_{\mathrm{qc}}(H_2)=\frac{15+\sqrt{33}}{36}\approx 0.576238.\] We achieve the optimal quantum advantage using a shared non-maximally entangled qutrit state. To establish optimality, we exploit the game's symmetry under the dihedral group $D_8$ and apply its representation theory to substantially reduce the complexity of the underlying matrix problem. We also determine the no-signalling value $ω_{\mathrm{ns}}(H_2)=2/3$.
We study the two-player hat game as a two-input, three-output non-local game. We calculate the quantum commuting value and show that it coincides with the quantum one. In particular, we show that [ω_{\rm q}(H_2)=ω_{\mathrm{qc}}(H_2)=\frac{15+\sqrt{33}}{36}\approx 0.576238.] We achieve the optimal quantum advantage using a shared non-maximally entangled qutrit state. To establish optimality, we exploit the game's symmetry under the dihedral group D8 and apply its representation theory to substantially reduce the complexity of the underlying matrix problem. We also determine the no-signalling value ωns(H2)=2/3.
How much entanglement does near-optimal play of a two-player nonlocal game require? We give an explicit binary linear system game, with 1687 equations in 1993 variables and at most three variables in each equation, whose quantum value is one, and in which every strategy that wins with probability 1−ε needs entanglement entropy ε−1+o(1), hence local dimension exp(ε−1+o(1)). The same bound holds for the entanglement of formation of mixed strategies, and a strategy on a maximally entangled state of local dimension exp(Cε−1log(1/ε)) suffices, so the exponent is sharp. For explicit two-player games of quantum value one, the best previous lower bound was polynomial in 1/ε. The game comes from a finitely generated, elementary amenable group: a lamplighter whose lamps are Pauli pairs indexed by finite sets of points on the three rays on which Houghton's group acts. Exponentially many of these pairs share one central involution, yet the relation that any two of them commute can be derived from a fixed finite set of relations in a number of steps only quasi-polynomial in the number of points. Two tools may be of independent use. The first counts qubits from approximate Pauli relations measured in an arbitrary state, with the errors of different pairs adding in squares. The second identifies, in both directions and at the natural precision ε, the near-optimal strategies of a linear system game with approximate representations of its solution group measured in the players' actual state, so that no power of ε is lost by passing to a flat state. The same tools give sharp rates for two earlier examples: the CHSH(n) games need Θ(min(n,1/ε)) ebits, and the linear system game of Slofstra and Vidick needs local dimension Θ(ε−1/2).
In classical (standard) game theory, a useful algorithm for searching Nash equilibrium in games of two players, is to determine the best response functions. For each strategy S1 of player 1 player 2 finds a best response function F2(S1), and vice versa. If the two response functions intersect, the intersection point (S1*, S2*) is a candidate for Nash equilibrium. This method is especially useful when the strategy space of each player is determined by a single variable (discrete or continuous). In the last decade, the concept of quantum games has been developed (hence we distinguish between classical and quantum games). In a quantum game with two players the strategy space of each player is composed of 2 × 2 complex unitary matrices with unit determinant. That is the group SU(2). The corresponding strategy space is characterized by three continuous variables represented by angles: 0 ≤ α ≤ 2π, 0 ≤ β ≤ 2π, 0 ≤ θ ≤ π. That turns the use of response functions impractical. In the present contribution we suggest a method for alleviating this problem by discretizing the variables as: {αi, βj, θk}, i= 1, 2, ..., I; j = 1, 2, ..., J; k = 1, 2, ... K. This enables the representation of every such triple by a single discrete variable, (αi, βj, θk) → xijk. Thereby, the strategy space is characterized by a single discrete variable taking I × J × K values and the method of response functions is feasible. We use it to show the following two results: 1) A two players quantum game with partially entangled initial state has a pure strategy Nash equilibrium. 2) A two player quantum Bayesian game with fully entangled initial state has a pure strategy Nash equilibrium.
In this paper, we generalize to three players the well-known CHSH quantum game. To do so, we consider all possible 3-variables Boolean functions and search among them which ones correspond to a game scenario with a quantum advantage (for a given entangled state). In particular, we provide two new three-player quantum games where, in one case, the best quantum strategy is obtained when the players share a GHZ state, while in the other one, the players have a better advantage when they use a W state as their quantum resource. To illustrate our findings we implement our game scenarios on an online quantum computer and prove experimentally the advantage of the corresponding quantum resource for each game.
We describe a two-player non-local game, with a fixed small number of questions and answers, such that an ϵ -close to optimal strategy requires an entangled state of dimension 2 Ω ( ϵ − 1 / 8 ) . Our non-local game is inspired by the three-player non-local game of Ji, Leung and Vidick \cite{ji2018three}. It reduces the number of players from three to two, as well as the question and answer set sizes. Moreover, it provides an (arguably) elementary proof of the non-closure of the set of quantum correlations, based on embezzlement and self-testing. In contrast, previous proofs \cite{slofstra2019set, dykema2017non, musat2018non} involved representation theoretic machinery for finitely-presented groups and C ∗ -algebras.
Abstract In this paper, the CHSH quantum game is extended to four players. This is achieved by exploring all possible 4-variable Boolean functions to identify those that yield a game scenario with a quantum advantage using a specific entangled state. Notably, two new four-player quantum games are presented. In one game, the optimal quantum strategy is achieved when players share a ∣GHZ4⟩=21(∣0000⟩+∣1111⟩) | G H Z 4 ⟩ = 1 2 ( | 0000 ⟩ + | 1111 ⟩ ) state, breaking the traditional 10% gain observed in 2- and 3-qubit CHSH games and achieving a 22.5% gap. In the other game, players gain a greater advantage using a ∣W4⟩=21(∣0001⟩+∣0010⟩+∣0100⟩+∣1000⟩) | W 4 ⟩ = 1 2 ( | 0001 ⟩ + | 0010 ⟩ + | 0100 ⟩ + | 1000 ⟩ ) state as their quantum resource. Quantum games with other four-qubit entangled states are also explored. To demonstrate the results, these game scenarios are implemented on an online quantum computer, and the advantage of the respective quantum resource for each game is experimentally verified.