Pith. sign in

REVIEW 5 cited by

Coordinating Decisions via Quantum Telepathy

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.21723 v3 pith:OAMXAH27 submitted 2024-07-31 quant-ph

classification quant-ph
keywords quantumadvantageinequalitytelepathybellpossibleproblemsviolation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

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 $\textit{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 $\text{BQP}\neq\text{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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum Nonlocality under Latency Constraints

    quant-ph 2025-10 conditional novelty 7.0 of 10

    Relaxing the light-speed-delay constraint so a subset of parties can communicate produces new Bell-type bounds, and quantum communication can beat classical bounds in games where the strict Bell scenario cannot.

  2. Space-time Peer-to-Peer Distribution of Multi-party Entanglement for Any Quantum Network

    quant-ph 2024-12 conditional novelty 7.0 of 10

    A peer-to-peer protocol, P2PGSD, distributes arbitrary graph states over quantum networks, with hardness proofs and simulations showing up to 50% resource savings for sparse graphs.

  3. Entanglement improves coordination in distributed systems

    quant-ph 2026-02 conditional novelty 6.0 of 10

    For a two-server queue with paired arrivals and a convex baseline-throughput function, entanglement-assisted routing can Pareto-dominate every classical communication-free routing strategy.

  4. Quantum Telepathy: A Quantum Technology with Near-Term Applications

    quant-ph 2026-03 conditional novelty 4.0 of 10

    Quantum telepathy—using entanglement to beat Bell inequalities in communication-restricted coordination—is reviewed as a near-term quantum technology, but the paper is an overview of the authors' prior results rather ...

  5. The vast world of quantum advantage

    quant-ph 2025-08 conditional novelty 4.0 of 10

    Assuming quantum computers are strictly more powerful than classical ones, the problem of deciding whether a given quantum circuit beats a specific classical simulation heuristic is solvable by quantum computers but n...

Pith tools