Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0506182 · Physical Review A

Interconversion of nonlocal correlations

Nick S. Jones, Lluís Masanes

Published Nov 11, 2005• 135 citations
arXivHTMLPDF

Abstract

In this paper, we study the correlations that arise when two separated parties perform measurements on systems they hold locally. We restrict ourselves to those correlations with which arbitrarily fast transmission of information is impossible. These correlations are called nonsignaling. We allow the measurements to be chosen from sets of an arbitrary size, but promise that each measurement has only two possible outcomes. We find the structure of this convex set of nonsignaling correlations by characterizing its extreme points. Taking an information-theoretic view, we prove that all of these extreme correlations are interconvertible. This suggests that the simplest extremal nonlocal distribution (called a PR box) might be the basic unit of bipartite nonlocality. We also show that this unit of nonlocality is sufficient to simulate all bipartite quantum states when measured with two outcome measurements.

DOI
10.1103/physreva.72.052312

Related papers

Bipartite units of nonlocality

Manuel Förster, Stefan Wolf

Imagine a task in which a group of separated players aim to simulate a statistic that violates a Bell inequality. Given measurement choices the players shall announce an output based solely on the results of local operations---which they can discuss before the separation---on shared random data and shared copies of a so-called unit correlation. In the first part of this paper we show that in such a setting the simulation of any bipartite correlation, not containing the possibility of signaling, can be made arbitrarily accurate by increasing the number of shared Popescu-Rohrlich (PR) boxes. This establishes the PR box as a simple asymptotic unit of bipartite nonlocality. In the second part we study whether this property extends to the multipartite case. More generally, we ask if it is possible for separated players to asymptotically reproduce any nonsignaling statistic by local operations on bipartite unit correlations. We find that nonadaptive strategies are limited by a constant accuracy and that arbitrary strategies on $n$ resource correlations make a mistake with a probability greater or equal to $c/n$, for some constant $c$.

arXiv:0808.0651•Physical Review A•Oct 12, 2011•21 citations

Nonlocal correlations as an information-theoretic resource

Jonathan Barrett, Noah Linden, Serge Massar +3 more

It is well known that measurements performed on spatially separated entangled quantum systems can give rise to correlations that are nonlocal, in the sense that a Bell inequality is violated. They cannot, however, be used for superluminal signaling. It is also known that it is possible to write down sets of ``superquantum'' correlations that are more nonlocal than is allowed by quantum mechanics, yet are still nonsignaling. Viewed as an information-theoretic resource, superquantum correlations are very powerful at reducing the amount of communication needed for distributed computational tasks. An intriguing question is why quantum mechanics does not allow these more powerful correlations. We aim to shed light on the range of quantum possibilities by placing them within a wider context. With this in mind, we investigate the set of correlations that are constrained only by the no-signaling principle. These correlations form a polytope, which contains the quantum correlations as a (proper) subset. We determine the vertices of the no-signaling polytope in the case that two observers each choose from two possible measurements with $d$ outcomes. We then consider how interconversions between different sorts of correlations may be achieved. Finally, we consider some multipartite examples.

arXiv:quant-ph/0404097•Physical Review A•Feb 2, 2005•627 citations

Extent of multiparticle quantum nonlocality

Nick S. Jones, Noah Linden, Serge Massar

It is well known that entangled quantum states are nonlocal: the corrrelations between local measurements carried out on these states cannot be reproduced by local hidden variable models. Svetlichny, followed by others, showed that multipartite quantum states are more nonlocal than bipartite ones in the sense that even some nonlocal classical models with (super-luminal) communication between some of the parties cannot reproduce the quantum correlations. Here we study in detail the kinds of nonlocality present in quantum states. More precisely, we enquire what kinds of classical communication patterns cannot reproduce quantum correlations. By studying the extremal points of the space of all multiparty probability distributions, in which all parties can make one of a pair of measurements each with two possible outcomes, we find a necessary condition for classical nonlocal models to reproduce the statistics of all quantum states. This condition extends and generalizes work of Svetlichny and others in which it was showed that a particular class of classical nonlocal models, the ``separable'' models, cannot reproduce the statistics of all multiparticle quantum states. Our condition shows that the nonlocality present in some entangled multiparticle quantum states is much stronger than previously thought. We also study the sufficiency of our condition.

arXiv:quant-ph/0407018•Physical Review A•Apr 19, 2005•51 citations

Characterization of nonsignaling correlations from mutual information

Ignacio Perito, Guido Bellomo, Daniel Galicer +3 more

