Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2411.15536 · Quantum Information Processing

Four-qubit CHSH game

Joaquim Jusseau, Hamza Jaffali, Frédéric Holweck

Published Oct 14, 2025• 5 citations
arXivHTMLPDF

Abstract

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 $$\vert {GHZ_4} \rangle =\dfrac{1}{\sqrt{2}}(\vert {0000} \rangle +\vert {1111} \rangle )$$ | 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 $$\vert {W_4} \rangle =\dfrac{1}{2}(\vert {0001} \rangle +\vert {0010} \rangle +\vert {0100} \rangle +\vert {1000} \rangle )$$ | 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.

DOI
10.1007/s11128-025-04939-8

Related papers

Two new non-equivalent three-qubit CHSH games

Hamza Jaffali, Frédéric Holweck

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.

arXiv:2312.00578•Quantum Information and Computation•Apr 1, 2024•4 citations

New Multi-Qubit CHSH Games and their application to Device-Independent Quantum Key Distribution protocols

Venugopal S, Kunwar Singh

In the Quantum Computing field, the CHSH (Clauser-Horne-Shimony-Holt) game plays a vital role in determining whether a system is in classical or quantum domain. This quantum advantage property is applied in determining the security of the quantum systems, especially in quantum cryptography, in the form of Device-Independent (DI) secure Quantum Key Distribution (QKD). The traditional CHSH game is designed for a system with two players, where each player has access to one entangled qubit from the Bell’s state. In 2024, Hamza Jaffali and Frédéric Holweck proposed a new three-qubit CHSH game by extending the traditional CHSH game to three players using the three-qubit Greenberger–Horne–Zeilinger (GHZ) state and W state.In this paper, first, we present our findings of new CHSH quantum games with quantum advantage in the four-qubit and five-qubit systems. These CHSH quantum games, when played using their quantum strategy, are found to outperform any classical strategy. Second, we apply the quantum advantage property of the existing three-qubit game to develop the corresponding three party DIQKD protocol. Third, we then apply the quantum advantage property of the newly developed four-qubit and five-qubit games to develop their corresponding four party and five party DIQKD protocols.

International Conference on Communication Systems & Networks (COMSNETS)•Jan 6, 2025•2 citations

A New Quantum Game Based on CHSH Game

Alan Bojić

The Quantum game theory is an extension of the classical game theory which describes games in which players share quantum information during the game. The use of the quantum mechanical effects enables players better results than they would achieve in the classical game without sharing any information at all. In this paper I would like to describe a new two player cooperative game which is based on the well known CHSH game. A quantum strategy for a new game will be introduced and it will be compared to the classical strategy and CHSH game strategy.

•Jun 1, 2013•0 citations

Optimal, and approximately optimal, quantum strategies for $\mathrm{XOR}^{*}$ and $\mathrm{FFL}$ games

Pete Rigas

We analyze optimal, and approximately optimal, quantum strategies in two non-local settings based upon previous investigations of the XOR and CHSH games. By building upon previous arguments due to Ostrev in 2016, {\color{blue}[37]}, which characterized approximately optimal, and optimal, strategies that players Alice and Bob can adopt for increasing their respective winning probabilities, we identify additional applications of the framework for analyzing prospective quantum advantage in other game-theoretic settings. In particular, while it is possible for Alice and Bob to realize quantum advantage if they adopt strategies that are dependent upon entanglement, two-dimensional resource systems, and reversible transformations, the magnitude of the duality gap between the performance of classical and quantum strategies has not yet been classified from the perspective of error bounds. Such bounds are not only dependent upon the winning probability if Alice and Bob leverage entanglement in their strategies but also upon a suitably defined representation-theoretic intertwining operation.

arXiv:2311.12887•Nov 21, 2023•8 citations

Quantum Advantages in Hypercube Game

He, Xiaoyu, Kun Fang, Xiaoming Sun +1 more

We introduce a novel generalization of the Clauser-Horne-Shimony-Holt (CHSH) game to a multiplayer setting, i.e., Hypercube game, where all $m$ players are required to assign values to vertices on corresponding facets of an $m$-dimensional hypercube. The players win if and only if their answers satisfy both parity and consistency conditions. We completely characterize the maximum winning probabilities (game value) under classical, quantum and no-signalling strategies, respectively. In contrast to the original CHSH game designed to demonstrate the superiority of quantumness, we find that the quantum advantages in the Hypercube game significantly decrease as the number of players increase. Notably, the quantum value decays exponentially fast to the classical value as $m$ increases, while the no-signalling value always remains to be one.

arXiv:1806.02642•Jun 7, 2018•2 citations

What can be computed without communications?

Heger Arfaoui, Pierre Fraigniaud

The main objective of this paper is to provide illustrative examples of distributed computing problems for which it is possible to design tight lower bounds for quantum algorithms without having to manipulate concepts from quantum mechanics, at all. As a case study, we address the following class of 2-player problems. Alice (resp., Bob) receives a boolean x (resp., y) as input, and must return a boolean a (resp., b) as output. A game between Alice and Bob is defined by a pair (?, f) of boolean functions. The objective of Alice and Bob playing game (?, f) is, for every pair (x, y) of inputs, to output values a and b, respectively, satisfying ?(a, b) = f(x, y), in absence of any communication between the two players, but in presence of shared resources. The ability of the two players to solve the game then depends on the type of resources they share. It is known that, for the so-called CHSH game, i.e., for the game a ? b = x ? y, the ability for the players to use entangled quantum bits (qubits) helps. We show that, apart from the CHSH game, quantum correlations do not help, in the sense that, for every game not equivalent to the CHSH game, there exists a classical protocol (using shared randomness) whose probability of success is at least as large as the one of any protocol using quantum resources. This result holds for both worst case and average case analysis. It is achieved by considering a model stronger than quantum correlations, the non-signaling model, which subsumes quantum mechanics, but is far easier to handle.

