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.
We give an $\dfrac{1}{54}$ separation between 5-party pseudo-telepathy games and two-local theories. We define the notion of strategy in a k-local theory for a game, and extend the method of Chao and Reichardt. We also study variation of the game to minimize the classical winning probability.
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 to have a winning strategy for the impossible colouring pseudo-telepathy game for general $d$-dimension, with single use of NL-box, is then described. It is also shown that the magic square pseudo-telepathy game of any size can be won by using just two ebits of entanglement -- for quantum strategy, and by a single NL-box -- for non-local strategy.
Pseudo-telepathy is the most recent form of rejection of locality. Many of its properties have already been discovered: for instance, the minimal entanglement, as well as the minimal cardinality of the output sets, have been characterized. This paper contains two main results. First, we prove that no bipartite pseudo-telepathy game exists, in which one of the partners receives only two questions; as a corollary, we show that the minimal "input cardinality", that is, the minimal number of questions required in a bipartite pseudo-telepathy game, is 3x3. Second, we study the Bell-type inequality …
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-telepathy region to higher noise values. We show that it is possible to reverse the action of a noise channel using semidefinite programming.
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.
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.
We implemented the protocol of entanglement assisted orientation in the space proposed by Brukner et al (quant-ph/0603167). We used min-max principle to evaluate the optimal entangled state and the optimal direction of polarization measurements which violate the classical bound.
We define a family of pseudo-telepathy games using graph states that extends the Mermin games. This family also contains a game used to define a quantum probability distribution that cannot be simulated by any number of PR boxes. We extend this result proving that the probability distribution obtained by the Paley graph state on 13 vertices cannot be simulated by any number of 4-partite non local boxes and that the Paley graph states on more than $k^{2}2^{2k-2}$ vertices provides a probability distribution that cannot be simulated by k-partite nonlocal boxes
Quantum information processing is at the crossroads of physics, mathematics and computer science. It is concerned with that we can and cannot do with quantum information that goes beyond the abilities of classical information processing devices. Communication complexity is an area of classical computer science that aims at quantifying the amount of communication necessary to solve distributed computational problems. Quantum communication complexity uses quantum mechanics to reduce the amount of communication that would be classically required. Pseudo-telepathy is a surprising application of qu…
Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a variety of distributed computational tasks. We speak of pseudo-telepathy when quantum entanglement serves to eliminate the classical need to communicate. In earlier examples of pseudo-telepathy, classical protocols could succeed with high probability unless the inputs were very large. Here we present a simple multi-party distributed problem for which the in…
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 entangled states suffice. In particular, we show that maximally entangled states suffice for weak projection games which we introduce as a relaxation of projection games. Our results also imply that any pseudo-t…
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 communication required to carry out some distributed problems. We speak of pseudo-telepathy when it is able to completely eliminate the need for communication. The matching game is the newest member of the family of pseudo-telepathy games. After introducing a general model for pseudo-telepathy games, we focus on the question what the smallest size of inputs is f…
Imagine that Alice and Bob, unable to communicate, are both given a 16-bit string such that the strings are either equal, or they differ in exactly 8 positions. Both parties are then supposed to output a 4-bit string in such a way that these short strings are equal if and only if the original longer strings given to them were equal as well. It is known that this task can be fulfilled without failure and without communication if Alice and Bob share 4 maximally entangled quantum bits. We show that, on the other hand, they CANNOT win the same game with certainty if they only share classical bits,…
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 distributed computational tasks. Can it be used to eliminate communication altogether? Even though it cannot serve to signal information between remote parties, there are distributed tasks that can be performed without any need for communication, provided the parties share prior entanglement: this is the realm of pseudo-telepathy. One of the earliest uses o…
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 tool called multipartiteness width to investigate which scenarios are harder to decompose and show that there exist graphs generating scenarios with a linear multipartiteness width.
Dzyaloshinskii-Moriya (DM) interaction has been proven to excite entanglement of spin systems, enhancing the capability of realizing various quantum tasks such as teleportation. In this work, we consider the DM interaction -to the best of our knowledge, for the first time in quantum game theory. We study the winning probability of magic square game played with the thermal entangled state of spin models under external magnetic fields and DM interaction. We analytically show that although DM interaction excites the entanglement of the system as expected, it surprizingly reduces the winning proba…
Quantum pseudo-telepathy is an intriguing phenomenon which results from the application of quantum information theory to communication complexity. To demonstrate this phenomenon researchers in the field of quantum communication complexity devised a number of quantum non-locality games. The setting of these games is as follows: the players are separated so that no communication between them is possible and are given a certain computational task. When the players have access to a quantum resource called entanglement, they can accomplish the task: something that is impossible in a classical setti…
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 communication required to carry out some distributed problems. We speak of pseudo-telepathy when it is able to completely eliminate the need for communication. Since it is generally very hard to perfectly implement a quantum winning strategy for a pseudo-telepathy game, quantum players are almost certain to make errors even though they use a winning strategy. Af…
John Bell taught us that quantum mechanics can not be reproduced by non-contextual and local Hidden variable theory. The impossibility of replacing quantum mechanics by non-contextual Hidden Variable Theory can be turned to a impossible coloring pseudo-telepathy game to be played by two distant players. The game can not be won without communication in the classical world. But if the players share entangled state (quantum correlation) the game can be won deterministically using no communication. This again shows that though quantum correlation can not be used for communication, two parties can …
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 quant…
The Mermin-Peres magic square game is a cooperative two-player nonlocal game in which shared quantum entanglement allows the players to win with certainty, while players limited to classical operations cannot do so, a phenomenon dubbed "quantum pseudo-telepathy". The game has a referee separately ask each player to color a subset of a 3x3 grid. The referee checks that their colorings satisfy certain parity constraints that can't all be simultaneously realized. We define a generalization of these games to be played on an arbitrary arrangement of intersecting sets of elements. We characterize ex…
A non-local box is a virtual device that has the following property: given that Alice inputs a bit at her end of the device and that Bob does likewise, it produces two bits, one at Alice's end and one at Bob's end, such that the XOR of the outputs is equal to the AND of the inputs. This box, inspired from the CHSH inequality, was first proposed by Popescu and Rohrlich to examine the question: given that a maximally entangled pair of qubits is non-local, why is it not maximally non-local? We believe that understanding the power of this box will yield insight into the non-locality of quantum mec…
This paper deals with graph colouring games, an example of pseudo-telepathy, in which two provers can convince a verifier that a graph $G$ is $c$-colourable where $c$ is less than the chromatic number of the graph. They win the game if they convince the verifier. It is known that the players cannot win if they share only classical information, but they can win in some cases by sharing entanglement. The smallest known graph where the players win in the quantum setting, but not in the classical setting, was found by Galliard, Tapp and Wolf and has 32,768 vertices. It is a connected component of …
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.
This paper demonstrates and proves that the coordination of actions in a distributed swarm can be enhanced by using quantum entanglement. In particular, we focus on - Global and local simultaneous random walks, using entangled qubits that collapse into the same (or opposite) direction, either random direction or totally controlled simultaneous movements. - Identifying eavesdropping from malicious eavesdroppers aimed at disturbing the simultaneous random walks by using entangled qubits that were sent at random or with predefined bases. - Identifying Byzantine robots or malicious robots that are…
We study the classical and quantum values of one- and two-party linear games, an important class of unique games that generalizes the well-known XOR games to the case of non-binary outcomes. We introduce a ``constraint graph" associated to such a game, with the constraints defining the linear game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation …
Light incident upon molecules trigger fundamental processes in diverse systems present in nature. However, under natural conditions, such as sunlight illumination, it is impossible to assign known times for photon arrival owing to continuous pumping, and therefore, the photo-induced processes cannot be easily investigated. In this work, we theoretically demonstrate that characteristics of sunlight photons such as photon number statistics and spectral distribution can be emulated through quantum entangled photon pair generated with the parametric down-conversion (PDC). We show that the average …
We use Nuclear Magnetic Resonance (NMR) to experimentally generate a bound entangled (more precisely: pseudo bound entangled) state, i.e. a quantum state which is non-distillable but nevertheless entangled. Our quantum system consists of three qubits. We characterize the produced state via state tomography to show that the created state has a positive partial transposition with respect to any bipartite splitting, and we use a witness operator to prove its entanglement.
An experimental verification of the maximally entangled state ensures that the constructed state is close to the maximally entangled state, but it does not guarantee that the state is exactly the same as the maximally entangled state. Further, the entanglement structure is not uniquely determined in general probabilistic theories even if we impose that the local subsystems are fully equal to quantum systems. Therefore, the existence of the maximally entangled state depends on whether the standard entanglement structure is valid. To examine this issue, we introduce pseudo standard entanglement …
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…
Enhancing Sum Capacity via Quantum and No-Signaling Cooperation Between Transmitters
Information & Electronics Research Institute, Korea Advanced Institute of Science and Technology (KAIST)（韩国科学技术院信息与电子研究所）；School of Electrical Engineering, KAIST（韩国科学技术院电气工程学院）
In this work, we experimentally created and characterized a class of qubit-ququart PPT (positive under partial transpose) entangled states using three nuclear spins on an nuclear magnetic resonance (NMR) quantum information processor. Entanglement detection and characterization for systems with a Hilbert space dimension $\ge 2 \otimes 3$ is nontrivial since there are states in such systems which are both PPT as well as entangled. The experimental detection scheme that we devised for the detection of qubit-ququart PPT entanglement was based on the measurement of three Pauli operators with high …
Thermal (or pseudo-thermal) radiation has been recently proposed for imaging and interference types of experiments to simulate entangled states. We report an experimental study on the momentum correlation properties of a pseudo-thermal field in the photon counting regime. The characterization and understanding of such a light source in the context of two photon physics, especially its similarities and differences compared to entangled two-photon states, is useful in gaining knowledge of entanglement and may help us to assess the real potential of applications of chaotic light in this context.
Entangled states of pseudoscalar mesons represent a very interesting tool for studying foundations of quantum mechanics, e.g. for testing Bell inequalities. Recently, they also emerged as a test bench for quantum information protocols. On the other hand, from a quantum information point of view, the characterization of the distance between two quantum states is a topic of the utmost importance. In this letter, with the purpose of providing a useful tool for further investigations, we address the problem of which distance allows a better discrimination between density matrices appearing in pseu…
We demonstrate how to discriminate two non-orthogonal, entangled quantum state which are slightly different from each other by using pseudo-Hermitian system. The positive definite metric operator which makes the pseudo-Hermitian systems fully consistent quantum theory is used for such a state discrimination. We further show that non-orthogonal states can evolve through a suitably constructed pseudo-Hermitian Hamiltonian to orthogonal states. Such evolution ceases at exceptional points of the pseudo-Hermitian system.
Quantum dot spin valves are characterized by exchange fields which induce spin precession and generate current spin resonances even in absence of spin splitting. Analogous effects have been studied in double quantum dots, in which the orbital degree of freedom, the pseudospin, replaces the spin in the valve configuration. We generalize, now, this setup to allow for arbitrary spin and orbital polarization of the leads, thus obtaining an even richer variety of current resonances, stemming from the precession dynamics of entangled spin and pseudospin. We observe for both vectors a delicate interp…
Using polarization-entangled photons from spontaneous parametric downconversion, we have implemented Ekert's quantum cryptography protocol. The near-perfect correlations of the photons allow the sharing of a secret key between two parties. The presence of an eavesdropper is continually checked by measuring Bell's inequalities. We investigated several possible eavesdropper strategies, including pseudo-quantum non-demolition measurements. In all cases, the eavesdropper's presence was readily apparent. We discuss a procedure to increase her detectability.
Closed timelike curves are striking predictions of general relativity allowing for time-travel. They are afflicted by notorious causality issues (e.g. grandfather's paradox). Quantum models where a qubit travels back in time solve these problems, at the cost of violating quantum theory's linearity - leading e.g. to universal quantum cloning. Interestingly, linearity is violated even by open timelike curves (OTCs), where the qubit does not interact with its past copy, but is initially entangled with another qubit. Non-linear dynamics is needed to avoid violating entanglement monogamy. Here we p…
The model of a quantum-optical device for a conditional preparation of entangled states from input mixed states is presented. It is demonstrated that even thermal or pseudo-thermal radiation can be entangled in such a way, that Bell-inequalities are violated.
Measurement devices could benefit from entangled correlations to yield a measurement sensitivity approaching the physical Heisenberg limit. Building upon previous magnetometric work using pseudo-entangled spin states in solution-state NMR, we present two conceptual advancements to better prepare and interpret the pseudo-entanglement resource as well as the use of a 13-spin cat state to measure the local magnetic field with a sensitivity beyond the standard quantum limit.
In this article, we investigate how quantum correlations behave for the so-called Werner and pseudo-pure families of states. The latter refers to states formed by mixing any pure state with the totally mixed state. We derive closed expressions for the Quantum Discord (QD) and the Relative Entropy of Quantumness (REQ) for these families of states. For Werner states, the classical correlations are seen to vanish in high dimensions while the amount of quantum correlations remain bounded and become independent of whether or not the the state is entangled. For pseudo-pure states, nearly the opposit…
Inserting a lossy dielectric into one arm of an interference experiment acts in many ways like a measurement. If two entangled photons are passed through the interferometer, a certain amount of information is gained about which path they took, and the interference pattern in a coincidence count measurement is suppressed. However, by inserting a second dielectric into the other arm of the interferometer, one can restore the interference pattern. Two of these pseudo-measurements can thus cancel each other out. This is somewhat analogous to the proposed quantum eraser experiments.
We show that the global infinitesimal change in the multi-particle pure product state gives rise to an entangled state. This suggests that even if there is no interaction present between the subsystems, i.e., at each time instant the state is non-entangled, the tangent vector is typically entangled. Since the tangent space vectors tell the state-space vectors how to change this implies that quantum entanglement is necessary for motion or change in general. This is truly a `hidden power' of quantum entanglement. During quantum computation even though at each time instant the state is not entang…
Two-photon interference and "ghost" imaging with entangled light have attracted much attention since the last century because of the novel features such as non-locality and sub-wavelength effect. Recently, it has been found that pseudo-thermal light can mimic certain effects of entangled light. We report here the first observation of two-photon interference with true thermal light.
