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:1806.02642

Quantum Advantages in Hypercube Game

He, Xiaoyu, Kun Fang, Xiaoming Sun, Runyao Duan

Published Jun 7, 2018• 2 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1806.02642

Related papers

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

Non-Hermitian CHSH* Game with a Single Trapped-Ion Qubit

Xiao 潇 Song 宋, Teng Liu, Ji Bian +4 more

Abstract The Clauser–Horne–Shimony–Holt (CHSH) game provides a captivating illustration of the advantages of quantum strategies over classical ones. In a recent study, a variant of the CHSH game leveraging a single qubit system, referred to as the CHSH* game, has been identified. We demonstrate that this mapping relationship between these two games remains effective even for a non-unitary gate. Here we delve into the breach of Tsirelson’s bound in a non-Hermitian system, predicting changes in the upper and lower bounds of the player’s winning probability when employing quantum strategies in a single dissipative qubit system. We experimentally explore the impact of the CHSH* game on the player’s winning probability in a single trapped-ion dissipative system, demonstrating a violation of Tsirelson’s bound under the influence of parity-time ( P T ) symmetry. These results contribute to a deeper understanding of the influence of non-Hermitian systems on quantum games and the behavior of quantum systems under P T symmetry, which is crucial for designing more robust and efficient quantum protocols.

Chinese Physics Letters•May 8, 2024•2 citations

The Mermin-Peres Magic Square Game With Three or More Players

Itamar Lorian, J. E. Avron

We present a generalization of the Mermin-Peres magic square game to $N$ players, in which the square is replaced by an $N$-dimensional hypercube. We show that the winning probability of the optimal classical strategy remains $8/9$ for all $N$, while for $N \ge 3$, a generalization of the quantum strategy for $N = 2$ achieves a winning probability between $1/3$ and $3/4$. This loss of quantum advantage for $N \ge 3$ is a consequence of monogamy.

quant-pharXiv:2610.06534•Oct 6, 2026•0 citations

An explicit classical strategy for winning a ${\mathrm{CHSH}}_{q}$ game

Matej Pivoluska, Martin Plesch

A CHSH q game is a generalization of the standard two player CHSH game, with q different input and output options. In contrast to the binary game, the best classical and quantum winning strategies are not known exactly. In this paper we provide a constructive classical strategy for winning a CHSH q game, with q being a prime. Our construction achieves a winning probability better than , which is in contrast with the previously known constructive strategies achieving only the winning probability of .

arXiv:1510.07431•New Journal of Physics•Feb 12, 2016•6 citations

Tight bound on the classical value of generalized Clauser-Horne-Shimony-Holt games

Matej Pivoluska, Marcin Pawłowski, Martin Plesch

Nonlocal games are an important part of quantum information processing. Recently there has been an increased interest in generalizing nonlocal games beyond the basic setup by considering games with multiple parties and/or with large alphabet inputs and outputs. We consider another interesting generalization---games with nonuniform inputs. Here we derive a tight upper bound for the classical winning probability for a family of nonlocal games with nonuniform input distribution, known as ${\mathrm{CHSH}}_{q}(p)$, which was introduced recently in the context of relativistic bit-commitment protocols by Chakraborty et al. [Phys. Rev. Lett. 115, 250501 (2015)].

arXiv:1601.08095•Physical Review A•Aug 29, 2016•4 citations

Unconditional quantum advantage from a two-round CHSH problem in one dimension

Yonghae Lee, Jeonghyeon Shin, Soojoon Lee

We introduce a relation problem constructed from the Clauser--Horne--Shimony--Holt (CHSH) game, which we call the two-round one-dimensional CHSH problem. Its two-round structure ensures that the CHSH questions are supplied only after the relevant Pauli-frame data have been fixed, thereby ruling out a simple classical strategy that solves the corresponding problem perfectly when all inputs are supplied simultaneously. We construct a quantum circuit on $2N$ qubits that uses only adjacent two-qubit gates, has operational depth at most eight, and achieves the optimal quantum success probability of CHSH, which is strictly smaller than one. We prove that, for every fixed $0\leqδ<(\sqrt{2}-1)/4$, any randomized classical circuit with fixed wiring and bounded gate fan-in that achieves an average success probability of at least $(2+\sqrt{2})/4-δ$ requires depth $Ω(\log N)$ after the questions of the second round are supplied. This yields an unconditional separation even though the quantum circuit is restricted to a one-dimensional geometry, whereas the classical circuit has no geometric locality restriction. The result shows that perfect quantum success is not necessary for unconditional quantum advantage with shallow circuits.

