Quantum information leverages correlations between spacelike separated parties in order to perform useful tasks such as secure communication and randomness certification. Nevertheless, not much is known about the intricate geometric features of the set quantum correlators. In this paper we study the structure of the set of quantum correlators using semidefinite programming, more precisely the boundary, extreme, and exposed points. We obtain quantum Bell inequalities characterizing a certain class of bipartite scenarios. In the case of two dichotomic measurements, extremal quantum correlators coincide with the correlators that uniquely determine the state and measurement operators, a property known as self-testing. We illustrate the usefulness of our theoretical findings with many examples and extensive computational work.
Quantum information leverages correlations between spacelike separated parties in order to perform useful tasks such as secure communication and randomness certification. Nevertheless, not much is known about the intricate geometric features of the set quantum correlators. In this paper we study the structure of the set of quantum correlators using semidefinite programming, more precisely the boundary, extreme, and exposed points. We obtain quantum Bell inequalities characterizing a certain class of bipartite scenarios. In the case of two dichotomic measurements, extremal quantum correlators coincide with the correlators that uniquely determine the state and measurement operators, a property known as self-testing. We illustrate the usefulness of our theoretical findings with many examples and extensive computational work.
In device-independent quantum information, correlations between local measurement outcomes observed by spatially separated parties in a Bell test play a fundamental role. Even though it is long-known that the set of correlations allowed in quantum theory lies strictly between the Bell-local set and the no-signaling set, many questions concerning the geometry of the quantum set remain unanswered. Here, we revisit the problem of when the boundary of the quantum set coincides with the no-signaling set in the simplest Bell scenario. In particular, for each Class of these common boundaries containing k zero probabilities, we provide a (5−k) -parameter family of quantum strategies realizing these (extremal) correlations. We further prove that self-testing is possible in all nontrivial Classes beyond the known examples of Hardy-type correlations, and provide numerical evidence supporting the robustness of these self-testing results. Candidates of one-parameter families of self-testing correlations from some of these Classes are identified. As a byproduct of our investigation, if the qubit strategies leading to an extremal nonlocal correlation are local-unitarily equivalent, a self-testing statement provably follows. Interestingly, all these self-testing correlations found on the no-signaling boundary are provably non-exposed. An analogous characterization for the set M of quantum correlations arising from finite-dimensional maximally entangled states is also provided. En route to establishing this last result, we show that all correlations of M in the simplest Bell scenario are attainable as convex combinations of those achievable using a Bell pair and projective measurements. In turn, we obtain the maximal Clauser-Horne-Shimony-Holt Bell inequality violation by any maximally entangled two-qudit state and a no-go theorem regarding the self-testing of such states.
Abstract Quantum nonlocality has recently been intensively studied in connection to device-independent quantum information processing, where the extremal points of the set of quantum correlations play a crucial role through self-testing. In most protocols, the proofs for self-testing rely on the maximal violation of the Bell inequalities, but there is another known proof based on the geometry of state vectors to self-test a maximally entangled state. We present a geometrical proof in the case of partially entangled states. We show that, when a set of correlators in the simplest Bell scenario satisfies a condition, the geometry of the state vectors is uniquely determined. The realization becomes self-testable when another unitary observable exists on the geometry. Applying this proven fact, we propose self-testing protocols by intentionally adding one more measurement. This geometrical scheme for self-testing is superior in that, by using this as a building block and repeatedly adding measurements, a realization with an arbitrary number of measurements can be self-tested. Besides the application, we also attempt to describe nonlocal correlations by guessing probabilities of distant measurement outcomes. In this description, the quantum set is also convex, and a large class of extremal points is identified by the uniqueness of the geometry.
Bell inequalities reveal the fundamentally nonlocal character of quantum mechanics. In this regard, one of the interesting problems is to explore all possible Bell inequalities that demonstrate a gap between local and nonlocal quantum behaviour. This is useful for the geometric characterisation of the set of nonlocal correlations achievable within quantum theory. Moreover, it provides a systematic way to construct Bell inequalities that are tailored to specific quantum information processing tasks. This characterisation is well understood in the simplest (2,2,2) scenario, namely two parties performing two binary outcome measurements. However, beyond this setting, relatively few Bell inequalities are known, and the situation becomes particularly scarce in scenarios involving a greater number of outcomes. Here, we consider the (2,2,3) scenario, or two parties performing two three-outcome measurements, and characterise all Bell inequalities that can arise from the simplest sum-of-squares decomposition and are maximally violated by the maximally entangled state of local dimension three. We then utilise them to self-test this state, along with a class of three-outcome measurements.
Quantum nonlocality has recently been intensively studied in connection to device-independent quantum information processing, where the extremal points of the set of quantum correlations play a crucial role through self-testing. In most protocols, the proofs for self-testing rely on the maximal violation of the Bell inequalities, but there is another known proof based on the geometry of state vectors for self-testing a maximally entangled state. We extend the geometrical proof to the case of partially entangled states. We show that, when a set of correlators in the simplest Bell scenario satisfies a condition, the geometry of the state vectors of the realization is uniquely determined. However, the realization becomes self-testable only when another unitary observable exists on the geometry. Applying this result, we propose self-testing protocols by intentionally adding one more measurement. This geometrical scheme for self-testing is superior in that, by using this as a building block and repeatedly adding measurements, a realization with an arbitrary number of measurements can be self-tested. Besides the application, we also attempt to describe nonlocal correlations by guessing probabilities of distant measurement outcomes. In this description, the quantum set is also convex, and a large class of extremal points is identified by the uniqueness of the geometry.
Consider a scenario where N separated quantum systems are measured, each with one among two possible dichotomic observables. Assume that the N events corresponding to the choice and performance of the measurement in each site are space-like separated. In the present paper, the correlations among the measurement outcomes that arise in this scenario are analyzed. It is shown that all extreme points of this convex set are attainable by measuring N-qubit pure-states with projective observables. This result allows the possibility of using known algorithms in order decide whether some correlations are achievable within quantum mechanics or not. It is also proven that if an N-partite state ρ violates a given Bell inequality, then, ρ can be transformed by stochastic local operations into an N-qubit state that violates the same Bell inequality by an equal or larger amount.
In the minimal scenario of quantum correlations, two parties can choose from two observables with two possible outcomes each. Probabilities are specified by four marginals and four correlations. The resulting four-dimensional convex body of correlations, denoted Q , is fundamental for quantum information theory. We review and systematize what is known about Q , and add many details, visualizations, and complete proofs. In particular, we provide a detailed description of the boundary, which consists of three-dimensional faces isomorphic to elliptopes and sextic algebraic manifolds of exposed extreme points. These patches are separated by cubic surfaces of non-exposed extreme points. We provide a trigonometric parametrization of all extreme points, along with their exposing Tsirelson inequalities and quantum models. All non-classical extreme points (exposed or not) are self-testing, i.e., realized by an essentially unique quantum model.Two principles, which are specific to the minimal scenario, allow a quick and complete overview: The first is the pushout transformation, i.e., the application of the sine function to each coordinate. This transforms the classical correlation polytope exactly into the correlation body Q , also identifying the boundary structures. The second principle, self-duality, is an isomorphism between Q and its polar dual, i.e., the set of affine inequalities satisfied by all quantum correlations (“Tsirelson inequalities''). The same isomorphism links the polytope of classical correlations contained in Q to the polytope of no-signalling correlations, which contains Q .We also discuss the sets of correlations achieved with fixed Hilbert space dimension, fixed state or fixed observables, and establish a new non-linear inequality for Q involving the determinant of the correlation matrix.