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: some pairs of parties do not have enough time to communicate with each other before they have to produce their outputs. Example scenarios include high frequency trading and distributed systems. Another reason is physical or operational isolation: for some pairs of parties, there is an obstacle to communication. Example scenarios include locating a stray traveler by a rescue team and coordination within a network where nodes are owned by competing firms. In this paper we give a concise overview of the different application areas of quantum telepathy. We find that these real-world problems can be modeled as a nonlocal game or its generalizations. We also discuss possible physical implementations. Quantum telepathy guarantees a quantum advantage via Bell's theorem and can directly solve real-world problems, such as reducing risk in high frequency trading or balancing data loads efficiently in ad hoc networks. Moreover, this quantum advantage can be physically realized with existing or near-term quantum hardware.
Journal reference
Chinese Journal of Quantum Electronics, 2026, 43(4): 524-538
18 pages, 9 figures, v2 incorporates revisions in response to peer review of the published Chinese version and adds references that postdate v1, v3 updates citations
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: some pairs of parties do not have enough time to communicate with each other before they have to produce their outputs. Example scenarios include high frequency trading and distributed systems. Another reason is physical or operational isolation: for some pairs of parties, there is an obstacle to communication. Example scenarios include locating a stray traveler by a rescue team and coordination within a network where nodes are owned by competing firms. In this paper we give a concise overview of the different application areas of quantum telepathy. We find that these real-world problems can be modeled as a nonlocal game or its generalizations. We also discuss possible physical implementations. Quantum telepathy guarantees a quantum advantage via Bell's theorem and can directly solve real-world problems, such as reducing risk in high frequency trading or balancing data loads efficiently in ad hoc networks. Moreover, this quantum advantage can be physically realized with existing or near-term quantum hardware.
Quantum telepathy is the phenomenon where two non-communicating parties can exhibit correlated behaviors that are impossible to achieve using classical resources. This is also known as Bell inequality violation and is made possible by quantum entanglement. In this work, we present a conceptual framework for applying quantum telepathy to real-world problems. In general, the problems involve multiple parties making local observations that need to coordinate their decisions but are unable to communicate. We argue this inability is actually quite prevalent in the modern era where the decision-making timescales of computer processors are so short that the speed of light delay is appreciable in comparison. We highlight the example of high-frequency trading (HFT), where trades are made at microsecond timescales, but the speed of light delay between different stock exchanges are on the order of 100 microseconds to 10 milliseconds. Due to the maturity of Bell inequality violation experiments, experimental realization of quantum telepathy schemes that can attain a quantum advantage for real-world problems is already almost immediately possible. We demonstrate this by conducting a case study for a concrete HFT scenario that gives rise to a generalization of the CHSH game and evaluate different possible physical implementations for achieving a quantum advantage. It is well known that Bell inequality violation is a rigorous mathematical proof of a quantum advantage over any classical strategy and does not need any complexity-theoretic assumptions such as BQP=BPP. Moreover, fault tolerance is not necessary to realize a quantum advantage: for example, violating the CHSH inequality only requires single-qubit operations on two entangled physical qubits.
Abstract. 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 quantum information processing to communication complexity. Thanks to entanglement, perhaps the most nonclassical manifestation of quantum mechanics, two or more quantum players can accomplish a distributed task with no need for communication whatsoever, which would be an impossible feat for classical players. After a detailed overview of the principle and purpose of pseudo-telepathy, we present a survey of recent and no-so-recent work on the subject. In particular, we describe and analyse all the pseudo-telepathy games currently known to the authors. 1.
Coordination is a fundamental primitive in communication and information theory, in which distributed systems must collectively generate correlated behavior rather than merely exchange messages. In quantum networks, the nature of entanglement, quantum measurements, and nonclassical correlations introduces coordination possibilities unavailable classically. This article reviews recent advances in coordination over classical and quantum communication networks, focusing on empirical and strong coordination in multi-user settings.
We consider the implications of coordination for nonlocal games, showing how it provides a natural framework for understanding the correlations that enable spatially separated players to improve their probability of winning. We present a unified framework for coordination using classical or quantum communication and pre-shared correlation resources. The review covers simulation of both entanglement and separable correlations across a variety of network architectures, including two-node, cascade, broadcast, and multiple-access networks. We study the operational differences between empirical and strong coordination, and the tradeoffs between communication and correlation resources, such as pre-shared randomness and entanglement.
Coordination plays a major role in device-independent quantum key distribution (DI-QKD) schemes, in which parties can generate a secret key even if the devices used in the process have been prepared by an adversary. Furthermore, we examine the role of coordination in quantum repeaters, where distributed entanglement serves as a resource for long-distance quantum communication. The review highlights connections between coordination theory and applications such as distributed quantum systems, quantum internet architectures, and future communication networks.
Bell inequalities are bounds on the correlations between different parties obeying a local hidden variable theory. Here, "local" refers to spacetime locality: the parties cannot communicate their inputs because they must produce their outputs faster than the speed-of-light delay between them. In other words, the parties must satisfy a certain latency constraint. In this work, we explicitly incorporate spacetime locality into the formulation of Bell inequalities by imposing such a latency constraint. When the latency constraint is sufficiently tight such that no parties can communicate, this becomes a standard Bell scenario. When the latency constraint is relaxed such that a subset of the parties can communicate, we no longer have a Bell scenario, but we can again find a divide between classical and quantum behaviors. Hence, we observe that the classical-quantum gap should actually be a function of time. To study these more general scenarios, we introduce the mathematical framework of latency-constrained games, which models time-evolving input and output processes for spatially separated parties subject to finite communication speeds. This framework allows us to systematically study the weirdness of quantum mechanics in the "low-latency regime" where the speed-of-light delay is non-negligible. Latency-constrained games can describe real-time decision-making in real-world settings that are latency-sensitive, such as high-frequency trading and distributed systems, and can reveal the utility of quantum correlations in these settings.
Remote entanglement enables coordinated decision making without communication and produces correlations beyond those achievable by any classical strategy, representing a practical quantum advantage in time-critical distributed decision-making problems. However, existing analyses of quantum-classical gaps in such latency-constrained tacit coordination (LCTC) have focused on idealized models that neglect the finite stationary window of the LCTC, finite operation times, and limited entanglement generation rates, leaving fundamental constraints unaccounted for. In this work, we develop a comprehensive framework to quantitatively analyze quantum advantage in LCTC that explicitly incorporates finite-duration and finite-rate operations, as well as generalized utility structures with a limited stationary window. These advances are made possible by adapting statistical certification methods for nonlocal games to the decision-making scenarios of LCTC, identifying operational criteria that must be satisfied by the hardware implementations to realize quantum advantage with sufficient statistical significance. To meet the stringent criteria, we propose time-multiplexed, event-ready operations of cavity-assisted trapped-atom quantum network nodes that provide a continuous stream of entangled qubit pairs, with decision latencies of a microsecond and decision rates of 8×103s−1 per channel for a representative metropolitan-scale 50-km fiber network to keep up with the fast-changing environment, such as financial markets and electric grid networks. These results bridge the gap between the theoretical notions of the quantum-classical gap in nonlocal games and concrete implementations that meet the stringent operational criteria for achieving robust quantum advantage in realistic coordination tasks.
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 setting. To an observer who is unfamiliar with the laws of quantum mechanics it seems that the players employ some sort of telepathy; that is, they somehow exchange information without sharing a communication channel. This paper provides a formal framework for specifying, implementing, and analysing quantum non-locality games.