Violating a Bell Inequality: What to Do When You Lose Your Quantum System

• URL: http://arxiv.org/abs/2609.12604v1
• Date: Fri, 11 Sep 2026 09:00:29 GMT
• Title: Violating a Bell Inequality: What to Do When You Lose Your Quantum System
• Abstract summary: The detection loophole is a well-known loophole in Bell nonlocality motivated by the inefficiency of detectors used in Bell experiments.<n>This paper shows how to choose such a fallback strategy for general Bell inequalities with respect to different efficiencies $$ to maximize the possible violation.
• Score: 20.256816753829465
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The detection loophole is a well-known loophole in Bell nonlocality motivated by the inefficiency of detectors used in Bell experiments. However, this inefficiency is actually a ubiquitous feature of any photonic platform for quantum networks since photons are readily absorbed by the surrounding environment. When the quantum system, usually a photon, is lost, what should the parties output? The most natural choice is to fall back to a deterministic strategy where each party produces an output via a function of her local input. In this paper, we study how to choose such a fallback strategy for general Bell inequalities with respect to different efficiencies $η$ to maximize the possible violation. We mathematically prove that for the CHSH inequality, there exists a fallback strategy that is optimal for all $η$. However, in general, we find that the optimal fallback strategy can vary with $η$, sometimes in surprising ways. For example, we find an example of a Bell inequality where the optimal fallback strategy near the threshold efficiency is not an optimal deterministic strategy in the lossless setting. Our results can reduce the efficiency requirements for closing the detection loophole and thus are useful for applications of Bell inequality violation, such as quantum telepathy or device-independent quantum key distribution.

Related papers

• Learning Not to Optimize: Physics-Informed Action-Space Reshaping for Intent-Based Network Control [50.46501177871741]
  We show that LNOQRD reduces small-instance candidates by $75.9%$ while retaining $90.8%$ near-oracle coverage.<n>Experiments show that LNOQRD achieves the highest utility and intent satisfaction, the lowest hard-law violation and post-generation latency.
  arXiv  Detail & Related papers  (2026-08-02T00:27:01Z)
• Optimizing and Certifying Multipartite Permutationally Invariant Bell Inequalities [2.4545951785034075]
  We develop a method for constructing and certifying permutationally invariant Bell inequalities using only one- and two-body correlators.<n>We optimize the ratio of the quantum value to the classical bound for these families in the large-$N$ limit.<n>For the broad class of Bell inequalities studied here, the infinite-$N$ ratios take simple rational values for finite $m$ and converge to $coth(1)$ as $mtoinfty$.
  arXiv  Detail & Related papers  (2026-07-09T13:21:09Z)
• Optimizing quantum violation for multipartite facet Bell inequalities [2.4545951785034075]
  Nonlocality shapes quantum correlations, revealed through the violation of Bell inequalities.<n>In multipartite systems, characterizing the local polytope quickly becomes an intractable task as the system size increases.<n>We propose a gradient-based method for this optimization. Numerical results indicate that local maxima of this ratio typically correspond to facet Bell inequalities of the local polytope.
  arXiv  Detail & Related papers  (2025-11-10T19:00:02Z)
• Self-testing tilted strategies for maximal loophole-free nonlocality [1.099532646524593]
  Quantum strategies attain the maximal loophole-free nonlocality in the presence of inefficient detectors.<n>We show that the strategies that maximally violate the doubly-tilted versions of Clauser-Horne-Shimony-Holt inequality are unique up to local isometries.
  arXiv  Detail & Related papers  (2024-05-14T16:31:06Z)
• Generalized Hybrid Search and Applications to Blockchain and Hash Function Security [50.16790546184646]
  We first examine the hardness of solving various search problems by hybrid quantum-classical strategies. We then construct a hybrid quantum-classical search algorithm and analyze its success probability.
  arXiv  Detail & Related papers  (2023-11-07T04:59:02Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Exponentially decreasing critical detection efficiency for any Bell inequality [0.34771439623170125]
  We propose a method for reducing the critical detection efficiency of any Bell inequality to arbitrary low values. The proposed method is based on the introduction of penalized $N$-product (PNP) Bell inequalities. The strength of our method is illustrated with a detailed study of the PNP Bell inequalities resulting from the Clauser-Horne-Shimony-Holt inequality.
  arXiv  Detail & Related papers  (2022-04-25T15:32:53Z)
• Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus [55.2480439325792]
  Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
  arXiv  Detail & Related papers  (2022-02-10T18:59:52Z)
• Detecting many-body Bell non-locality by solving Ising models [0.0]
  We show that an arbitrary set of quantum data is compatible with a local theory, if not, it delivers a many-body Bell inequality violated by the quantum data. We use our approach to unveil new many-body Bell inequalities, violated by suitable measurements on paradigmatic quantum states.
  arXiv  Detail & Related papers  (2020-04-16T17:40:04Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Using Randomness to decide among Locality, Realism and Ergodicity [91.3755431537592]
  An experiment is proposed to find out, or at least to get an indication about, which one is false. The results of such experiment would be important not only to the foundations of Quantum Mechanics.
  arXiv  Detail & Related papers  (2020-01-06T19:26:32Z)

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.