quant-pharXiv:2609.21237•Sep 21, 2026•0 citations
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.
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.
Abstract The Clauser–Horne–Shimony–Holt (CHSH) game provides a captivating illustration of the advantages of quantum strategies over classical ones. In a recent study, a variant of the CHSH game leveraging a single qubit system, referred to as the CHSH* game, has been identified. We demonstrate that this mapping relationship between these two games remains effective even for a non-unitary gate. Here we delve into the breach of Tsirelson’s bound in a non-Hermitian system, predicting changes in the upper and lower bounds of the player’s winning probability when employing quantum strategies in a single dissipative qubit system. We experimentally explore the impact of the CHSH* game on the player’s winning probability in a single trapped-ion dissipative system, demonstrating a violation of Tsirelson’s bound under the influence of parity-time ( P T ) symmetry. These results contribute to a deeper understanding of the influence of non-Hermitian systems on quantum games and the behavior of quantum systems under P T symmetry, which is crucial for designing more robust and efficient quantum protocols.
We present a generalization of the Mermin-Peres magic square game to NNN players, in which the square is replaced by an NNN-dimensional hypercube. We show that the winning probability of the optimal classical strategy remains 8/98/98/9 for all NNN, while for N≥3N \ge 3N≥3, a generalization of the quantum strategy for N=2N = 2N=2 achieves a winning probability between 1/31/31/3 and 3/43/43/4. This loss of quantum advantage for N≥3N \ge 3N≥3 is a consequence of monogamy.
An explicit classical strategy for winning a CHSHq{\mathrm{CHSH}}_{q}CHSHq​ game
A CHSH q game is a generalization of the standard two player CHSH game, with q different input and output options. In contrast to the binary game, the best classical and quantum winning strategies are not known exactly. In this paper we provide a constructive classical strategy for winning a CHSH q game, with q being a prime. Our construction achieves a winning probability better than , which is in contrast with the previously known constructive strategies achieving only the winning probability of .
Nonlocal games are an important part of quantum information processing. Recently there has been an increased interest in generalizing nonlocal games beyond the basic setup by considering games with multiple parties and/or with large alphabet inputs and outputs. We consider another interesting generalization---games with nonuniform inputs. Here we derive a tight upper bound for the classical winning probability for a family of nonlocal games with nonuniform input distribution, known as CHSHq(p){\mathrm{CHSH}}_{q}(p)CHSHq​(p), which was introduced recently in the context of relativistic bit-commitment protocols by Chakraborty et al. [Phys. Rev. Lett. 115, 250501 (2015)].
We introduce a relation problem constructed from the Clauser--Horne--Shimony--Holt (CHSH) game, which we call the two-round one-dimensional CHSH problem. Its two-round structure ensures that the CHSH questions are supplied only after the relevant Pauli-frame data have been fixed, thereby ruling out a simple classical strategy that solves the corresponding problem perfectly when all inputs are supplied simultaneously. We construct a quantum circuit on 2N2N2N qubits that uses only adjacent two-qubit gates, has operational depth at most eight, and achieves the optimal quantum success probability of CHSH, which is strictly smaller than one. We prove that, for every fixed 0≤δ<(2−1)/40\leqδ<(\sqrt{2}-1)/40≤δ<(2​−1)/4, any randomized classical circuit with fixed wiring and bounded gate fan-in that achieves an average success probability of at least (2+2)/4−δ(2+\sqrt{2})/4-δ(2+2​)/4−δ requires depth Ω(log⁡N)Ω(\log N)Ω(logN) after the questions of the second round are supplied. This yields an unconditional separation even though the quantum circuit is restricted to a one-dimensional geometry, whereas the classical circuit has no geometric locality restriction. The result shows that perfect quantum success is not necessary for unconditional quantum advantage with shallow circuits.