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:1505.04272 · Physical Review A

Clauser-Horne Bell test with imperfect random inputs

Xiao Yuan, Qi Zhao, Xiongfeng Ma

Published Aug 10, 2015• 7 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.92.022107

Related papers

Randomness requirement on the Clauser-Horne-Shimony-Holt Bell test in the multiple-run scenario

Xiao Yuan, Zhu Cao, Xiongfeng Ma

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.

arXiv:1409.7875•Physical Review A•Mar 16, 2015•25 citations

Requirements for a loophole-free photonic Bell test using imperfect setting generators

Johannes Kofler, Marissa Giustina, Jan-Åke Larsson +1 more

Experimental violations of Bell inequalities are in general vulnerable to so-called loopholes. In this work, we analyze the characteristics of a loophole-free Bell test with photons, closing simultaneously the locality, freedom-of-choice, fair-sampling (i.e., detection), coincidence-time, and memory loopholes. We pay special attention to the effect of excess predictability in the setting choices due to nonideal random-number generators. We discuss necessary adaptations of the Clauser-Horne and Eberhard inequality when using such imperfect devices and---using Hoeffding's inequality and Doob's optional stopping theorem---the statistical analysis in such Bell tests.

arXiv:1411.4787•Physical Review A•Mar 10, 2016•87 citations

Tight Bound on Randomness for Violating the Clauser–Horne–Shimony–Holt Inequality

Yifeng Teng, Shenghao Yang, Siwei Wang +1 more

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.

arXiv:1504.05306•IEEE Transactions on Information Theory•Feb 26, 2016•2 citations

(Nearly) optimal P values for all Bell inequalities

David Elkouss, Stephanie Wehner

Abstract A key objective in conducting a Bell test is to quantify the statistical evidence against a local-hidden variable model (LHVM) given that we can collect only a finite number of trials in any experiment. The notion of statistical evidence is thereby formulated in the framework of hypothesis testing, where the null hypothesis is that the experiment can be described by an LHVM. The statistical confidence with which the null hypothesis of an LHVM is rejected is quantified by the so-called P value, where a smaller P value implies higher confidence. Establishing good statistical evidence is especially challenging if the number of trials is small, or the Bell violation very low. Here, we derive the optimal P value for a large class of Bell inequalities. What is more, we obtain very sharp upper bounds on the P value for all Bell inequalities. These values are easily computed from the experimental data, and are valid even if we allow arbitrary memory in the devices. Our analysis is able to deal with imperfect random number generators, and event-ready schemes, even if such a scheme can create different kinds of entangled states. Finally, we review requirements for sound data collection, and a method for combining P values of independent experiments. The methods discussed here are not specific to Bell inequalities. For instance, they can also be applied to the study of certified randomness or to tests of noncontextuality.

arXiv:1510.07233•npj Quantum Information•Oct 18, 2016•33 citations

Device-Independent Randomness Amplification

Anatoly Kulikov, Simon Storz, Josua Schär +6 more

Successful realization of Bell tests has settled an 80-year-long debate, proving the existence of correlations which cannot be explained by a local realistic model. Recent experimental progress allowed to rule out any possible loopholes in these tests, and opened up the possibility of applications in cryptography envisaged more than three decades ago. A prominent example of such an application is device-independent quantum key distribution, which has recently been demonstrated. One remaining gap in all existing experiments, however, is that access to perfect randomness is assumed. To tackle this problem, the concept of randomness amplification has been introduced, allowing to generate such randomness from a weak source -- a task impossible in classical physics. In this work, we demonstrate the amplification of imperfect randomness coming from a physical source. It is achieved by building on two recent developments: The first is a theoretical protocol implementing the concept of randomness amplification within an experimentally realistic setup, which however requires a combination of the degree of Bell inequality violation (S-value) and the amount of data not attained previously. The second is experimental progress enabling the execution of a loophole-free Bell test with superconducting circuits, which offers a platform to reach the necessary combination. Our experiment marks an important step in achieving the theoretical physical limits of privacy and randomness generation.

arXiv:2412.17931•Dec 23, 2024•0 citations

Free will in device-independent cryptography

James E. Pope

Device-independent cryptography provides security in various tasks whilst removing an assumption that cryptographers previously thought of as crucial -- complete trust in the machinations of their experimental apparatus. The theory of Bell inequalities as a proof of indeterminism within nature allows for secure device-independent schemes requiring neither trust in the cryptographers' devices nor reliance on the completeness of quantum mechanics. However, the extreme paranoia attributable to the relaxed assumptions within device independence requires an explicit consideration of the previously assumed ability of the experimenters to freely make random choices. This thesis addresses the so-called `free will loophole', presenting Bell tests and associated cryptographic protocols robust against adversarial manipulation of the random number generators with which measurements in a Bell test are selected. We present several quantitative measures for this experimental free will, otherwise known as measurement dependence. We discuss how an eavesdropper maliciously preprogramming the experimenters' untrusted devices can falsely simulate the violation of a Bell inequality. We also bound the amount of Bell violation achievable within a certain degree of measurement dependence. This analysis extends to device-independent randomness expansion, bounding the guessing probability and estimating the amount of privacy amplification required to distil private randomness. The protocol is secure against either arbitrary no-signalling or quantum adversaries. We also consider device-independent key distribution, studying adversarial models that exploit the free will loophole. Finally, we examine a model correlated between the random number generators and Bell devices across multiple runs of a Bell test. This enables an explicit exposition of the optimal cheating strategy and how the correlations manifest themselves within this strategy. We prove that there remain Bell violations for a sufficiently high, yet non-maximal degree of measurement dependence which cannot be simulated by a classical attack, regardless of how many runs of the experiment those choices are correlated over.

