Quantum Pseudo-telepathy Games Research Articles

Surpassing the classical limit in magic square game with distant quantum dots coupled to optical cavities

The emergence of quantum technologies is heating up the debate on quantum supremacy, usually focusing on the feasibility of looking good on paper algorithms in realistic settings, due to the vulnerability of quantum systems to myriad sources of noise. In this vein, an interesting example of quantum pseudo-telepathy games that quantum mechanical resources can theoretically outperform classical resources is the Magic Square game (MSG), in which two players play against a referee. Due to noise, however, the unit winning probability of the players can drop well below the classical limit. Here, we propose a timely and unprecedented experimental setup for quantum computation with quantum dots inside optical cavities, along with ancillary photons for realizing interactions between distant dots to implement the MSG. Considering various physical imperfections of our setup, we first show that the MSG can be implemented with the current technology, outperforming the classical resources under realistic conditions. Next, we show that our work gives rise to a new version of the game. That is, if the referee has information on the physical realization and strategy of the players, he can bias the game through filtered randomness, and increase his winning probability. We believe our work contributes to not only quantum game theory, but also quantum computing with quantum dots.

Quantum advice enhances social optimality in three-party conflicting interest games

Quantum pseudo-telepathy games are good examples of explaining the strangeness of quantum mechanics and demonstrating the advantage of quantum resources over classical resources. Most of the quantum pseudo-telepathy games are common interest games, nevertheless conflicting interest games are more widely used to model real world situations. Recently Pappa et al. (Phys. Rev. Lett. 114, 020401, 2015) proposed the first two-party conflicting interest game where quantum advice enhances social optimality. In the present paper we give two new three-party conflicting interest games and show that quantum advice can enhance social optimality in a three-party setting. The first game we propose is based on the famous GHZ game which is a common interest game. The second game we propose is related to the Svetlichny inequality which demonstrates quantum mechanics cannot be explained by the local hidden variable model in a three-party setting.

Quantum advice enhances social optimality in three-party conflicting interest games

Quantum pseudo-telepathy games are good examples of explaining the strangeness of quantum mechanics and demonstrating the advantage of quantum resources over classical resources. Most of the quantu...

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

Quantum pseudo-telepathy (QPT) is a new type of game where the quantum team can win with certainty while the classical one cannot. It means the advantages of quantum participants over classical ones in game. However, there has been no systematic and formal analysis on the QPT game before. Here we present the formal description of the QPT game and the definition of the most simplified QPT. Based on the above definitions, we simplify a famous QPT game, i.e. the Cabllo game. Then, according to some instances, we analyze the minimum best success probability by classical strategies of the two-player QPT, which reflects the advantage of the quantum strategies. Finally, we prove the best success probability by classical strategies for the most simplified QPT is totally related to the number of all possible question combinations.

Distinguishing quantum channels via magic squares game

We study the effect of quantum memory in magic squares game when played in quantum domain. We consider different noisy quantum channels and analyze their influence on the magic squares quantum pseudo-telepathy game. We show that the probability of success can be used to distinguish the quantum channels. It is seen that the mean success probability decreases with increase of quantum noise. Where as the mean success probability increases with increase of quantum memory. It is also seen that the behaviour of amplitude damping and phase damping channels is similar. On the other hand, the behaviour of depolarizing channel is similar to the flipping channels. Therefore, the probability of success of the game can be used to distinguish the quantum channels.

NOISE EFFECTS IN QUANTUM MAGIC SQUARES GAME

In the article we analyse how noisiness of quantum channels can influence the magic squares quantum pseudo-telepathy game. We show that the probability of success can be used to determine characteristics of quantum channels. Therefore the game deserves more careful study aiming at its implementation.

Two-player quantum pseudotelepathy based on recent all-versus-nothing violations of local realism

We introduce two two-player quantum pseudo-telepathy games based on two recently proposed all-versus-nothing (AVN) proofs of Bell's theorem [A. Cabello, Phys. Rev. Lett. 95, 210401 (2005); Phys. Rev. A 72, 050101(R) (2005)]. These games prove that Broadbent and Methot's claim that these AVN proofs do not rule out local-hidden-variable theories in which it is possible to exchange unlimited information inside the same light-cone (quant-ph/0511047) is incorrect.