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:quant-ph/0602064 · Quantum Information and Computation

Winning strategies for pseudo-telepathy games using single non-local box

Samir Kunkri, Gouri Sankar Kar, Sibasish Ghosh A, A. Roy

Published May 1, 2007• 0 citations
arXivHTMLPDF

Abstract

Using a single NL-box, a winning strategy is given for the impossible colouring pseudo-telepathy game for the set of vectors having Kochen-Specker property in four dimension. A sufficient condition given regarding the structure of the impossible colouring pseudo-telepathy game for general $d$-dimension. A winning strategy for this game is then described with single use of NL-box.

DOI
10.26421/qic7.4-3

Related papers

Impossible colouring pseudo-telepathy game and non-local box

Samir Kunkri, Guruprasad Kar, Souradip Ghosh +1 more

Here we will discuss a winning strategy of impossible colouring pseudo-telepathy game for the set of vectors having Kochen- Specker property in four dimension with single use of NL-box. Then we discuss some sufficient condition for the winning strategy of impossible colouring pseudo-telepathy game for general $d$-dimension with single use of NL-box.

•Feb 6, 2006•0 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$}.

Quantum Information and Computation•Jul 1, 2005•18 citations

Two Party Pseudo Telepathy Games

Indranil Chakrabarty

In this work we have introduced two party pseudo telepathy games with respective winning conditions. One cannot win these games deterministically by any kind of classical protocols. Interestingly we find out that in quantum world, these winning conditions can be achieved if the players share an entangled state. We also introduced a game which is impossible to win if the players are form classical world, (both probabilistically and deterministically) yet there exists a perfect quantum strategy by following which, one can attain the winning condition of the game.

•Dec 28, 2006•1 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.

•Jan 1, 2004•20 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 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/0412136•Dec 17, 2004•0 citations

Understanding quantum non-locality through pseudo-telepathy game

Samir Kunkri

Usually by quantum non‐locality we mean that quantum mechanics can not be replaced by local realistic theory. On the other hand this nonlocal feature of quantum mechanics can not be used for instantaneous communication and hence it respect Einstein’s special theory of relativity. But still it is not trivial as proved by various quantum information processing using entangled states. Recently there have been studies of hypothetical non‐local system again respecting no‐signalling which is beyond quantum mechanics. Here we study the power of such a hypothetical nonlocal box first suggested by Popescu et.al. in the context of recently suggested pseudo‐telepathy game constructed from a Kochen‐Specker set.

AIP conference proceedings•Jan 1, 2006•0 citations
Using a single NL-box, a winning strategy is given for the impossible colouring pseudo-telepathy game for the set of vectors having Kochen-Specker property in four dimension. A sufficient condition given regarding the structure of the impossible colouring pseudo-telepathy game for general ddd-dimension. A winning strategy for this game is then described with single use of NL-box.
Here we will discuss a winning strategy of impossible colouring pseudo-telepathy game for the set of vectors having Kochen- Specker property in four dimension with single use of NL-box. Then we discuss some sufficient condition for the winning strategy of impossible colouring pseudo-telepathy game for general ddd-dimension with single use of NL-box.
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}.
In this work we have introduced two party pseudo telepathy games with respective winning conditions. One cannot win these games deterministically by any kind of classical protocols. Interestingly we find out that in quantum world, these winning conditions can be achieved if the players share an entangled state. We also introduced a game which is impossible to win if the players are form classical world, (both probabilistically and deterministically) yet there exists a perfect quantum strategy by following which, one can attain the winning condition of the game.
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.
Usually by quantum non‐locality we mean that quantum mechanics can not be replaced by local realistic theory. On the other hand this nonlocal feature of quantum mechanics can not be used for instantaneous communication and hence it respect Einstein’s special theory of relativity. But still it is not trivial as proved by various quantum information processing using entangled states. Recently there have been studies of hypothetical non‐local system again respecting no‐signalling which is beyond quantum mechanics. Here we study the power of such a hypothetical nonlocal box first suggested by Popescu et.al. in the context of recently suggested pseudo‐telepathy game constructed from a Kochen‐Specker set.