We present a characterization of the set of nonsignaling correlations in terms of a two-dimensional representation that involves the maximal value of a Bell functional and the mutual information between the parties. In particular, we apply this representation to the bipartite Bell scenario with two measurements and two outcomes. In terms of these physically meaningful quantities and through numerical optimization methods and some analytical results, we investigate the frontier between the different subsets of the nonsignaling correlations, focusing on the quantum and postquantum ones. Our analysis exhibits that there is a trade-off between the amount of classical correlations existing between the parties and the magnitude of the violation of a given Bell inequality. Notably, the Tsirelson bound appears as a singular point of this trade-off without resorting to quantum mechanics.

arXiv:2010.04795•Physical Review A•Jun 17, 2021•0 citations

Nonlocality under Computational Assumptions

Khashayar Barooti, Alexandru Gheorghiu, Grzegorz Głuch +1 more

Nonlocality and its connections to entanglement are fundamental features of quantum mechanics that have found numerous applications in quantum information science. A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. An important practical consideration is that the runtime of the parties has to be shorter than the time it takes light to travel between them. One way to model this restriction is to assume that the parties are computationally bounded. We therefore initiate the study of nonlocality under computational assumptions and derive the following results: (a) We define the set $\mathsf{NeL}$ (not-efficiently-local) as consisting of all bipartite states whose correlations arising from local measurements cannot be reproduced with shared randomness and \emph{polynomial-time} local operations. (b) Under the assumption that the Learning With Errors problem cannot be solved in \emph{quantum} polynomial-time, we show that $\mathsf{NeL}=\mathsf{ENT}$, where $\mathsf{ENT}$ is the set of \emph{all} bipartite entangled states (pure and mixed). This is in contrast to the standard notion of nonlocality where it is known that some entangled states, e.g. Werner states, are local. In essence, we show that there exist (efficient) local measurements producing correlations that cannot be reproduced through shared randomness and quantum polynomial-time computation. (c) We prove that if $\mathsf{NeL}=\mathsf{ENT}$ unconditionally, then $\mathsf{BQP}\neq\mathsf{PP}$. In other words, the ability to certify all bipartite entangled states against computationally bounded adversaries gives a non-trivial separation of complexity classes. (d) Using (c), we show that a certain natural class of 1-round delegated quantum computation protocols that are sound against $\mathsf{PP}$ provers cannot exist.

arXiv:2303.02080•Mar 3, 2023•1 citation

Information-based measure of nonlocality

A. Montina, Stefan Wolf

Quantum nonlocality concerns correlations among spatially separated systems that cannot be explained classically without communication among the parties. Thus, a natural measure of nonlocal correlations is provided by the minimal amount of communication required for classically simulating them. In this paper, we present a method to compute the minimal communication cost of parallel simulations, which we call nonlocal capacity, for any general nonsignaling correlations. This measure turns out to have an important role in communication complexity and can be used to discriminate between local and nonlocal correlations, as an alternative to the violation of Bell's inequalities.

