It is known that the local bound of a Bell inequality is sensitive to the knowledge of the external observer about the settings statistics. Here we ask how that sensitivity depends on the structure of that knowledge. It turns out that in some cases it may happen that the local bound is much more sensitive to adversary's knowledge about settings of one party than the other. Remarkably, there are Bell inequalities which are highly asymmetric with respect to the adversary's knowledge about local settings. This property may be viewed as a hidden intrinsic asymmetry of Bell inequalities. Potential implications of the revealed asymmetry effect are also discussed.
It is known that the local bound of a Bell inequality is sensitive to the knowledge of the external observer about the settings statistics. Here we ask how that sensitivity depends on the structure of that knowledge. It turns out that in some cases it may happen that the local bound is much more sensitive to adversary's knowledge about settings of one party than the other. Remarkably, there are Bell inequalities which are highly asymmetric with respect to the adversary's knowledge about local settings. This property may be viewed as a hidden intrinsic asymmetry of Bell inequalities. Potential implications of the revealed asymmetry effect are also discussed.
Let us imagine an experimentalist, who has maximally entangled photons and wants to violate Bell’s inequality in his laboratory. Among many obstacles he has to overcome, two of them are the most significant. Firstly, he has to avoid exchanging information about the measurement settings between the particles. Secondly, he has to detect particles with a high enough probability, because if the detection efficiency is too low, one can reproduce quantum correlations using a LHV (Local Hidden Variables) model. These two problems are known in the literature, respectively, as the locality loophole [1] and the detection loophole [2, 3]. Fortunately, it is possible to close the locality loophole using photons in the experiment [4, 5, 6, 7, 8]. However, closing the detection loophole is still an object of study. The authors of [9] showed that for the CHSH inequality, the lower bound for detector efficiency needed to close the loophole is 82.8% for maximally entangled states. This bound was lowered to 66.7% by Eberhard [10]. Furthermore, the detector efficiency has been studied for other Bell inequalities [11, 12, 13, 14, 15, 16]. In our research, we are trying to answer the following question: If we prepare a Bell experiment and we have two detectors, having different efficiencies both smaller than 100%, which detector should each party receive? And also: Which representation of the chosen Bell inequality should we consider? These are very crucial questions, which arise in laboratories. Hence, we hope that our results will be useful for experimentalists. We focus on the I3322 inequality [17], which is a natural candidate for testing, because of its asymmetry [14, 18]. We consider the case of a post-selection strategy, which consists in rejecting all the rounds in the Bell experiment when one of the detectors does not click. We used numerical optimisation methods to find both the best classical strategy for Alice and Bob and the best detector clicking strategy. Thus, we have found minimal efficiencies of the detectors of Alice and Bob needed to violate I3322. We made the same studies also for symmetric representations of I3322 [19]. Our results show that the minimal efficiencies of Alice and Bob’s detectors of the asymmetric representation of I3322 is lower than in case of the symmetric one [20]. It is work in progress, and we are examining other post-selection methods as well as other Bell inequalities. We want to consider also the case when non-maximally entangled states are used in Bell experiments.
Tests of local realism and their applications aim for very high confidence in their results even in the presence of potentially adversarial effects. For this purpose, one can measure a quantity that reflects the amount of violation of local realism and determine a bound on the probability, according to local realism, of obtaining a violation at least that observed. In general, it is difficult to obtain sufficiently robust and small bounds. Here we describe an efficient protocol for computing such bounds from any set of Bell inequalities for any number of parties, measurement settings, or outcomes. The protocol can be applied to tests of other properties (such as entanglement or dimensionality) that are witnessed by linear inequalities.
It is one of the most remarkable features of quantum physics that measurements on spatially separated systems cannot always be described by a locally causal theory. In such a theory, the outcomes of local measurements are determined in advance solely by some unknown (or hidden) variables and the choice of local measurements. Correlations that are allowed within the framework of a locally causal theory are termed classical. Typically, the fact that quantum mechanics does not always result in classical correlations is revealed by the violation of Bell inequalities, which are constraints that have to be satisfied by any classical correlations. It has been known for a long time that entanglement is necessary to demonstrate nonclassical correlations, and hence a Bell inequality violation. However, since some entangled quantum states are known to admit explicit locally causal models, the exact role of entanglement in Bell inequality violation has remained obscure. This thesis provides both a comprehensive review on these issues as well as a report on new discoveries made to clarify the relationship between entanglement and Bell inequality violation.
It is one of the most remarkable features of quantum physics that measurements on spatially separated systems cannot always be described by a locally causal theory. In such a theory, the outcomes of local measurements are determined in advance solely by some unknown (or hidden) variables and the choice of local measurements. Correlations that are allowed within the framework of a locally causal theory are termed classical. Typically, the fact that quantum mechanics does not always result in classical correlations is revealed by the violation of Bell inequalities, which are constraints that have to be satisfied by any classical correlations. It has been known for a long time that entanglement is necessary to demonstrate nonclassical correlations, and hence a Bell inequality violation. However, since some entangled quantum states are known to admit explicit locally causal models, the exact role of entanglement in Bell inequality violation has remained obscure. This thesis provides both a comprehensive review on these issues as well as a report on new discoveries made to clarify the relationship between entanglement and Bell inequality violation. In particular, within the framework of a standard Bell experiment, i.e., a Bell inequality test that is directly performed on a single copy of a quantum state r, we have derived two algorithms to determine, respectively, a lower bound and an upper bound on the strength of correlations that r can offer for any given Bell inequality. Both of these algorithms make use convex optimization techniques in the form of a semidefinite program. By examples, we show that these algorithms can often be used in tandem, in conjunction with convexity arguments, to determine if a quantum state can offer nonclassical correlations and hence violates a given Bell inequality. On the other hand, since a standard Bell experiment typically involves measurements over many copies of the quantum systems, we have also investigated the possibility of enhancing the strength of nonclassical correlation by, instead, performing collective measurements on multiple copies of the quantum systems. Our findings show that even without postselection, such joint measurements may also lead to stronger nonclassical correlations, and hence a better Bell inequality violation. Meanwhile, previous studies have indicated that entangled state admitting locally causal models may still lead to observable nonclassical correlations if, prior to a standard Bell experiment, the state is subjected to some appropriate local preprocessing. This phenomenon of hidden nonlocality was discovered more than a decade ago, but to date, it is still not known if all entangled states can demonstrate nonclassical correlations through these more sophisticated Bell experiments. A key result in this thesis then consists of showing that for all bipartite entangled states, observable nonclassical correlations, in the form of a Bell-CHSH inequality violation, can indeed be derived if we allow both local preprocessing and the usage of shared ancillary state which by itself does not violate the Bell-CHSH inequality. This establishes a kind of equivalence between bipartite entanglement and states that cannot be simulated by classical correlations. In summary, for a standard Bell experiment where no local preprocessing on a quantum state r is allowed, we have provided two algorithms that can be used in tandem to determine if r can be simulated by a locally causal theory, whereas in the scenario where local preprocessing is allowed, we have demonstrated that bipartite entangled states are precisely those which cannot always be simulated classically.
In this short note, I derive the Bell-CHSH inequalities as an elementary result in the present-day theory of statistical causality based on graphical models or Bayes' nets, defined in terms of DAGs (Directed Acyclic Graphs) representing direct statistical causal influences between a number of observed and unobserved random variables. I show how spatio-temporal constraints in loophole-free Bell experiments, and natural classical statistical causality considerations, lead to Bell's notion of local hidden variables, and thence to the CHSH inequalities. The word “local” applies to the way that the chosen settings influence the observed outcomes. The case of contextual setting-dependent hidden variables (thought of as being located in the measurement devices and dependent on the measurement settings) is automatically covered, despite recent claims that Bell's conclusions can be circumvented in this way.
Bell's theorem in physics, as well as causal discovery in machine learning, both face the problem of deciding whether observed data is compatible with a presumed causal relationship between the variables (for example, a local hidden variable model). Traditionally, Bell inequalities have been used to describe the restrictions imposed by causal structures on marginal distributions. However, some structures give rise to non-convex constraints on the accessible data, and it has recently been noted that linear inequalities on the observable entropies capture these situations more naturally. In this paper, we show the versatility of the entropic approach by greatly expanding the set of scenarios for which entropic constraints are known. For the first time, we treat Bell scenarios involving multiple parties and multiple observables per party. Going beyond the usual Bell setup, we exhibit inequalities for scenarios with extra conditional independence assumptions, as well as a limited amount of shared randomness between the parties. Many of our results are based on a geometric observation: Bell polytopes for two-outcome measurements can be naturally imbedded into the convex cone of attainable marginal entropies. Thus, any entropic inequality can be translated into one valid for probabilities. In some situations the converse also holds, which provides us with a rich source of candidate entropic inequalities.