Quantum Advantages in Hypercube Game
Xiaoyu He, Kun Fang, Xiaoming Sun, and Runyao Duan

TL;DR
This paper introduces a multiplayer hypercube game generalizing CHSH, analyzing classical, quantum, and no-signalling strategies, revealing that quantum advantage diminishes exponentially with more players, unlike no-signalling strategies.
Contribution
It generalizes the CHSH game to multiple players, providing a complete characterization of classical, quantum, and no-signalling winning probabilities.
Findings
Quantum advantage decreases exponentially with more players.
No-signalling strategies always achieve perfect success.
Quantum value approaches classical value as number of players increases.
Abstract
We introduce a novel generalization of the Clauser-Horne-Shimony-Holt (CHSH) game to a multiplayer setting, i.e., Hypercube game, where all players are required to assign values to vertices on corresponding facets of an -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 increases, while the no-signalling value always remains to be one.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Computing Algorithms and Architecture · Game Theory and Applications
