Quantum Nonlocality and Device-Independent Randomness are Robust to Noisy Signaling Channels

• URL: http://arxiv.org/abs/2605.21293v1
• Date: Wed, 20 May 2026 15:25:19 GMT
• Title: Quantum Nonlocality and Device-Independent Randomness are Robust to Noisy Signaling Channels
• Abstract summary: Bell's theorem states that a classical explanation can be ruled out if the devices perform certain measurements on an entangled quantum state.<n>This prompts the question: is quantum nonlocality robust to such imperfections?<n>We show that if a binary channel sends a noisy copy of one party's input to the other before any measurements take place, the answer is yes.
• Score: 0.00304396936267654
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Given a pair of isolated devices that accept random binary inputs and return binary outputs, a user can deduce from the observed data alone if the underlying mechanism can be explained classically. Bell's theorem further states that a classical explanation can be ruled out if the devices perform certain measurements on an entangled quantum state, underpinning the security of cryptographic protocols that are device-independent (DI). For certain protocols, such as those performed in a tight space, it might be difficult to perfectly enforce the non-signaling assumption required in Bell's theorem. This prompts the question: is quantum nonlocality robust to such imperfections? We show that if a binary channel sends a noisy copy of one party's input to the other before any measurements take place, the answer is yes. We completely characterize the vertices and facets of the local polytope in this scenario, and identify Bell inequalities that certify non-signaling quantum correlations. This is possible even when a near perfect copy of the input is sent. We go on to show that the identified inequalities are more robust to depolarizing noise than the Clauser-Horne-Shimony-Holt inequality when certifying DI randomness in this scenario. In addition, we characterize the local polytope when both parties receive a noisy copy of each other's input and make similar conclusions, leaving many new potential Bell inequalities to be explored.

Related papers

• Test of the essential collapse-locality loophole [36.94429692322632]
  Collapse-locality is an untested loophole in the violation of Bell's inequalities.<n>We report an optical Bell experiment which closes the weaker ('essential') form of this loophole regardless the theory of quantum collapse.
  arXiv  Detail & Related papers  (2026-03-26T00:47:32Z)
• When Quantum Nonlocality Does Not Play Dice [3.722125357019147]
  Bell inequality violations are often taken as evidence that quantum nonlocality guarantees intrinsic randomness.<n>We show that there exist nontrivial Bell inequalities that are maximally violated by quantum correlations yet fail to certify randomness for any fixed input pair.<n>We construct maximally nonlocal quantum correlations that are deterministic for every fixed input pair.
  arXiv  Detail & Related papers  (2024-08-07T10:07:39Z)
• A computational test of quantum contextuality, and even simpler proofs of quantumness [43.25018099464869]
  We show that an arbitrary contextuality game can be compiled into an operational "test of contextuality" involving a single quantum device. Our work can be seen as using cryptography to enforce spatial separation within subsystems of a single quantum device.
  arXiv  Detail & Related papers  (2024-05-10T19:30:23Z)
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits [37.84307089310829]
  Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit. Despite their promise, the trainability of these algorithms is hindered by barren plateaus. We present a general Lie algebra that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits.
  arXiv  Detail & Related papers  (2023-09-17T18:14:10Z)
• Nondestructive discrimination of Bell states between distant parties [3.3764180740316543]
  We present a scheme for discriminating an arbitrary Bell state distributed to two distant parties without destroying it. We show that our scheme can surpass classical bounds when applied to practical quantum processor.
  arXiv  Detail & Related papers  (2023-09-02T08:54:34Z)
• Correcting for finite statistics effects in a quantum steering experiment [33.013102271622614]
  We introduce a one-sided device-independent protocol that corrects for apparent signaling effects in experimental probability distributions.<n>Our results show a significantly higher probability of violation than existing state-of-the-art inequalities.<n>This work demonstrates the power of semidefinite programming for entanglement verification and brings quantum networks closer to practical applications.
  arXiv  Detail & Related papers  (2023-05-23T14:39:08Z)
• Experimental certification of more than one bit of quantum randomness in the two inputs and two outputs scenario [0.0]
  We present an experimental realization of recent Bell-type operators designed to provide private random numbers that are secure against adversaries with quantum resources. We use semi-definite programming to provide lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy. Our results demonstrate the first experiment that certifies close to two bits of randomness from binary measurements of two parties.
  arXiv  Detail & Related papers  (2023-03-13T20:42:53Z)
• 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)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• The Binary-Outcome Detection Loophole [0.0]
  I present an intuitive local hidden-variable construction for all no-signalling distributions with two parties and binary outcomes. This provides a lower bound on the detection threshold for quantum measurements in the same scenario tighter than known previously.
  arXiv  Detail & Related papers  (2020-05-07T09:19:27Z)
• Single trusted qubit is necessary and sufficient for quantum realisation of extremal no-signaling correlations [0.2085467441379275]
  We show that quantum statistics can never reproduce an extremal non-local point within the set of no-signaling boxes. We prove a positive result showing that already a single trusted qubit is enough for quantum theory to produce a self-testable extremal point.
  arXiv  Detail & Related papers  (2020-04-30T13:52:01Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.