Quantum Telepathy: A Quantum Technology with Near-Term Applications

TL;DR

This paper gives a concise overview of the different application areas of quantum telepathy and finds that these real-world problems can be modeled as nonlocal games or its generalizations, and can directly solve real-world problems, such as reducing risk in high frequency trading or balancing data loads efficiently in ad hoc networks.

Abstract

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 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 nonlocal games 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 NISQ hardware.

Figures (9)

• Figure 1: A nonlocal game with two parties. Each party $j$ receives input $i_j$ and produces output $o_j$. The parties cannot communicate throughout this process.
• Figure 2: A latency-constrained scenario where non-communication is enforced by relativity. The parties have to produce their outputs after they receive their inputs within a time window shorter than their speed of light delay. Here, $c$ is the speed of light in vacuum.
• Figure 3: A latency-constrained scenario with three parties. The parties have to produce an output after they receive their inputs within a time window longer than the speed of light delay between the left two parties but shorter than that of the right two parties. This allows for communication only between the left two parties.
• Figure 4: A latency-constrained scenario involving two colocated servers engaged in high frequency trading at NYSE and NASDAQ. Trades can be executed within 1 $\mu$s or shorter of a signal, whereas the speed of light delay between the two servers is 188 $\mu$s.
• Figure 5: A physical implementation of a quantum strategy for the HFT scenario where the NYSE and NASDAQ servers are trading stock X and stock Y, respectively. Each server looks for a signal that the correlation between X and Y has flipped signs. This signal determines the measurement settings. M1 and M2 are two quantum memories at the different servers that are in the maximally entangled qubit state $\vert \Phi^+\rangle \coloneqq (\vert 00\rangle+\vert 11\rangle)/\sqrt{2}$, the state used in the optimal quantum strategy for the CHSH game. The corresponding measurement result determines whether to buy or sell.

Theorems & Definitions (3)

• Definition 1
• Definition 2
• Definition 3