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

Science China Physics Mechanics and Astronomy

Minimum best success probability by classical strategies for quantum pseudo-telepathy

Fei Gao, Wei Fang, Qiaoyan Wen

Published May 15, 2014• 8 citations
Publisher
DOI
10.1007/s11433-014-5485-2

Related papers

Quantum pseudo-telepathy games

Anne Broadbent

•Jan 1, 2004•4 citations

Quantum Pseudo-Telepathy

Gilles Brassard, Anne Broadbent, Alain Tapp

arXiv:quant-ph/0407221•Foundations of Physics•Nov 1, 2005•219 citations

Quantum Computer Simulations of Quantum Pseudo-Telepathy (QPT) for the Greenberger-Horne-Zeilinger (GHZ) Game

Thomas H. Yang, Weiguo Yang

Ongoing development and increased accessibility of quantum computing has allowed for broadly replicable demonstrations of previously theoretical formulated quantum games and thought experiments, simulated as well as across different quantum platforms. Quantum pseudo-telepathy (QPT) is one such unintuitive result, where the prior quantum entanglement of states can forego the need for classical communication to successfully complete simultaneously coordinated tasks. The Greenberger-Horne-Zeilinger (GHZ) game is one such demonstration of QPT by posing a particular three-player question game where a quantum strategy utilizing entangled states outperforms the best classical strategy. Through the use of OpenQASM 2.0 and IBM Quantum Platform, the entangled states with winning quantum strategies of the GHZ game are implemented, demonstrating the efficacies of a quantum strategy of 100% probability of winning in contrast to the 75% maximal winning probability of any classical strategy. Potential applications based on this winning quantum strategy of the GHZ game such as zero-knowledge shared authentication are also discussed.

IEEE SoutheastCon•Mar 22, 2025•0 citations

A Primary Quantum Model of Telepathy

Shan Gao

•Jan 1, 2017•1 citation

Minimum entangled state dimension required for pseudo-telepathy

Gilles Brassard, André Allan Méthot, Alain Tapp

Pseudo-telepathy provides an intuitive way of looking at Bell's inequalities, in which it is often obvious that feats achievable by use of quantum entanglement would be classically impossible. A~two-player pseudo-telepathy game proceeds as follows: Alice and Bob are individually asked a question and they must provide an answer. They are \emph{not} allowed any form of communication once the questions are asked, but they may have agreed on a common strategy prior to the execution of the game. We~say that they \emph{win} the game if the questions and answers fulfil a specific relation. A~game exhibits \emph{pseudo-telepathy} if there is a quantum strategy that makes Alice and Bob win the game for all possible questions, provided they share prior entanglement, whereas it would be impossible to win this game systematically in a classical setting. In~this paper, we show that any two-player pseudo-telepathy game requires the quantum players to share an entangled quantum system of dimension at least~\mbox{$3 \times 3$}. This is optimal for two-player games, but the most efficient pseudo-telepathy game possible, in terms of total dimension, involves \emph{three} players who share a quantum system of dimension~\mbox{$2 \times 2 \times 2$}.

arXiv:quant-ph/0412136•Quantum Information and Computation•Jul 1, 2005•36 citations

Separating pseudo-telepathy games and two-local theories

Mathieu, Louis, Mehdi Mhalla

We give an $\dfrac{1}{54}$ separation between 5-party pseudo-telepathy games and two-local theories. We define the notion of strategy in a k-local theory for a game, and extend the method of Chao and Reichardt. We also study variation of the game to minimize the classical winning probability.

•Mar 25, 2019•0 citations
Ongoing development and increased accessibility of quantum computing has allowed for broadly replicable demonstrations of previously theoretical formulated quantum games and thought experiments, simulated as well as across different quantum platforms. Quantum pseudo-telepathy (QPT) is one such unintuitive result, where the prior quantum entanglement of states can forego the need for classical communication to successfully complete simultaneously coordinated tasks. The Greenberger-Horne-Zeilinger (GHZ) game is one such demonstration of QPT by posing a particular three-player question game where a quantum strategy utilizing entangled states outperforms the best classical strategy. Through the use of OpenQASM 2.0 and IBM Quantum Platform, the entangled states with winning quantum strategies of the GHZ game are implemented, demonstrating the efficacies of a quantum strategy of 100% probability of winning in contrast to the 75% maximal winning probability of any classical strategy. Potential applications based on this winning quantum strategy of the GHZ game such as zero-knowledge shared authentication are also discussed.
Pseudo-telepathy provides an intuitive way of looking at Bell's inequalities, in which it is often obvious that feats achievable by use of quantum entanglement would be classically impossible. A~two-player pseudo-telepathy game proceeds as follows: Alice and Bob are individually asked a question and they must provide an answer. They are \emph{not} allowed any form of communication once the questions are asked, but they may have agreed on a common strategy prior to the execution of the game. We~say that they \emph{win} the game if the questions and answers fulfil a specific relation. A~game exhibits \emph{pseudo-telepathy} if there is a quantum strategy that makes Alice and Bob win the game for all possible questions, provided they share prior entanglement, whereas it would be impossible to win this game systematically in a classical setting. In~this paper, we show that any two-player pseudo-telepathy game requires the quantum players to share an entangled quantum system of dimension at least~\mbox{3×33 \times 33×3}. This is optimal for two-player games, but the most efficient pseudo-telepathy game possible, in terms of total dimension, involves \emph{three} players who share a quantum system of dimension~\mbox{2×2×22 \times 2 \times 22×2×2}.
We give an 154\dfrac{1}{54}541​ separation between 5-party pseudo-telepathy games and two-local theories. We define the notion of strategy in a k-local theory for a game, and extend the method of Chao and Reichardt. We also study variation of the game to minimize the classical winning probability.