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.
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.
In order to reject the local hidden variables hypothesis, the usefulness of a Bell inequality can be quantified by how small a p -value it will give for a physical experiment. Here we show that to obtain a small expected p -value it is sufficient to have a large gap between the local and Tsirelson bounds of the Bell inequality, when it is formulated as a nonlocal game. We develop an algorithm for transforming an arbitrary Bell inequality into an equivalent nonlocal game with the largest possible gap, and show its results for the CGLMP and Inn22 inequalities.We present explicit examples of Bell inequalities with gap arbitrarily close to one, and show that this makes it possible to reject local hidden variables with arbitrarily small p -value in a single shot, without needing to collect statistics. We also develop an algorithm for calculating local bounds of general Bell inequalities which is significantly faster than the naïve approach, which may be of independent interest.
Reliable and loophole-free demonstrations of the violation of local realism (LR) are highly desirable not only for understanding the foundation of quantum mechanics but also for facilitating quantum information processing, such as quantum key distribution and randomness expansion. To date, LR has been experimentally violated, but with loopholes, by testing predetermined Bell inequalities. This thesis presents a framework for verifying and quantifying the violation of LR without relying on a particular Bell inequality.\nFirst, the experimental resources, such as the quantum state, measurement settings, detection effciency, and visibility required for a violation of LR, are studied via a measure called the statistical strength. The higher the statistical strength, the more confidence in a violation of LR one has after a suffciently large number of experimental data. Particularly, we study the minimum detection effciency required to achieve any given statistical strength level in tests of LR with entangled states created from two independent polarized photons passing through a polarizing beam splitter. It is shown that, compared with photon detectors, photon counters make violations of LR easier to detect for any nonzero probability of multiple photons in an output beam of the polarizing beam splitter.\nSecond, to quantify the statistical evidence against LR obtained from a finite number of experimental data, one can choose a test statistic, such as a Bell-inequality violation, to measure the amount of violation of LR. It is desirable to bound the probability, according to LR, of obtaining a test statistic at least as extreme as that observed. This probability is known as a p-value for the hypothesis test of LR. We propose a protocol to bound such a p-value. The bound provided is asymptotically tight, if the prepared quantum state and measurement settings are stable during an experiment. Therefore, the proposed protocol is asymptotically optimal, and the bound provided is a standardized measure of success for experimental tests of LR. One can quantitatively compare different experimental tests based on this bound. Moreover, the bound provided is valid even if the quantum state varies arbitrarily and local realistic models depend on previous measurement settings and outcomes. Hence, this bound facilitates device-independent and nonlocality-based quantum information processing. For comparison, bounds of p-values derived from Bell-inequality violations using the number of standard deviations of violation of a Bell inequality or using martingale theory are studied. It is found that putative bounds derived from the number of standard deviations of violation are not valid and bounds from martingale theory are not tight.\nFinally, a simplified and effcient data analysis protocol using a set of Bell inequalities is proposed and compared with the above optimal and martingale-based protocols. The simplified protocol provides as good as and typically tighter p-value bounds than the martingale-based protocol, and the bounds provided can even be asymptotically tight. Moreover, the simplified protocol can be applied to any test with linear witnesses, such as tests for verifying entanglement, system dimensionality, or steering.
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.
An alternative method of detection-loophole-free Bell test is proposed using local hidden variable (LHV) models with optimal detection efficiencies. A framework for constructing such optimal LHV models is presented. Optimal LHV models for maximally and non-maximally entangled twopartite states are constructed to reproduce the quantum correlations within the critical detection efficiencies. The LHV models are shown to be completely equivalent with the existing twopartite Bell inequalities in their optimized setups, and to have even lower critical efficiencies in the LHV modes' own optimized setups. Applications in Bell tests and in device-independent quantum information processing are discussed.
The no-signalling principle is a fundamental assumption in Bell-inequality and quantum-steering experiments. Nonetheless, experimental imperfections can lead to apparent violations beyond those expected from finite-sample statistics. Here, we propose extensions of local hidden variable and local hidden state theories that allow for bounded, operationally quantifiable, amounts of signalling. We show how non-classicality tests can be developed for these models, both through exact methods based on the full set of observed statistics and through corrections to the standard Bell and steering inequalities. We demonstrate the applicability of these methods via two scenarios that feature apparent signalling: an IBM quantum processor and post-selected data from inefficient detectors.
Correlations that cannot be reproduced with local variables certify the generation of private randomness. Usually, the violation of a Bell inequality is used to quantify the amount of randomness produced. Here, we show how private randomness generated during a Bell test can be directly quantified from the observed correlations, without the need to process these data into an inequality. The frequency with which the different measurement settings are used during the Bell test can also be taken into account. This improved analysis turns out to be very relevant for Bell tests performed with a finite collection efficiency. In particular, applying our technique to the data of a recent experiment (Christensen et al 2013 Phys. Rev. Lett. 111 130406), we show that about twice as much randomness as previously reported can be potentially extracted from this setup.