Related papers: Winning strategies for pseudo-telepathy games usin…
We analyze the impact of the Unruh effect on the quantum Magic Square game. We find the values of acceleration parameter for which quantum strategy yields higher players' winning probability than classical strategy.
A perfect strategy is one that allows the mutually in-communicated players of a nonlocal game to win every trial of the game. Perfect strategies are basic tools for some fundamental results in quantum computation and crucial resources for…
Bipartite perfect quantum strategies (BPQSs) allow two players isolated from each other to win every trial of a nonlocal game. BPQSs have crucial roles in recent developments in quantum information and quantum computation. However, only few…
Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum information processing can be used to reduce the amount of…
We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games…
Entanglement is perhaps the most non-classical manifestation of quantum mechanics. Among its many interesting applications to information processing, it can be harnessed to reduce the amount of communication required to process a variety of…
Quantum pseudo-telepathy games, such as the Mermin-Peres magic square and the doily game, theoretically allow players to win with unit probability when using entangled quantum strategies. We quantitatively characterize the quantum advantage…
Local simultaneous state discrimination (LSSD) is a recently introduced problem in quantum information processing. Its classical version is a non-local game played by non-communicating players against a referee. Based on a known probability…
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…
In this work we have introduced two party games with respective winning conditions. One cannot win these games deterministically in the classical world if they are not allowed to communicate at any stage of the game. Interestingly we find…
Analyzing pseudo-telepathy graph games, we propose a way to build contextuality scenarios exhibiting the quantum supremacy using graph states. We consider the combinatorial structures that generate equivalent scenarios. We introduce a new…
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…
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…
The behavior of entangled quantum systems can generally not be explained as being determined by shared classical randomness. In the first part of this paper, we propose a simple game for n players demonstrating this non-local property of…
It is known that Mermin-Peres like proofs of quantum contextuality can furnish non-local games with a guaranteed quantum strategy, when classically no such guarantee can exist. This phenomenon, also called quantum pseudo-telepathy, has been…
This paper investigates the powers and limitations of quantum entanglement in the context of cooperative games of incomplete information. We give several examples of such nonlocal games where strategies that make use of entanglement…
Entangled quantum systems can exhibit correlations that cannot be simulated classically. For historical reasons such correlations are called "Bell inequality violations." We give two new two-player games with Bell inequality violations that…
Quantum telepathy is the concept of using quantum entanglement to solve real-world problems involving decision coordination between parties with restricted communication. One possible reason for this restriction is a latency constraint:…
We study a cooperative game in which each member of a team of $N$ players, wearing coloured hats and situated at the vertices of a cycle graph $C_N$, is guessing their own hat colour merely on the basis of observing the hats worn by their…
We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions…