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:1312.6290 · New Journal of Physics

Information-based measure of nonlocality

A. Montina, Stefan Wolf

Published Jan 20, 2016• 13 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1367-2630/18/1/013035

Related papers

Optimal measurements for nonlocal correlations

Sacha Schwarz, André Stefanov, Stefan Wolf +1 more

A problem in quantum information theory is to find the experimental setup that maximizes the nonlocality of correlations with respect to some suitable measure such as the violation of Bell inequalities. There are however some complications with Bell inequalities. First and foremost it is unfeasible to determine the whole set of Bell inequalities already for a few measurements and thus unfeasible to find the experimental setup maximizing their violation. Second, the Bell violation suffers from an ambiguity stemming from the choice of the normalization of the Bell coefficients. An alternative measure of nonlocality with a direct information-theoretic interpretation is the minimal amount of classical communication required for simulating nonlocal correlations. In the case of many instances simulated in parallel, the minimal communication cost per instance is called nonlocal capacity, and its computation can be reduced to a convex-optimization problem. This quantity can be computed for a higher number of measurements and turns out to be useful for finding the optimal experimental setup. Focusing on the bipartite case, we present a simple method for maximizing the nonlocal capacity over a given configuration space and, in particular, over a set of possible measurements, yielding the corresponding optimal setup. Furthermore, we show that there is a functional relationship between Bell violation and nonlocal capacity. The method is illustrated with numerical tests and compared with the maximization of the violation of CGLMP-type Bell inequalities on the basis of entangled two-qubit as well as two-qutrit states. Remarkably, the anomaly of nonlocality displayed by qutrits turns out to be even stronger if the nonlocal capacity is employed as a measure of nonlocality.

arXiv:1602.05448•Physical Review A•Aug 18, 2016•5 citations

Quantifying quantum nonlocality

Ben Toner

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.

•Aug 12, 2013•3 citations

Bounding Two-Way Average Communication Cost of Simulating Quantum Correlations

Kai-Siang Chen, Gelo Noel M. Tabia, Bo-An Tsai +2 more

Bell nonlocal correlations cannot be reproduced by local hidden-variable models without communication, making classical communication cost a natural quantitative measure of nonlocality. Although finite communication always suffices to simulate any correlation in a fixed finite Bell scenario, determining the minimum amount needed to (exactly) simulate any given nonlocal correlation remains challenging, especially in the average-cost setting. Here, we derive lower bounds on input-average communication cost from nonlocal games, allowing variable-length, fully interactive two-way protocols. When applied to parallel games, these bounds yield explicit finite quantum correlations for which the exact simulation cost exceeds any prescribed finite input-average communication budget. For $n$ parallel Magic-Square-winning correlations, we prove a lower bound of $n\log_2(3/2)$ bits and give a one-way communication protocol that attains this rate asymptotically. For the quantum correlation maximally winning the $n$-copy of the Clauser--Horne--Shimony--Holt nonlocal game, we obtain an input-average lower bound of approximately $0.04627n$ bits for exact simulation. Finally, we formulate a hierarchy of lower bounds and complementary upper bounds using deterministic correlations up to chosen communication costs. Both recover the exact input-average cost at their final levels, and if the bounds agree at lower levels, their common value yields the exact input-average cost without needing to consider all communication strategies.

quant-pharXiv:2610.04648•Oct 6, 2026•0 citations

Tensor norms and the classical communication complexity of nonlocal quantum measurement

Yaoyun Shi

Nonlocality is at the heart of quantum information processing. In this paper we investigate the minimum amount of classical communication required to simulate a nonlocal quantum measurement. We derive general upper bounds, which in turn translate to systematic classical simulations of quantum communication protocols.As a concrete application, we prove that any quantum communication protocol with shared entanglement for computing a Boolean function can be simulated by a classical protocol whose cost does not depend on the amount of the shared entanglement. This implies that if the cost of communication is a constant, quantum and classical protocols, with shared entanglement and shared coins, respectively, compute the same class of functions.Furthermore, we describe a new class of efficient quantum communication protocols based on fast quantum algorithms. While some of them have efficient classical simulations by our method, others appear to be good candidates for separating quantum v.s. classical protocols, and quantum protocols with v.s. without shared entanglement.Yet another application is in the context of simulating quantum correlations using local hidden variable models augmented with classical communications. We give a constant cost, approximate simulation of quantum correlations when the number of correlated variables is a constant, while the dimension of the entanglement and the number of possible measurements can be arbitrary.Our upper bounds are expressed in terms of some tensor norms on the measurement operator. Those norms capture the nonlocality of bipartite operators in their own way and may be of independent interest and further applications.

ACM Symposium on Theory of Computing (STOC)•May 22, 2005•4 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

Violations of Bell inequalities as lower bounds on the communication cost of nonlocal correlations

Stefano Pironio

