Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.12604

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

Xinyu Xu, Yuqing Li, Mingze Xu, Dawei Ding

quant-phSubmitted Sep 11, 2026• Announced Sep 14, 2026• 0 citations
arXivHTMLPDF

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.

Comments
37 pages, 9 figures

Related papers

The binary-outcome detection loophole

Thomas Cope

Abstract The detection loophole problem arises when quantum devices fail to provide an output for some runs. If treating these devices in a device-independent manner, failure to include the unsuccessful runs in the output statistics can lead to an adversary falsifying security i.e. Bell inequality violation. If the devices fail with too high frequency, known as the detection threshold, then no security is possible, as the full statistics cannot violate a Bell inequality. In this work we provide an intuitive local hidden-variable strategy that the devices may use to falsify any two-party, binary-outcome no-signalling distribution up to a threshold of 2(m A + m B − 8)/(m A m B − 16), where m A, m B refer to the number of available inputs choices to the two parties. This value is the largest analytically predicted lower bound for no-signalling distributions. We strongly conjecture it gives the true detection threshold for m A = m B, and for computationally tractable scenarios we provide the Bell inequality which verifies this. We also prove that a non-trivial detection threshold remains, even when allowing one party an arbitrary number of input choices.

arXiv:2005.03344•New Journal of Physics•Jul 1, 2021•1 citation

More nonlocality with less entanglement in Clauser-Horne-Shimony-Holt experiments using inefficient detectors

Daniel Dilley, Eric Chitambar

It is well-known that in certain scenarios weakly entangled states can generate stronger nonlocal effects than their maximally entangled counterparts. In this paper, we consider violations of the Clauser-Horne-Shimony-Holt (CHSH) inequality when one party has inefficient detectors, a scenario known as an asymmetric Bell experiment. For any fixed detection efficiency, we derive a simple upper bound on the entanglement needed to violate the inequality by more than some specified amount $\ensuremath{\kappa}\ensuremath{\ge}0$. When $\ensuremath{\kappa}=0$, the amount of entanglement in all states violating the inequality goes to zero as the detection efficiency approaches $50%$ from above. We finally consider the scenario in which detection inefficiency arises for only one choice of local measurement. In this case, it is shown that the CHSH inequality can always be violated for any nonzero detection efficiency and any choice of noncommuting measurements.

arXiv:1803.07747•Physical Review A•Jun 8, 2018•8 citations

Quantum Nonlocality with Arbitrary Limited Detection Efficiency

Gilles Pütz, Anthony Martin, Nicolas Gisin +3 more

The demonstration and use of nonlocality, as defined by Bell's theorem, rely strongly on dealing with nondetection events due to losses and detectors'inefficiencies. Otherwise, the so-called detection loophole could be exploited. The only way to avoid this is to have detection efficiencies that are above a certain threshold. We introduce the intermediate assumption of limited detection efficiency, that is, in each run of the experiment, the overall detection efficiency is lower bounded by η(min)>0. Hence, in an adversarial scenario, the adversaries have arbitrary large but not full control over the inefficiencies. We analyze the set of possible correlations that satisfy limited detection locality and show that they necessarily satisfy some linear Bell-like inequalities. We prove that quantum theory predicts the violation of one of these inequalities for all η(min)>0. Hence, nonlocality can be demonstrated with arbitrarily small limited detection efficiencies. We validate this assumption experimentally via a twin-photon implementation in which two users are provided with one photon each out of a partially entangled pair. We exploit on each side a passive switch followed by two measurement devices with fixed settings. Assuming the switches are not fully controlled by an adversary, nor by hypothetical local variables, we reveal the nonlocality of the established correlations despite a low overall detection efficiency.

arXiv:1507.04937•Physical Review Letters•Jan 6, 2016•38 citations

Challenging preconceptions about Bell tests with photon pairs

Valentina Caprara Vivoli, Pavel Sekatski, Jean-Daniel Bancal +7 more