ACM SIGACT News•Sep 17, 2014•29 citations
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⟩=12(∣0000⟩+∣1111⟩)\vert {GHZ_4} \rangle =\dfrac{1}{\sqrt{2}}(\vert {0000} \rangle +\vert {1111} \rangle )∣GHZ4​⟩=2​1​(∣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⟩=12(∣0001⟩+∣0010⟩+∣0100⟩+∣1000⟩)\vert {W_4} \rangle =\dfrac{1}{2}(\vert {0001} \rangle +\vert {0010} \rangle +\vert {0100} \rangle +\vert {1000} \rangle )∣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.
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 GHZGHZGHZ state, while in the other one, the players have a better advantage when they use a WWW 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.
In the Quantum Computing field, the CHSH (Clauser-Horne-Shimony-Holt) game plays a vital role in determining whether a system is in classical or quantum domain. This quantum advantage property is applied in determining the security of the quantum systems, especially in quantum cryptography, in the form of Device-Independent (DI) secure Quantum Key Distribution (QKD). The traditional CHSH game is designed for a system with two players, where each player has access to one entangled qubit from the Bell’s state. In 2024, Hamza Jaffali and Frédéric Holweck proposed a new three-qubit CHSH game by extending the traditional CHSH game to three players using the three-qubit Greenberger–Horne–Zeilinger (GHZ) state and W state.In this paper, first, we present our findings of new CHSH quantum games with quantum advantage in the four-qubit and five-qubit systems. These CHSH quantum games, when played using their quantum strategy, are found to outperform any classical strategy. Second, we apply the quantum advantage property of the existing three-qubit game to develop the corresponding three party DIQKD protocol. Third, we then apply the quantum advantage property of the newly developed four-qubit and five-qubit games to develop their corresponding four party and five party DIQKD protocols.
The Quantum game theory is an extension of the classical game theory which describes games in which players share quantum information during the game. The use of the quantum mechanical effects enables players better results than they would achieve in the classical game without sharing any information at all. In this paper I would like to describe a new two player cooperative game which is based on the well known CHSH game. A quantum strategy for a new game will be introduced and it will be compared to the classical strategy and CHSH game strategy.
Optimal, and approximately optimal, quantum strategies for XOR∗\mathrm{XOR}^{*}XOR∗ and FFL\mathrm{FFL}FFL games
We analyze optimal, and approximately optimal, quantum strategies in two non-local settings based upon previous investigations of the XOR and CHSH games. By building upon previous arguments due to Ostrev in 2016, {\color{blue}[37]}, which characterized approximately optimal, and optimal, strategies that players Alice and Bob can adopt for increasing their respective winning probabilities, we identify additional applications of the framework for analyzing prospective quantum advantage in other game-theoretic settings. In particular, while it is possible for Alice and Bob to realize quantum advantage if they adopt strategies that are dependent upon entanglement, two-dimensional resource systems, and reversible transformations, the magnitude of the duality gap between the performance of classical and quantum strategies has not yet been classified from the perspective of error bounds. Such bounds are not only dependent upon the winning probability if Alice and Bob leverage entanglement in their strategies but also upon a suitably defined representation-theoretic intertwining operation.
We introduce a novel generalization of the Clauser-Horne-Shimony-Holt (CHSH) game to a multiplayer setting, i.e., Hypercube game, where all mmm players are required to assign values to vertices on corresponding facets of an mmm-dimensional hypercube. The players win if and only if their answers satisfy both parity and consistency conditions. We completely characterize the maximum winning probabilities (game value) under classical, quantum and no-signalling strategies, respectively. In contrast to the original CHSH game designed to demonstrate the superiority of quantumness, we find that the quantum advantages in the Hypercube game significantly decrease as the number of players increase. Notably, the quantum value decays exponentially fast to the classical value as mmm increases, while the no-signalling value always remains to be one.
The main objective of this paper is to provide illustrative examples of distributed computing problems for which it is possible to design tight lower bounds for quantum algorithms without having to manipulate concepts from quantum mechanics, at all. As a case study, we address the following class of 2-player problems. Alice (resp., Bob) receives a boolean x (resp., y) as input, and must return a boolean a (resp., b) as output. A game between Alice and Bob is defined by a pair (?, f) of boolean functions. The objective of Alice and Bob playing game (?, f) is, for every pair (x, y) of inputs, to output values a and b, respectively, satisfying ?(a, b) = f(x, y), in absence of any communication between the two players, but in presence of shared resources. The ability of the two players to solve the game then depends on the type of resources they share. It is known that, for the so-called CHSH game, i.e., for the game a ? b = x ? y, the ability for the players to use entangled quantum bits (qubits) helps. We show that, apart from the CHSH game, quantum correlations do not help, in the sense that, for every game not equivalent to the CHSH game, there exists a classical protocol (using shared randomness) whose probability of success is at least as large as the one of any protocol using quantum resources. This result holds for both worst case and average case analysis. It is achieved by considering a model stronger than quantum correlations, the non-signaling model, which subsumes quantum mechanics, but is far easier to handle.