The Clauser-Horne-Shimony-Holt inequality test is widely used as a means of invalidating the local deterministic theories and a tool of device-independent quantum cryptographic tasks. There exists a randomness (free will) loophole in the test, which is widely believed impossible to be closed perfectly, that is, certain random inputs are required for the test. Following a randomness quantification method used in literature, we investigate the randomness required in the test under various assumptions. By comparing the results, we conclude that, in order to make the test result reliable, it is more important to rule out the correlation between multiple runs than the correlation between two parties.
The Clauser-Horne-Shimony-Holt inequality test is widely used as a means of invalidating the local deterministic theories and a tool of device-independent quantum cryptographic tasks. There exists a randomness (free will) loophole in the test, which is widely believed impossible to be closed perfectly, that is, certain random inputs are required for the test. Following a randomness quantification method used in literature, we investigate the randomness required in the test under various assumptions. By comparing the results, we conclude that, in order to make the test result reliable, it is more important to rule out the correlation between multiple runs than the correlation between two parties.
Free will (or randomness) has been studied to achieve loophole-free Bell's inequality test and to provide device-independent quantum key distribution security proofs. The required randomness such that a local hidden variable model (LHVM) can violate the Clauser-Horne-Shimony-Holt (CHSH) inequality has been studied, but a tight bound has not been proved for a practical case that: 1) the device settings of the two parties in the Bell test are independent and 2) the device settings of each party can be correlated or biased across different runs. Using some information theoretic techniques, we prove, in this paper, a tight bound on the required randomness for this case, such that the CHSH inequality can be violated by certain LHVM. Our proof has a clear achievability and converse style. The achievability part is proved using type counting. To prove the converse part, we introduce a concept called profile for a set of binary sequences and study the properties of profiles. Our profile-based converse technique is also of independent interest.
The Bell test is one of the most important tools in quantum information science. On the one hand, it enables fundamental tests of the basic physics laws of nature, and on the other hand, it can also be applied in a variety of device-independent tasks such as quantum key distribution and random number generation. In practice, loopholes existing in experimental demonstrations of Bell tests may affect the validity of the conclusions. In this work, we focus on the randomness (freewill) loophole and investigate the randomness requirement in a well-known Bell test, the Clauser-Horne test, under various conditions. We explicitly bound the Bell value for all local hidden variable models by optimizing over all classical strategies exploiting the knowledge of the partially random inputs. Our result thus provides input randomness requirements on the Clauser-Horne test under varieties of practical scenarios. The employed analysis technique can also be generalized to other Bell inequalities.
Bell tests, as primitive tools to detect nonlocality in bipartite systems, rely on an assumption, i.e., measurement independence. Since ensuring measurement independence in a practical Bell test is difficult, it is crucial to explore the effects of relaxing this assumption. Recently, in the simplest Clauser-Horne-Shimony-Holt Bell (CHSH-Bell) test, Koh et al. [Phys. Rev. Lett. 109, 160404 (2012)] built the relation among measurement dependence, guessing probability, and the maximum value of CHSH-Bell correlation function that an adversary (Eve) can fake. As well, Pope et al. [Phys. Rev. A 88, 032110 (2013)] and Yuan et al. [Phys. Rev. A. 91, 032111 (2015)] settled the same problem in the multiple-run scenario with the general input distribution and the factorizable one, respectively. However, pertinent results in the generalized CHSH-Bell test are still missing. Here, we study this problem and establish the relation among measurement dependence, guessing probability, and the maximum value of the generalized CHSH-Bell correlation function that Eve can fake. Furthermore, we also consider the multiple-run scenario and show the relations in both input distributions. Interestingly, compared with the simplest CHSH-Bell test, we find that it is more difficult for Eve to fake a violation in the generalized CHSH-Bell test in some special cases. We expect that our conclusions will serve as a reference for quantum information processing tasks such as quantum key distribution, randomness expansion, and other tasks in the device-independent framework.
A correlation inequality is derived from local realism and a supplementary assumption. Unlike Clauser-Horne (CH) inequality [or Clauser-Horne-Shimony-Holt (CHSH) inequality] which is violated by quantum mechanics by a factor of 2, this inequality is violated by a factor of 1.5. Thus the magnitude of violation of this inequality is approximately 20.7% larger than the magnitude of violation of previous inequalities. Moreover, unlike CH (or CHSH) inequality which requires the measurement of five detection probabilities, the present inequality requires the measurement of only two detection probabilities. This inequality can therefore be used to test locality more simply than CH or CHSH inequality.
One of the distinguishing features of quantum theory is that its measurement outcomes are usually unpredictable or, equivalently, random. Moreover, this randomness is certifiable with minimal assumptions in the so-called device-independent (DI) paradigm, where a device's behavior does not need to be presupposed but can be verified through the statistics it produces. In this work, we explore various forms of randomness that are certifiable in this setting, where two users can perform two binary-outcome measurements on their shared entangled state. In this case, even though the Clauser-Horne-Shimony-Holt (CHSH) Bell-inequality violation is a pre-requisite for the generation of DI certifiable randomness, the CHSH value alone does not generally give a tight bound on the certifiable randomness. Here, we determine the certifiable randomness when zero-probability constraints are incorporated into the task of DI randomness expansion for the standard local and global randomness and the so-called "blind" randomness. Asymptotically, we observe consistent improvements in the amount of DI certifiable randomness (of all kinds) as we increase the number zero constraints for a wide range of given CHSH Bell violations. However, if we further optimize over the allowed CHSH values, then benefits of these additional constraints over the standard CHSH-based protocol are only found in the case of global and blind randomness. In contrast, in the regimes of finite data, these zero constraints only give a slight improvement in the local randomness rate when compared with all existing protocols.
Self-testing is a device-independent technique based on non-local correlations whose aim is to certify the effective uniqueness of the quantum state and measurements needed to produce these correlations. It is known that the maximal violation of some Bell inequalities suffices for this purpose. However, most of the existing self-testing protocols for two devices exploit the well-known Clauser–Horne–Shimony–Holt Bell inequality or modifications of it, and always with two measurements per party. Here, we generalize the previous results by demonstrating that one can construct self-testing protocols based on the chained Bell inequalities, defined for two devices implementing an arbitrary number of two-output measurements. On the one hand, this proves that the quantum state and measurements leading to the maximal violation of the chained Bell inequality are unique. On the other hand, in the limit of a large number of measurements, our approach allows one to self-test the entire plane of measurements spanned by the Pauli matrices X and Z . Our results also imply that the chained Bell inequalities can be used to certify two bits of perfect randomness.