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.
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.
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.
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.
There are bipartite quantum nonlocal correlations requiring very low detection efficiency to reach the loophole-free regime but that need too many measurement settings to be practical for actual experiments. This leads to the general problem of what can be concluded about loophole-free Bell nonlocality if only a random subset of these settings is tested. Here we develop a method to address this problem. We show that, in some cases, it is possible to detect loophole-free Bell nonlocality by testing only a small random fraction of the settings. The consequence is a higher detection efficiency. The method allows for the design of loophole-free Bell tests in which, given a quantum correlation that violates a Bell inequality, one can calculate the minimum fraction of contexts needed to reach the detection-loophole-free regime. The results also enforce a different way of thinking about how local realistic models or classical communication can be used to simulate quantum nonlocal correlations, as it shows that the amount of resources that are needed can be made arbitrarily large simply by considering more contexts.
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.
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.
Quantum entanglement is a unique property of quantum particles. It can correlate them in such a way, that further correlations to an additional unwanted party is prevented. This renders quantum theory as the prime candidate to implement a secure distribution of an encryption key. Quantum key distribution (QKD) is dedicated to this task. A striking feature of correlations in a statistical experiment is, that they can, in principle, always be approximated. Even more so, correlations can be obtained without a detailed knowledge about the underlying physical process that generated the experimental data. This no-characterization approach is at the heart of the device-independent (DI) paradigm. Here, Bell inequalities are an imperative tool to detect nonlocal correlations, which are necessary for a DI secret key. One central subject of this thesis is multipartite DIQKD and the implications of Bell nonlocality in this context. Any DIQKD protocol involves test rounds in which the violation of a Bell inequality is checked. For multipartite DIQKD, however, not all Bell inequalities are suitable. We identify the crucial properties a Bell test requires to be a viable option. In this light, a published protocol for multipartite DIQKD is examined. We establish an incompatibility which is inherent to the proposed Bell test in combination with the required quantum states. This leads us to the conclusion, that the proposed protocol necessarily aborts. In a subsequent work, we develop a family of multipartite Bell inequalities, specifically tailored to the task of DI conference key agreement (CKA). Several features of this Bell inequality are analytically characterized. In addition, we prove its usefulness for the purposes of DICKA. To this end, semidefinite programming techniques are employed and extended to the multipartite scenario which allows us to quantify asymptotic DI conference key rates. In a second part, we explore the challenges of implementing (bipartite) long-distance DIQKD with quantum repeaters. For two repeater protocols, we describe how experimental parameters manifest themselves in DI secret-key rates. In doing so, we shed light on the fundamental differences between the usual and the DI scenario and we benchmark the threshold requirements of quantum devices to make profitable DI secret-key rates feasible. Finally, we develop a general method to describe in a non-DI setting the propagation of an important class of errors through quantum circuits in arbitrary dimensions. With this, we discuss the potential of error-corrected quantum repeaters to overcome fundamental point-to-point limitations.