Quantum Nonlocality under Latency Constraints

• URL: http://arxiv.org/abs/2510.26349v1
• Date: Thu, 30 Oct 2025 10:56:35 GMT
• Title: Quantum Nonlocality under Latency Constraints
• Abstract summary: Bell inequality violation is the phenomenon where multiple non-communicating parties can exhibit correlations using quantum resources.<n>We introduce latency-constrained games, a mathematical framework that extends nonlocal games to the setting where a subset of parties can communicate.<n>The notion of latency-constrained games can have real-world applications, including high frequency trading, distributed computing, computer architecture, and distributed control systems.
• Score: 11.348817263501779
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bell inequality violation is the phenomenon where multiple non-communicating parties can exhibit correlations using quantum resources that are impossible if they can only use classical resources. One way to enforce non-communication is to apply a latency constraint: the parties must all produce outputs after they receive their inputs within a time window shorter than the speed of light delay between any pair of parties. If this latency constraint is relaxed so that a subset of the parties can communicate, we can obtain a new set of inequalities on correlations that extends Bell inequalities in a very natural way. Moreover, with this relaxed latency constraint, we can also have quantum communication between a subset of parties and thereby achieve possible quantum violations of these new inequalities. We ultimately wish to answer the fundamental question: "What are the physically realizable correlations between multiple parties under varying latency constraints?" To answer this question, we introduce latency-constrained games, a mathematical framework that extends nonlocal games to the setting where a subset of parties can communicate. The notion of latency-constrained games can have real-world applications, including high frequency trading, distributed computing, computer architecture, and distributed control systems.

Related papers

• Quantum Telepathy: A Quantum Technology with Near-Term Applications [9.475551090399671]
  Quantum telepathy is the concept of using quantum entanglement to solve real-world problems.<n>In this paper we give a concise overview of the different application areas of quantum telepathy.<n>We find that these real-world problems can be modeled as nonlocal games or its generalizations.
  arXiv  Detail & Related papers  (2026-03-11T15:28:52Z)
• Composable simultaneous purification: when all communication scenarios reduce to spatial correlations [1.4788776577018314]
  Non-signalling state assemblages can always be simultaneously purified.<n>We extend this simultaneous purification inspired result to all multipartite communication schemes.<n>Our main contribution is to establish that arbitrary compositions of non-signalling assemblages cannot escape the standard spatial quantum Bell correlations set.
  arXiv  Detail & Related papers  (2026-01-08T17:48:56Z)
• Coordinating Decisions via Quantum Telepathy [2.7209037611082327]
  We present a conceptual framework for applying quantum telepathy to real-world problems.<n>In general, the problems involve multiple parties making local observations that need to coordinate their decisions but are unable to communicate.
  arXiv  Detail & Related papers  (2024-07-31T16:18:15Z)
• Bell inequalities with overlapping measurements [52.81011822909395]
  We study Bell inequalities where measurements of different parties can have overlap. This allows to accommodate problems in quantum information. The scenarios considered show an interesting behaviour with respect to Hilbert space dimension, overlap, and symmetry.
  arXiv  Detail & Related papers  (2023-03-03T18:11:05Z)
• Limits of Fault-Tolerance on Resource-Constrained Quantum Circuits for Classical Problems [16.56157299018674]
  We show that noise thresholds obtained from existing bounds do not apply to a simple fault-tolerant implementation of the Deutsch-Jozsa algorithm. We characterize the fundamental limit of fault-tolerant quantum circuits with classical inputs and outputs under resource constraint-induced noise models.
  arXiv  Detail & Related papers  (2023-01-05T17:10:16Z)
• Entangled Rendezvous: A Possible Application of Bell Non-Locality For Mobile Agents on Networks [0.0]
  We analyze, how Bell non-locality can be used by asymmetric location-aware agents trying to rendezvous on a finite network with a limited number of steps. Our results show that for cubic graphs and cycles it is possible to gain an advantage by allowing the agents to use assistance of entangled quantum states.
  arXiv  Detail & Related papers  (2022-07-28T23:04:48Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Stochastic bandits with arm-dependent delays [102.63128271054741]
  We propose a simple but efficient UCB-based algorithm called the PatientBandits. We provide both problems-dependent and problems-independent bounds on the regret as well as performance lower bounds.
  arXiv  Detail & Related papers  (2020-06-18T12:13:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.