arXiv:1312.6290•New Journal of Physics•Jan 20, 2016•13 citations
In this paper, we study the correlations that arise when two separated parties perform measurements on systems they hold locally. We restrict ourselves to those correlations with which arbitrarily fast transmission of information is impossible. These correlations are called nonsignaling. We allow the measurements to be chosen from sets of an arbitrary size, but promise that each measurement has only two possible outcomes. We find the structure of this convex set of nonsignaling correlations by characterizing its extreme points. Taking an information-theoretic view, we prove that all of these extreme correlations are interconvertible. This suggests that the simplest extremal nonlocal distribution (called a PR box) might be the basic unit of bipartite nonlocality. We also show that this unit of nonlocality is sufficient to simulate all bipartite quantum states when measured with two outcome measurements.
Imagine a task in which a group of separated players aim to simulate a statistic that violates a Bell inequality. Given measurement choices the players shall announce an output based solely on the results of local operations---which they can discuss before the separation---on shared random data and shared copies of a so-called unit correlation. In the first part of this paper we show that in such a setting the simulation of any bipartite correlation, not containing the possibility of signaling, can be made arbitrarily accurate by increasing the number of shared Popescu-Rohrlich (PR) boxes. This establishes the PR box as a simple asymptotic unit of bipartite nonlocality. In the second part we study whether this property extends to the multipartite case. More generally, we ask if it is possible for separated players to asymptotically reproduce any nonsignaling statistic by local operations on bipartite unit correlations. We find that nonadaptive strategies are limited by a constant accuracy and that arbitrary strategies on nnn resource correlations make a mistake with a probability greater or equal to c/nc/nc/n, for some constant ccc.
It is well known that measurements performed on spatially separated entangled quantum systems can give rise to correlations that are nonlocal, in the sense that a Bell inequality is violated. They cannot, however, be used for superluminal signaling. It is also known that it is possible to write down sets of ``superquantum'' correlations that are more nonlocal than is allowed by quantum mechanics, yet are still nonsignaling. Viewed as an information-theoretic resource, superquantum correlations are very powerful at reducing the amount of communication needed for distributed computational tasks. An intriguing question is why quantum mechanics does not allow these more powerful correlations. We aim to shed light on the range of quantum possibilities by placing them within a wider context. With this in mind, we investigate the set of correlations that are constrained only by the no-signaling principle. These correlations form a polytope, which contains the quantum correlations as a (proper) subset. We determine the vertices of the no-signaling polytope in the case that two observers each choose from two possible measurements with ddd outcomes. We then consider how interconversions between different sorts of correlations may be achieved. Finally, we consider some multipartite examples.
It is well known that entangled quantum states are nonlocal: the corrrelations between local measurements carried out on these states cannot be reproduced by local hidden variable models. Svetlichny, followed by others, showed that multipartite quantum states are more nonlocal than bipartite ones in the sense that even some nonlocal classical models with (super-luminal) communication between some of the parties cannot reproduce the quantum correlations. Here we study in detail the kinds of nonlocality present in quantum states. More precisely, we enquire what kinds of classical communication patterns cannot reproduce quantum correlations. By studying the extremal points of the space of all multiparty probability distributions, in which all parties can make one of a pair of measurements each with two possible outcomes, we find a necessary condition for classical nonlocal models to reproduce the statistics of all quantum states. This condition extends and generalizes work of Svetlichny and others in which it was showed that a particular class of classical nonlocal models, the ``separable'' models, cannot reproduce the statistics of all multiparticle quantum states. Our condition shows that the nonlocality present in some entangled multiparticle quantum states is much stronger than previously thought. We also study the sufficiency of our condition.
We present a characterization of the set of nonsignaling correlations in terms of a two-dimensional representation that involves the maximal value of a Bell functional and the mutual information between the parties. In particular, we apply this representation to the bipartite Bell scenario with two measurements and two outcomes. In terms of these physically meaningful quantities and through numerical optimization methods and some analytical results, we investigate the frontier between the different subsets of the nonsignaling correlations, focusing on the quantum and postquantum ones. Our analysis exhibits that there is a trade-off between the amount of classical correlations existing between the parties and the magnitude of the violation of a given Bell inequality. Notably, the Tsirelson bound appears as a singular point of this trade-off without resorting to quantum mechanics.
Nonlocality and its connections to entanglement are fundamental features of quantum mechanics that have found numerous applications in quantum information science. A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. An important practical consideration is that the runtime of the parties has to be shorter than the time it takes light to travel between them. One way to model this restriction is to assume that the parties are computationally bounded. We therefore initiate the study of nonlocality under computational assumptions and derive the following results: (a) We define the set NeL\mathsf{NeL}NeL (not-efficiently-local) as consisting of all bipartite states whose correlations arising from local measurements cannot be reproduced with shared randomness and \emph{polynomial-time} local operations. (b) Under the assumption that the Learning With Errors problem cannot be solved in \emph{quantum} polynomial-time, we show that NeL=ENT\mathsf{NeL}=\mathsf{ENT}NeL=ENT, where ENT\mathsf{ENT}ENT is the set of \emph{all} bipartite entangled states (pure and mixed). This is in contrast to the standard notion of nonlocality where it is known that some entangled states, e.g. Werner states, are local. In essence, we show that there exist (efficient) local measurements producing correlations that cannot be reproduced through shared randomness and quantum polynomial-time computation. (c) We prove that if NeL=ENT\mathsf{NeL}=\mathsf{ENT}NeL=ENT unconditionally, then BQP≠PP\mathsf{BQP}\neq\mathsf{PP}BQP=PP. In other words, the ability to certify all bipartite entangled states against computationally bounded adversaries gives a non-trivial separation of complexity classes. (d) Using (c), we show that a certain natural class of 1-round delegated quantum computation protocols that are sound against PP\mathsf{PP}PP provers cannot exist.
Quantum nonlocality concerns correlations among spatially separated systems that cannot be explained classically without communication among the parties. Thus, a natural measure of nonlocal correlations is provided by the minimal amount of communication required for classically simulating them. In this paper, we present a method to compute the minimal communication cost of parallel simulations, which we call nonlocal capacity, for any general nonsignaling correlations. This measure turns out to have an important role in communication complexity and can be used to discriminate between local and nonlocal correlations, as an alternative to the violation of Bell's inequalities.