Bell's test, initially devised to distinguish quantum theory from local hidden variable models through {violations of local bounds}, is also a common tool for detecting entanglement. For this purpose, one can assume the quantum description of devices and use available information to strengthen the bound for separable states, which may go beyond the local bound, enabling more efficient entanglement detection. Here we present a systematic approach for strengthening Bell inequalities for qubit systems, using Mermin-Klyshko-Bell inequalities as examples, by considering measurement devices that are coarsely calibrated only by their ability to generate nonlocal correlations without requiring precise quantum characterization. In the case of bipartite and tripartite systems, we derive trade-offs between upper bounds for separable states and general states in terms of structure functions to optimize the entanglement detection. We then strengthen $n$-partite Bell inequalities for the detection of states exhibiting a diversity of entanglement structures such as genuine multipartite entanglement. For general Bell scenarios with some measurements characterized, we demonstrate that entanglement can also be detected with some local correlations by exploiting the Navascués-Pironio-Acín hierarchy of tests.
Bell's test, initially devised to distinguish quantum theory from local hidden variable models through {violations of local bounds}, is also a common tool for detecting entanglement. For this purpose, one can assume the quantum description of devices and use available information to strengthen the bound for separable states, which may go beyond the local bound, enabling more efficient entanglement detection. Here we present a systematic approach for strengthening Bell inequalities for qubit systems, using Mermin-Klyshko-Bell inequalities as examples, by considering measurement devices that are coarsely calibrated only by their ability to generate nonlocal correlations without requiring precise quantum characterization. In the case of bipartite and tripartite systems, we derive trade-offs between upper bounds for separable states and general states in terms of structure functions to optimize the entanglement detection. We then strengthen n-partite Bell inequalities for the detection of states exhibiting a diversity of entanglement structures such as genuine multipartite entanglement. For general Bell scenarios with some measurements characterized, we demonstrate that entanglement can also be detected with some local correlations by exploiting the Navascués-Pironio-Acín hierarchy of tests.
Bell inequalities were meant to test quantum mechanics vs local hidden variable models, but can also be used to verify entanglement. For entanglement verification purposes one assumes the validity of quantum mechanics as well as quantum descriptions of one's measurements. With the help of these assumptions it is possible to derive a strengthened Bell inequality whose violation implies entanglement. We generalize known examples of such inequalities by relating the expectation value of the Bell operator to a particular quantitative measure of entanglement, namely, the negativity. Moreover, we obtain statistics illustrating the fact that violating a given (strengthened or not) Bell inequality is a much more rare feat for a quantum state of two qubits than it is to be entangled.
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.
Bell inequality tests where the detection efficiency is below a certain threshold ηcrit can be simulated with local hidden-variable models. Here, we introduce a method to identify Bell tests requiring low ηcrit and relatively low dimension d of the local quantum systems. The method has two steps. First, we show a family of bipartite Bell inequalities for which, for correlations produced by maximally entangled states, ηcrit can be upper bounded by a function of some invariants of graphs, and use it to identify correlations that require small ηcrit . We present examples in which, for maximally entangled states, ηcrit≤0.516 for d=16 , ηcrit≤0.407 for d=28 , and ηcrit≤0.326 for d=32 . We also show evidence that the upper bound for ηcrit can be lowered down to 0.415 for d=16 and present a method to make the upper bound of ηcrit arbitrarily small by increasing the dimension and the number of settings. All these upper bounds for ηcrit are valid (as it is the case in the literature) assuming no noise. The second step is based on the observation that, using the initial state and measurement settings identified in the first step, we can construct Bell inequalities with smaller ηcrit and better noise robustness. For that, we use a modified version of Gilbert's algorithm that takes advantage of the automorphisms of the graphs used in the first step. We illustrate its power by explicitly developing an example in which ηcrit is 12.38% lower and the required visibility is 14.62% lower than the upper bounds obtained in the first step. The tools presented here may allow for developing high-dimensional loophole-free Bell tests and loophole-free Bell nonlocality over long distances.
Bell-inequality violation is one of the most widely known manifestations of entanglement in quantum mechanics; indicating that experiments on physically separated quantum mechanical systems cannot be given a local realistic description. However, despite the importance of Bell inequalities, it is not known in general how to determine whether a given entangled state will violate a Bell inequality. This is because one can choose to make many different measurements on a quantum system to test any given Bell inequality and the optimization over measurements is a high-dimensional variational problem. In order to better understand this problem we present algorithms that provide, for a given quantum state and Bell inequality, both a lower bound and an upper bound on the maximal violation of the inequality. In many cases these bounds determine measurements that would demonstrate violation of the Bell inequality or provide a bound that rules out the possibility of a violation. Both bounds apply techniques from convex optimization and the methodology for creating upper bounds allows them to be systematically improved. Examples are given to illustrate how these algorithms can be used to conclude definitively if some quantum states violate a given Bell inequality.
We provide a novel criterion for identifying quantum correlation, which allows us to find connections between Bell type inequalities, entanglement detection, and correlation. We utilize the criterion to construct witness operators that can detect genuine multi-qubit entanglement with fewer local measurements. The connection between identifications of quantum correlation and Mermin's inequality is discussed. Detection of genuine four-level tripartite entanglement with two local measurement settings is shown in the same manner. Further, through the criterion of quantum correlation, we derive a new Bell inequality for arbitrary high-dimensional bipartite systems, which requires fewer analyses of the measured outcomes.
No-signaling theories, which can contain nonlocal correlations stronger than quantum correlations but limited by the no-signaling condition, have deepened our understanding of the quantum theory. In practice, Bell tests are powerful tools to certify nonlocality, but their effectiveness is limited by the detector efficiency. In this work, we provide almost tight detection efficiency bounds for showing the nonlocality of no-signaling theories, by introducing a general class of Bell inequalities. In particular, we provide a tight bound for the bipartite case and an asymptotic tight bound for the multipartite case. The tightness of these bounds shows that they well characterize the structure of no-signaling theories. The bounds also imply that the detector efficiency requirement can be made arbitrarily low in both bipartite and multipartite cases by increasing the number of measurement settings. Furthermore, our work sheds light on the detector efficiency requirement for showing the nonlocality of the quantum theory.