Pith. sign in

REVIEW 3 cited by

Quantum Nonlocality under Latency Constraints

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 2510.26349 v2 pith:5DYLIT6H submitted 2025-10-30 quant-ph

Quantum Nonlocality under Latency Constraints

classification quant-ph
keywords partieslatencybellconstraintquantumcommunicatecorrelationsdelay
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. Entanglement improves coordination in distributed systems

    quant-ph 2026-02 conditional novelty 6.0

    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.

  2. Operational criteria for quantum advantage in latency-constrained nonlocal games

    quant-ph 2026-04 unverdicted novelty 5.0

    A framework with operational criteria and a trapped-atom hardware proposal for achieving statistically significant quantum advantage in latency-constrained nonlocal games.

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

    quant-ph 2026-03 conditional novelty 4.0

    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 ...