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.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 SoutheastConMar 22, 20250 citations

Minimum entangled state dimension required for pseudo-telepathy

Gilles Brassard A, 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$ }.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$}.

Quantum Information and ComputationJul 1, 200518 citations

A Primary Quantum Model of Telepathy

Shan Gao

Jan 1, 20171 citation

Minimum entangled state dimension required for pseudo-telepathy

Gilles Brassard A, 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 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 win the game if the questions and answers fulfil a specific relation. A game exhibits 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 3x3. This is optimal for two-player games, but the most efficient pseudo-telepathy game possible, in terms of total dimension, involves three players who share a quantum system of dimension 2x2x2.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 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 win the game if the questions and answers fulfil a specific relation. A game exhibits 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 3x3. This is optimal for two-player games, but the most efficient pseudo-telepathy game possible, in terms of total dimension, involves three players who share a quantum system of dimension 2x2x2.

arXiv:quant-ph/0412136Dec 17, 20040 citations

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