In this Letter we show that communication when restricted to a single information carrier (i.e., single particle) and finite speed of propagation is fundamentally limited for classical systems. On the other hand, quantum systems can surpass this limitation. We show that communication bounded to the exchange of a single quantum particle (in superposition of different spatial locations) can result in "two-way signaling," which is impossible in classical physics. We quantify the discrepancy between classical and quantum scenarios by the probability of winning a game played by distant players. We generalize our result to an arbitrary number of parties and we show that the probability of success is asymptotically decreasing to zero as the number of parties grows, for all classical strategies. In contrast, quantum strategy allows players to win the game with certainty.
In this Letter we show that communication when restricted to a single information carrier (i.e., single particle) and finite speed of propagation is fundamentally limited for classical systems. On the other hand, quantum systems can surpass this limitation. We show that communication bounded to the exchange of a single quantum particle (in superposition of different spatial locations) can result in "two-way signaling," which is impossible in classical physics. We quantify the discrepancy between classical and quantum scenarios by the probability of winning a game played by distant players. We generalize our result to an arbitrary number of parties and we show that the probability of success is asymptotically decreasing to zero as the number of parties grows, for all classical strategies. In contrast, quantum strategy allows players to win the game with certainty.
Abstract Superposition of two or more states is one of the most fundamental concepts of quantum mechanics and provides a basis for several advantages offered by quantum information processing. This work reports the experimental demonstration of two‐way communication between two distant parties that can exchange only a single particle once, an impossible task in classical physics. This is achieved through preparation of a single photon in a coherent superposition of the two parties' locations. Furthermore, it is shown that this concept allows the parties to perform secure and anonymous quantum communication employing one particle per transmitted bit. These important features can lead to the realization of new quantum communication schemes, which are simultaneously anonymous, secure, and resource‐efficient.
The main objective of this thesis is to explore spatial superposition as a novel resource for quantum communication. In classical physics, at any instant of time, information flows in one direction only, i.e. an information carrier transmits the message from the sender to the receiver, but not vice versa. In contrast, quantum physics opens up the possibility of putting information carriers in spatial superposition which in turn enables simultaneous bi-directional transmission of information between the sender and the receiver. Our aim is explore this possibility to arrive at new communication tasks that cannot be accomplished within classical physics, thus quantifying the use of quantum superposition as a resource for communication. More precisely, we aim at classifying simple communication protocols (e.g. involving the exchange of information between several players, with restrictions on the available resources) by means of Bell-like inequalities, which set precise limits to classical communication. On the other hand, the classification of these inequalities provides a natural operational framework to show that quantum information carriers in spatial superposition are a genuine resource for non-classical communication (i.e. by explicitly violating the bounds imposed by Bell-like inequalities).
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.
Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N -player situations by simply allowing N -partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.
A number of recent studies have focused on novel features in game theory when the games are played using quantum mechanical toolbox (entanglement, unitary operators, measurement). Researchers have concentrated in two-player-two strategy, 2x2, dilemma containing classical games, and transferred them into quantum realm showing that in quantum pure strategies dilemmas in such games can be resolved if entanglement is distributed between the players armed with quantum operations. Moreover, it became clear that the players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2x2 games, it became generally accepted that quantum versions can be easily extended to N-player situations by simply allowing N-partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.
Experimental tests of shallow-circuit quantum advantage require explicit classical bounds at finite circuit sizes. We refine the finite-size classical soundness bound of Aasnaess's graph-distributed construction to depend linearly on the number of players. Combined with standard disjoint-player repetition, this gives a two-round test on a single processor for any finite nonlocal game with a finite-dimensional perfect quantum strategy and classical winning probability γ<1, with arbitrarily small classical success. The method is based on playing m copies with disjoint players and teleporting each player's register to a uniformly random one of N sites before the questions are revealed. Each answer bit of a depth-D, fan-in-K classical response with fixed wiring depends on at most KD question wires, making cross-player dependencies unlikely when N is large. The quantum implementation has constant depth per round and wins with certainty. A classical device wins with probability at most γm+O(mKD/N), which vanishes as O(logN/N) for m=⌈log1/γN⌉ at fixed D and K. We present an explicit proposal for an experimentally testable quantum advantage with 99 qubits.