Motivated by very recent experiments, we consider a scenario ``\`a la Bell'' in which two protagonists test the Clauser-Horne-Shimony-Holt (CHSH) inequality using a photon-pair source based on spontaneous parametric down conversion and imperfect photon detectors. The conventional wisdom says that (i) if the detectors have unit efficiency, the CHSH violation can reach its maximum quantum value of $2\sqrt{2}$. To obtain the maximal possible violation, it suffices that the source emits (ii) maximally entangled photon pairs (iii) in two well-defined single modes. Through a nonperturabive calculation of nonlocal correlations, we show that none of these statements are true. By providing the optimal pump parameters, measurement settings and state structure for any detection efficiency and dark count probability, our results give the recipe to close all the loopholes in a Bell test using photon pairs.

arXiv:1405.1939•Physical Review A•Jan 14, 2015•32 citations

Quantum Bounds on Detector Efficiencies for Violating Bell Inequalities Using Semidefinite Programming

Alexander Sauer, G. Alber

Loophole-free violations of Bell inequalities are crucial for fundamental tests of quantum nonlocality. They are also important for future applications in quantum information processing, such as device-independent quantum key distribution. Based on a detector model which includes detector inefficiencies and dark counts, we estimate the minimal requirements on detectors needed for performing loophole-free bipartite and tripartite Bell tests. Our numerical investigation is based on a hierarchy of semidefinite programs for characterizing possible quantum correlations. We find that for bipartite setups with two measurement choices and our detector model, the optimal inequality for a Bell test is equivalent to the Clauser–Horne inequality.

Cryptography•Jan 3, 2020•3 citations

Robust Bell inequalities from communication complexity

Sophie Laplante, Mathieu Laurière, Alexandre Nolin +2 more

The question of how large Bell inequality violations can be, for quantum distributions, has been the object of much work in the past several years. We say that a Bell inequality is normalized if its absolute value does not exceed 1 for any classical (i.e. local) distribution. Upper and (almost) tight lower bounds have been given for the quantum violation of these Bell inequalities in terms of number of outputs of the distribution, number of inputs, and the dimension of the shared quantum states. In this work, we revisit normalized Bell inequalities together with another family: inefficiency-resistant Bell inequalities. To be inefficiency-resistant, the Bell value must not exceed 1 for any local distribution, including those that can abort. This makes the Bell inequality resistant to the detection loophole, while a normalized Bell inequality is resistant to general local noise. Both these families of Bell inequalities are closely related to communication complexity lower bounds. We show how to derive large violations from any gap between classical and quantum communication complexity, provided the lower bound on classical communication is proven using these lower bound techniques. This leads to inefficiency-resistant violations that can be exponential in the size of the inputs. Finally, we study resistance to noise and inefficiency for these Bell inequalities.

arXiv:1606.09514•Quantum•Jun 7, 2018•12 citations
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.
Abstract The detection loophole problem arises when quantum devices fail to provide an output for some runs. If treating these devices in a device-independent manner, failure to include the unsuccessful runs in the output statistics can lead to an adversary falsifying security i.e. Bell inequality violation. If the devices fail with too high frequency, known as the detection threshold, then no security is possible, as the full statistics cannot violate a Bell inequality. In this work we provide an intuitive local hidden-variable strategy that the devices may use to falsify any two-party, binary-outcome no-signalling distribution up to a threshold of 2(m A + m B − 8)/(m A m B − 16), where m A, m B refer to the number of available inputs choices to the two parties. This value is the largest analytically predicted lower bound for no-signalling distributions. We strongly conjecture it gives the true detection threshold for m A = m B, and for computationally tractable scenarios we provide the Bell inequality which verifies this. We also prove that a non-trivial detection threshold remains, even when allowing one party an arbitrary number of input choices.
It is well-known that in certain scenarios weakly entangled states can generate stronger nonlocal effects than their maximally entangled counterparts. In this paper, we consider violations of the Clauser-Horne-Shimony-Holt (CHSH) inequality when one party has inefficient detectors, a scenario known as an asymmetric Bell experiment. For any fixed detection efficiency, we derive a simple upper bound on the entanglement needed to violate the inequality by more than some specified amount $\ensuremath{\kappa}\ensuremath{\ge}0$. When $\ensuremath{\kappa}=0$, the amount of entanglement in all states violating the inequality goes to zero as the detection efficiency approaches 5050%50 from above. We finally consider the scenario in which detection inefficiency arises for only one choice of local measurement. In this case, it is shown that the CHSH inequality can always be violated for any nonzero detection efficiency and any choice of noncommuting measurements.
The demonstration and use of nonlocality, as defined by Bell's theorem, rely strongly on dealing with nondetection events due to losses and detectors'inefficiencies. Otherwise, the so-called detection loophole could be exploited. The only way to avoid this is to have detection efficiencies that are above a certain threshold. We introduce the intermediate assumption of limited detection efficiency, that is, in each run of the experiment, the overall detection efficiency is lower bounded by η(min)>0. Hence, in an adversarial scenario, the adversaries have arbitrary large but not full control over the inefficiencies. We analyze the set of possible correlations that satisfy limited detection locality and show that they necessarily satisfy some linear Bell-like inequalities. We prove that quantum theory predicts the violation of one of these inequalities for all η(min)>0. Hence, nonlocality can be demonstrated with arbitrarily small limited detection efficiencies. We validate this assumption experimentally via a twin-photon implementation in which two users are provided with one photon each out of a partially entangled pair. We exploit on each side a passive switch followed by two measurement devices with fixed settings. Assuming the switches are not fully controlled by an adversary, nor by hypothetical local variables, we reveal the nonlocality of the established correlations despite a low overall detection efficiency.
Motivated by very recent experiments, we consider a scenario ``\`a la Bell'' in which two protagonists test the Clauser-Horne-Shimony-Holt (CHSH) inequality using a photon-pair source based on spontaneous parametric down conversion and imperfect photon detectors. The conventional wisdom says that (i) if the detectors have unit efficiency, the CHSH violation can reach its maximum quantum value of 222\sqrt{2}22​. To obtain the maximal possible violation, it suffices that the source emits (ii) maximally entangled photon pairs (iii) in two well-defined single modes. Through a nonperturabive calculation of nonlocal correlations, we show that none of these statements are true. By providing the optimal pump parameters, measurement settings and state structure for any detection efficiency and dark count probability, our results give the recipe to close all the loopholes in a Bell test using photon pairs.
Loophole-free violations of Bell inequalities are crucial for fundamental tests of quantum nonlocality. They are also important for future applications in quantum information processing, such as device-independent quantum key distribution. Based on a detector model which includes detector inefficiencies and dark counts, we estimate the minimal requirements on detectors needed for performing loophole-free bipartite and tripartite Bell tests. Our numerical investigation is based on a hierarchy of semidefinite programs for characterizing possible quantum correlations. We find that for bipartite setups with two measurement choices and our detector model, the optimal inequality for a Bell test is equivalent to the Clauser–Horne inequality.
The question of how large Bell inequality violations can be, for quantum distributions, has been the object of much work in the past several years. We say that a Bell inequality is normalized if its absolute value does not exceed 1 for any classical (i.e. local) distribution. Upper and (almost) tight lower bounds have been given for the quantum violation of these Bell inequalities in terms of number of outputs of the distribution, number of inputs, and the dimension of the shared quantum states. In this work, we revisit normalized Bell inequalities together with another family: inefficiency-resistant Bell inequalities. To be inefficiency-resistant, the Bell value must not exceed 1 for any local distribution, including those that can abort. This makes the Bell inequality resistant to the detection loophole, while a normalized Bell inequality is resistant to general local noise. Both these families of Bell inequalities are closely related to communication complexity lower bounds. We show how to derive large violations from any gap between classical and quantum communication complexity, provided the lower bound on classical communication is proven using these lower bound techniques. This leads to inefficiency-resistant violations that can be exponential in the size of the inputs. Finally, we study resistance to noise and inefficiency for these Bell inequalities.