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.
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.
A Bell inequality is a constraint on a set of correlations whose violation can be used to certify nonlocality. They are instrumental for device-independent tasks such as key distribution or randomness expansion. In this work, we consider bipartite Bell inequalities where two parties have mA and mB possible inputs and give nA and nB possible outputs, referring to this as the (mA,mB,nA,nB) scenario. By exploiting knowledge of the set of extremal no-signaling distributions, we find all 175 Bell inequality classes in the (4,4,2,2) scenario as well as provide a partial list of 18 277 classes in the (4,5,2,2) scenario. We also use a probabilistic algorithm to obtain 5 classes of inequality in the (2,3,3,2) scenario, which we confirmed to be complete, 25 classes in the (3,3,2,3) scenario, and a partial list of 21 170 classes in the (3,3,3,3) scenario. Our inequalities are given as Supplemental Material. Finally, we discuss the application of these inequalities to the detection loophole problem and provide lower bounds on the detection efficiency threshold for small numbers of inputs and outputs.
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.
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.
This article provides a comprehensive review of the critical role of detection efficiency in demonstrating non-classicality across various device-independent and semi-device-independent scenarios. The central focus is the detection loophole, a challenge in which imperfect detectors can allow classical hidden variable models to mimic quantum correlations, thus masking genuine non-classicality. As a review, the article revisits the paradigmatic Bell scenario, detailing the efficiency requirements for the CHSH inequality, such as the 2/3 threshold for symmetric efficiencies, and traces the historical trajectory toward the first loophole-free tests. The analysis extends to other causal structures to explore how efficiency requirements are affected in different contexts. These include the instrumental scenario, which for binary variables has recently been shown to follow the same inefficiency bounds as the bipartite dichotomic Bell scenario; the prepare-and-measure scenario, where inefficiencies impact the certification of a quantum system's dimension and create security breaches in protocols such as Quantum Key Distribution (QKD); and the bilocality scenario, which exemplifies how employing multiple independent sources can significantly relax the required efficiencies to certify non-classical correlations.
In many quantum information applications, a minimum detection efficiency must be exceeded to ensure success. Protocols depending on the violation of a Bell inequality, for instance, may be subject to the so-called detection loophole: Imperfect detectors may yield spurious violations, which consequently cannot be used to ensure, say, quantum cryptographic security. Hence, we investigate the possibility of giving lower bounds on detector efficiency even if an adversary has full control over both the source and the detectors. To this end, we present a technique to systematically derive Bell inequalities free from the detection loophole using only the observed measurements statistics. The violation of these inequalities certifies that the detectors used exceed a certain minimal efficiency.
A common problem in Bell-type experiments is the well-known detection loophole: if the detection efficiencies are not perfect and if one simply postselects the conclusive events, one might observe a violation of a Bell inequality, even though a local model could have explained the experimental results. In this paper, we analyze the set of all postselected correlations that can be explained by a local model, and show that it forms a polytope, larger than the Bell local polytope. We characterize the facets of this postselected local polytope in the Clauser-Horne-Shimony-Holt scenario, where two parties have binary inputs and outcomes. Our approach gives interesting insights on the detection loophole problem.