To reproduce in a local hidden variables theory correlations that violate Bell inequalities, communication must occur between the parties. We show that the amount of violation of a Bell inequality imposes a lower bound on the average communication needed to produce these correlations. Moreover, for every probability distribution there exists an optimal inequality for which the degree of violation gives the minimal average communication. As an example, to produce using classical resources the correlations that maximally violate the Clauser-Horne-Shimony-Holt inequality, $\sqrt{2}\ensuremath{-}1\ensuremath{\simeq}0.4142$ bits of communication are necessary and sufficient. For Bell tests performed on two entangled states of dimension $d>~3$ where each party has the choice between two measurements, our results suggest that more communication is needed to simulate outcomes obtained from certain nonmaximally entangled states than maximally entangled ones.

arXiv:quant-ph/0304176•Physical Review A•Dec 4, 2003•70 citations
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.
A problem in quantum information theory is to find the experimental setup that maximizes the nonlocality of correlations with respect to some suitable measure such as the violation of Bell inequalities. There are however some complications with Bell inequalities. First and foremost it is unfeasible to determine the whole set of Bell inequalities already for a few measurements and thus unfeasible to find the experimental setup maximizing their violation. Second, the Bell violation suffers from an ambiguity stemming from the choice of the normalization of the Bell coefficients. An alternative measure of nonlocality with a direct information-theoretic interpretation is the minimal amount of classical communication required for simulating nonlocal correlations. In the case of many instances simulated in parallel, the minimal communication cost per instance is called nonlocal capacity, and its computation can be reduced to a convex-optimization problem. This quantity can be computed for a higher number of measurements and turns out to be useful for finding the optimal experimental setup. Focusing on the bipartite case, we present a simple method for maximizing the nonlocal capacity over a given configuration space and, in particular, over a set of possible measurements, yielding the corresponding optimal setup. Furthermore, we show that there is a functional relationship between Bell violation and nonlocal capacity. The method is illustrated with numerical tests and compared with the maximization of the violation of CGLMP-type Bell inequalities on the basis of entangled two-qubit as well as two-qutrit states. Remarkably, the anomaly of nonlocality displayed by qutrits turns out to be even stronger if the nonlocal capacity is employed as a measure of nonlocality.
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.
Bell nonlocal correlations cannot be reproduced by local hidden-variable models without communication, making classical communication cost a natural quantitative measure of nonlocality. Although finite communication always suffices to simulate any correlation in a fixed finite Bell scenario, determining the minimum amount needed to (exactly) simulate any given nonlocal correlation remains challenging, especially in the average-cost setting. Here, we derive lower bounds on input-average communication cost from nonlocal games, allowing variable-length, fully interactive two-way protocols. When applied to parallel games, these bounds yield explicit finite quantum correlations for which the exact simulation cost exceeds any prescribed finite input-average communication budget. For nnn parallel Magic-Square-winning correlations, we prove a lower bound of nlog⁡2(3/2)n\log_2(3/2)nlog2​(3/2) bits and give a one-way communication protocol that attains this rate asymptotically. For the quantum correlation maximally winning the nnn-copy of the Clauser--Horne--Shimony--Holt nonlocal game, we obtain an input-average lower bound of approximately 0.04627n0.04627n0.04627n bits for exact simulation. Finally, we formulate a hierarchy of lower bounds and complementary upper bounds using deterministic correlations up to chosen communication costs. Both recover the exact input-average cost at their final levels, and if the bounds agree at lower levels, their common value yields the exact input-average cost without needing to consider all communication strategies.
Nonlocality is at the heart of quantum information processing. In this paper we investigate the minimum amount of classical communication required to simulate a nonlocal quantum measurement. We derive general upper bounds, which in turn translate to systematic classical simulations of quantum communication protocols.As a concrete application, we prove that any quantum communication protocol with shared entanglement for computing a Boolean function can be simulated by a classical protocol whose cost does not depend on the amount of the shared entanglement. This implies that if the cost of communication is a constant, quantum and classical protocols, with shared entanglement and shared coins, respectively, compute the same class of functions.Furthermore, we describe a new class of efficient quantum communication protocols based on fast quantum algorithms. While some of them have efficient classical simulations by our method, others appear to be good candidates for separating quantum v.s. classical protocols, and quantum protocols with v.s. without shared entanglement.Yet another application is in the context of simulating quantum correlations using local hidden variable models augmented with classical communications. We give a constant cost, approximate simulation of quantum correlations when the number of correlated variables is a constant, while the dimension of the entanglement and the number of possible measurements can be arbitrary.Our upper bounds are expressed in terms of some tensor norms on the measurement operator. Those norms capture the nonlocality of bipartite operators in their own way and may be of independent interest and further applications.
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.
To reproduce in a local hidden variables theory correlations that violate Bell inequalities, communication must occur between the parties. We show that the amount of violation of a Bell inequality imposes a lower bound on the average communication needed to produce these correlations. Moreover, for every probability distribution there exists an optimal inequality for which the degree of violation gives the minimal average communication. As an example, to produce using classical resources the correlations that maximally violate the Clauser-Horne-Shimony-Holt inequality, $\sqrt{2}\ensuremath{-}1\ensuremath{\simeq}0.4142$ bits of communication are necessary and sufficient. For Bell tests performed on two entangled states of dimension d> 3d>~3d> 3 where each party has the choice between two measurements, our results suggest that more communication is needed to simulate outcomes obtained from certain nonmaximally entangled states than maximally entangled ones.