Standard Bell inequalities hold when distant parties are not allowed to communicate. Barrett et al. [Phys. Rev. A 75, 012103 (2007)] found correlations from Pauli measurements on certain network graphs to refute a local-hidden-variable (LHV) description, even allowing some communication along the graph. This has recently found applications in proving separation between classical and quantum computing, in terms of shallow circuits, and distributed computing. The correlations presented by Barrett et al. can be understood as coming from an extension of three party Greenberger-Horne-Zeilinger state correlations which can be embedded on a graph state. In this paper, we propose systematic extensions of any graph state, which we dub inflated graph states, such that they exhibit correlations which refute any communication-assisted LHV model. We further show the smallest possible such example, with a seven-qubit linear graph state, as well as specially crafted smaller examples with five and four qubits. The latter is the smallest possible violation using binary inputs and outputs.
Standard Bell inequalities hold when distant parties are not allowed to communicate. Barrett et al. [Phys. Rev. A 75, 012103 (2007)] found correlations from Pauli measurements on certain network graphs to refute a local-hidden-variable (LHV) description, even allowing some communication along the graph. This has recently found applications in proving separation between classical and quantum computing, in terms of shallow circuits, and distributed computing. The correlations presented by Barrett et al. can be understood as coming from an extension of three party Greenberger-Horne-Zeilinger state correlations which can be embedded on a graph state. In this paper, we propose systematic extensions of any graph state, which we dub inflated graph states, such that they exhibit correlations which refute any communication-assisted LHV model. We further show the smallest possible such example, with a seven-qubit linear graph state, as well as specially crafted smaller examples with five and four qubits. The latter is the smallest possible violation using binary inputs and outputs.
The possibility of preparing two-photon entangled states encoding three or more qubits in each photon leads to the following problem: If n quabits were distributed between two parties, which quantum pure states and qubit distributions would allow all-versus-nothing (or Greenberger-Horne-Zeilinger-like) proofs of Bell’s theorem using only single-qubit measurements? We show a necessary and sufficient condition for the existence of these proofs and provide all existing proofs up to n = 7 qubits. On the other hand, the possibility of preparing n -photon n -qubit graph states leads to the following problem: If n qubits were distributed between n parties, which would be the optimal Bell inequalities? We show all optimal n -party Bell inequalities for the perfect correlations of any graph state of n < 6 qubits. Optimal means that the ratio between the quantum violation and the bound for local hidden-variable theories is the maximum over all possible combinations of perfect correlations. This implies that the required detection efficiencies for loophole-free Bell tests are minimal.
A central aspect of quantum information is that correlations between spacelike separated observers sharing entangled states cannot be reproduced by local hidden variable (LHV) models, a phenomenon known as Bell nonlocality. If one wishes to explain such correlations by classical means, a natural possibility is to allow communication between the parties. In particular, LHV models augmented with two bits of classical communication can explain the correlations of any two-qubit state. Would this still hold if communication is restricted to measurement outcomes? While in certain scenarios with a finite number of inputs the answer is yes, we prove that if a model must reproduce all projective measurements, then for any qubit-qudit state the answer is no. In fact, a qubit-qudit under projective measurements admits an LHV model with outcome communication if and only if it already admits an LHV model without communication. On the other hand, we also show that when restricted sets of measurements are considered (for instance, when the qubit measurements are in the upper hemisphere of the Bloch ball), outcome communication does offer an advantage. This exemplifies that trivial properties in standard LHV scenarios, such as deterministic measurements and outcome-relabelling, play a crucial role in the outcome communication scenario.
Quantum mechanics is nonlocal, meaning it cannot be described by any classical local hidden variable model. In this thesis we study two aspects of quantum nonlocality. Part I addresses the question of what classical resources are required to simulate nonlocal quantum correlations. We start by constructing new local models for noisy entangled quantum states. These constructions exploit the connection between nonlocality and Grothendieck's inequality, first noticed by Tsirelson. Next, we consider local models augmented by a limited amount of classical communication. After generalizing Bell inequalities to this setting, we show that (i) one bit of communication is sufficient to simulate the correlations of projective measurements on a maximally entangled state of two qubits, and (ii) five bits of communication are sufficient to simulate the joint correlation of two-outcome measurements on any bipartite quantum state. The latter result can be interpreted as a stronger (constrained) version of Grothendieck's inequality. In part II, we investigate the monogamy of nonlocal correlations. In a setting where three parties, A, B, and C, share an entangled quantum state of arbitrary dimension, we: (i) bound the trade-off between AB's and AC's violation of the CHSH inequality, obtaining an intriguing generalization of Tsirelson's bound, and (ii) demonstrate that forcing B and C to be classically correlated prevents A and B from violating certain Bell inequalities. We study not only correlations that arise within quantum theory, but also arbitrary correlations that do not allow signaling between separate groups of parties. These results are based on new techniques for obtaining Tsirelson bounds, or bounds on the quantum value of a Bell inequality, and have applications to interactive proof systems and cryptography.
While entanglement and violation of Bell inequalities were initially thought to be equivalent quantum phenomena, we now have different examples of entangled states whose correlations can be described by local hidden--variable models and, therefore, do not violate any Bell inequality. We provide an up to date overview of the existing local hidden--variable models for entangled quantum states, both in the bipartite and multipartite case, and discuss some of the most relevant open questions in this context. Our review covers twenty five years of this line of research since the seminal work by Werner [R. F. Werner, Phys. Rev. A 40, 8 (1989)] providing the first example of an entangled state with a local model, which in turn appeared twenty five years after the seminal work by Bell [J. S. Bell, Physics 1, 195 (1964)], about the impossibility of recovering the predictions of quantum mechanics using a local hidden--variables theory.
It is known from Bellʼs theorem that quantum predictions for some entangled states cannot be mimicked using local hidden variable (LHV) models. From a computer science perspective, LHV models may be interpreted as classical computers operating on a potentially infinite number of correlated bits originating from a common source. As such, Bell inequality violations achieved through entangled states are able to characterize the quantum advantage of certain tasks, so long as the task itself imposes no restriction on the availability of correlated bits. However, if the number of shared bits is limited, additional constraints are placed on the possible LHV models, and separable, i.e. disentangled states may become a useful resource. Bell violations are therefore no longer necessary to achieve a quantum advantage. Here we show that, in particular, separable states improve the so-called random access codes, which is a class of communication problem wherein one party tries to read a portion of the data held by another distant party in the presence of finite shared randomness and limited classical communication. We also show how the bias of classical bits can be used to avoid wrong answers in order to achieve the optimal classical protocol and how the advantage of quantum protocols is linked to quantum discord.
Quantum mechanics admits correlations that cannot be explained by local realistic models. The most studied models are the standard local hidden variable models, which satisfy the well-known Bell inequalities. To date, most works have focused on bipartite entangled systems. We consider correlations between three parties connected via two independent entangled states. We investigate the new type of so-called "bilocal" models, which correspondingly involve two independent hidden variables. These models describe scenarios that naturally arise in quantum networks, where several independent entanglement sources are used. Using photonic qubits, we build such a linear three-node quantum network and demonstrate nonbilocal correlations by violating a Bell-like inequality tailored for bilocal models. Furthermore, we show that the demonstration of nonbilocality is more noise-tolerant than that of standard Bell nonlocality in our three-party quantum network.