A pseudo-telepathy game is a nonlocal game which can be won with probability one using some finite-dimensional quantum strategy but not using a classical one. Our central question is whether there exist two-party pseudo-telepathy games which cannot be won with probability one using a maximally entangled state. Towards answering this question, we develop conditions under which maximally entangle...

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 a...

Here we will discuss a winning strategy of impossible colouring pseudo-telepathy game for the set of vectors having KochenSpecker property in four dimension with single use of NLbox. 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.

In an automated online telepathy test, each participant had four senders, two actual and two virtual, generated by the computer. In a series of 12 30-sec. trials, the computer selected one of the senders at random and asked him to write a message to the subject. After 30 sec., the participant was asked to guess who had written a message. After the computer had recorded his guess, it sent him th...

We study the possibility of reversing an action of a quantum channel. Our principal objective is to find a specific channel that reverses as accurately as possible an action of a given quantum channel. To achieve this goal we use semidefinite programming. We show the benefits of our method using the quantum pseudo-telepathy Magic Square game with noise. Our strategy is to move the pseudo-telepa...