•Jan 1, 2014•0 citations
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.
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.
Experimental violations of Bell inequalities are in general vulnerable to so-called loopholes. In this work, we analyze the characteristics of a loophole-free Bell test with photons, closing simultaneously the locality, freedom-of-choice, fair-sampling (i.e., detection), coincidence-time, and memory loopholes. We pay special attention to the effect of excess predictability in the setting choices due to nonideal random-number generators. We discuss necessary adaptations of the Clauser-Horne and Eberhard inequality when using such imperfect devices and---using Hoeffding's inequality and Doob's optional stopping theorem---the statistical analysis in such Bell tests.
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.
Abstract A key objective in conducting a Bell test is to quantify the statistical evidence against a local-hidden variable model (LHVM) given that we can collect only a finite number of trials in any experiment. The notion of statistical evidence is thereby formulated in the framework of hypothesis testing, where the null hypothesis is that the experiment can be described by an LHVM. The statistical confidence with which the null hypothesis of an LHVM is rejected is quantified by the so-called P value, where a smaller P value implies higher confidence. Establishing good statistical evidence is especially challenging if the number of trials is small, or the Bell violation very low. Here, we derive the optimal P value for a large class of Bell inequalities. What is more, we obtain very sharp upper bounds on the P value for all Bell inequalities. These values are easily computed from the experimental data, and are valid even if we allow arbitrary memory in the devices. Our analysis is able to deal with imperfect random number generators, and event-ready schemes, even if such a scheme can create different kinds of entangled states. Finally, we review requirements for sound data collection, and a method for combining P values of independent experiments. The methods discussed here are not specific to Bell inequalities. For instance, they can also be applied to the study of certified randomness or to tests of noncontextuality.
Successful realization of Bell tests has settled an 80-year-long debate, proving the existence of correlations which cannot be explained by a local realistic model. Recent experimental progress allowed to rule out any possible loopholes in these tests, and opened up the possibility of applications in cryptography envisaged more than three decades ago. A prominent example of such an application is device-independent quantum key distribution, which has recently been demonstrated. One remaining gap in all existing experiments, however, is that access to perfect randomness is assumed. To tackle this problem, the concept of randomness amplification has been introduced, allowing to generate such randomness from a weak source -- a task impossible in classical physics. In this work, we demonstrate the amplification of imperfect randomness coming from a physical source. It is achieved by building on two recent developments: The first is a theoretical protocol implementing the concept of randomness amplification within an experimentally realistic setup, which however requires a combination of the degree of Bell inequality violation (S-value) and the amount of data not attained previously. The second is experimental progress enabling the execution of a loophole-free Bell test with superconducting circuits, which offers a platform to reach the necessary combination. Our experiment marks an important step in achieving the theoretical physical limits of privacy and randomness generation.
Device-independent cryptography provides security in various tasks whilst removing an assumption that cryptographers previously thought of as crucial -- complete trust in the machinations of their experimental apparatus. The theory of Bell inequalities as a proof of indeterminism within nature allows for secure device-independent schemes requiring neither trust in the cryptographers' devices nor reliance on the completeness of quantum mechanics. However, the extreme paranoia attributable to the relaxed assumptions within device independence requires an explicit consideration of the previously assumed ability of the experimenters to freely make random choices. This thesis addresses the so-called `free will loophole', presenting Bell tests and associated cryptographic protocols robust against adversarial manipulation of the random number generators with which measurements in a Bell test are selected. We present several quantitative measures for this experimental free will, otherwise known as measurement dependence. We discuss how an eavesdropper maliciously preprogramming the experimenters' untrusted devices can falsely simulate the violation of a Bell inequality. We also bound the amount of Bell violation achievable within a certain degree of measurement dependence. This analysis extends to device-independent randomness expansion, bounding the guessing probability and estimating the amount of privacy amplification required to distil private randomness. The protocol is secure against either arbitrary no-signalling or quantum adversaries. We also consider device-independent key distribution, studying adversarial models that exploit the free will loophole. Finally, we examine a model correlated between the random number generators and Bell devices across multiple runs of a Bell test. This enables an explicit exposition of the optimal cheating strategy and how the correlations manifest themselves within this strategy. We prove that there remain Bell violations for a sufficiently high, yet non-maximal degree of measurement dependence which cannot be simulated by a classical attack, regardless of how many runs of the experiment those choices are correlated over.