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

Tsirelson's bound from a generalized data processing inequality

Oscar Dahlsten, Daniel Lercher, Renato Renner

Published Jun 18, 2012• 30 citations
arXivHTMLPDF

Abstract

The strength of quantum correlations is bounded from above by Tsirelson's bound. We establish a connection between this bound and the fact that correlations between two systems cannot increase under local operations, a property known as the data processing inequality (DPI). More specifically, we consider arbitrary convex probabilistic theories. These can be equipped with an entropy measure that naturally generalizes the von Neumann entropy, as shown recently in Short and Wehner (2010 New J. Phys. 12 033023) and Barnum et al (2010 New J. Phys. 12 033024). We prove that if the DPI holds with respect to this generalized entropy measure then the underlying theory necessarily respects Tsirelson's bound. We, moreover, generalize this statement to any entropy measure satisfying certain minimal requirements. A consequence of our result is that not all the entropic relations used for deriving Tsirelson's bound via information causality in Pawlowski et al (2009 Nature 461 1101–4) are necessary.

DOI
10.1088/1367-2630/14/6/063024

Related papers

An intuitive proof of the data processing inequality

Normand J. Beaudry, Renato Renner

The data processing inequality (DPI) is a fundamental feature of information theory. Informally it states that you cannot increase the information content of a quantum system by acting on it with a local physical operation. When the smooth min-entropy is used as the relevant information measure, then the DPI follows immediately from the definition of the entropy. The DPI for the von Neumann entropy is then obtained by specializing the DPI for the smooth min-entropy by using the quantum asymptotic equipartition property (QAEP). We provide a short proof of the QAEP and therefore obtain a self-contained proof of the DPI for the von Neumann entropy.

arXiv:1107.0740•Quantum Information and Computation•May 1, 2012•153 citations

Tsirelson bounds for quantum correlations with indefinite causal order

Zixuan Liu, Giulio Chiribella

Quantum theory is in principle compatible with processes that violate causal inequalities, an analogue of Bell inequalities that constrain the correlations observed by sets of parties operating in a definite causal order. Since the introduction of causal inequalities, determining their maximum quantum violation, analogue to Tsirelson’s bound for Bell inequalities, has remained an open problem. Here we provide a general method for bounding the violation of arbitrary causal inequalities, establishing limits to the correlations achievable by arbitrary local experiments and by arbitrary quantum processes with indefinite causal order. We prove that the maximum violation is generally smaller than the algebraic maximum of the corresponding correlation, and determine Tsirelson-like bounds for a class of causal inequalities including some of the most paradigmatic examples. Our results motivate a search for physical principles characterizing the boundary of the set of quantum correlations with indefinite causal order. Quantum theory has been shown to be compatible with processes violating a definite causal order, but no detailed analysis of the maximum allowed degree of violation has been carried out so far. Here, the authors fill this gap by providing the analogue of Tsirelson’s bound for the violation of causal inequalities.

arXiv:2403.02749•Nature Communications•Apr 7, 2025•17 citations

Trace- and Improved Data-Processing Inequalities for von Neumann Algebras

Stefan Hollands

We prove a version of the data-processing inequality for the relative entropy for general von Neumann algebras with an explicit lower bound involving the measured relative entropy. The inequality, which generalizes previous work by Sutter et al. on finite-dimensional density matrices, yields a bound for how well a quantum state can be recovered after it has been passed through a channel. Some natural applications of our results are in quantum field theory where the von Neumann algebras are known to be of type III. Along the way we generalize various multi-trace inequalities to general von Neumann algebras.

arXiv:2102.07479•Publications of the Research Institute for Mathematical Sciences•Nov 9, 2023•11 citations

The chain rule implies Tsirelson's bound: an approach from generalized mutual information

Eyuri Wakakuwa, Mio Murao

In order to analyze an information theoretical derivation of Tsirelson's bound based on information causality, we introduce a generalized mutual information (GMI), defined as the optimal coding rate of a channel with classical inputs and general probabilistic outputs. In the case where the outputs are quantum, the GMI coincides with the quantum mutual information. In general, the GMI does not necessarily satisfy the chain rule. We prove that Tsirelson's bound can be derived by imposing the chain rule on the GMI. We formulate a principle, which we call the no-supersignaling condition , which states that the assistance of nonlocal correlations does not increase the capability of classical communication. We prove that this condition is equivalent to the no-signaling condition. As a result, we show that Tsirelson's bound is implied by the nonpositivity of the quantitative difference between information causality and no-supersignaling.

arXiv:1207.2286•New Journal of Physics•Nov 27, 2012•8 citations

Data processing inequality and open quantum systems: Beyond Markov states

Aysenur Turkmen, Abdullah Verçin, S. Yılmaz

Using a tripartite framework consisting of an open quantum system, its environment, and a passive reference system, in this study we discuss quantum mutual information (QMI) and data processing inequality (DPI). Without any restriction on the initial correlations, the necessary and sufficient conditions for the decrease or increase as well as for the conservation of QMI are obtained for any joint unitary evolution of the open quantum system and its environment. In the special case of the input Markov states, it has been shown that as long as the tripartite input state is a Markov state then DPI holds for every joint unitary evolution even in the presence of initial correlations encoded in the input. We also point out that the converse of the last statement, that is, sufficiency of the existence of a local quantum channel or of the fulfillment of DPI for the input Markov state does not hold in general and this fact is exhibited by counterexamples.

Physical Review A•Oct 17, 2017•2 citations

Integral formula for quantum relative entropy implies data processing inequality

Péter E. Frenkel

Integral representations of quantum relative entropy, and of the directional second and higher order derivatives of von Neumann entropy, are established, and used to give simple proofs of fundamental, known data processing inequalities: the Holevo bound on the quantity of information transmitted by a quantum communication channel, and, much more generally, the monotonicity of quantum relative entropy under trace-preserving positive linear maps – complete positivity of the map need not be assumed. The latter result was first proved by Müller-Hermes and Reeb, based on work of Beigi. For a simple application of such monotonicities, we consider any `divergence' that is non-increasing under quantum measurements, such as the concavity of von Neumann entropy, or various known quantum divergences. An elegant argument due to Hiai, Ohya, and Tsukada is used to show that the infimum of such a `divergence' on pairs of quantum states with prescribed trace distance is the same as the corresponding infimum on pairs of binary classical states. Applications of the new integral formulae to the general probabilistic model of information theory, and a related integral formula for the classical Rényi divergence, are also discussed.

arXiv:2208.12194•Quantum•Sep 7, 2023•32 citations
The strength of quantum correlations is bounded from above by Tsirelson's bound. We establish a connection between this bound and the fact that correlations between two systems cannot increase under local operations, a property known as the data processing inequality (DPI). More specifically, we consider arbitrary convex probabilistic theories. These can be equipped with an entropy measure that naturally generalizes the von Neumann entropy, as shown recently in Short and Wehner (2010 New J. Phys. 12 033023) and Barnum et al (2010 New J. Phys. 12 033024). We prove that if the DPI holds with respect to this generalized entropy measure then the underlying theory necessarily respects Tsirelson's bound. We, moreover, generalize this statement to any entropy measure satisfying certain minimal requirements. A consequence of our result is that not all the entropic relations used for deriving Tsirelson's bound via information causality in Pawlowski et al (2009 Nature 461 1101–4) are necessary.
The data processing inequality (DPI) is a fundamental feature of information theory. Informally it states that you cannot increase the information content of a quantum system by acting on it with a local physical operation. When the smooth min-entropy is used as the relevant information measure, then the DPI follows immediately from the definition of the entropy. The DPI for the von Neumann entropy is then obtained by specializing the DPI for the smooth min-entropy by using the quantum asymptotic equipartition property (QAEP). We provide a short proof of the QAEP and therefore obtain a self-contained proof of the DPI for the von Neumann entropy.
Quantum theory is in principle compatible with processes that violate causal inequalities, an analogue of Bell inequalities that constrain the correlations observed by sets of parties operating in a definite causal order. Since the introduction of causal inequalities, determining their maximum quantum violation, analogue to Tsirelson’s bound for Bell inequalities, has remained an open problem. Here we provide a general method for bounding the violation of arbitrary causal inequalities, establishing limits to the correlations achievable by arbitrary local experiments and by arbitrary quantum processes with indefinite causal order. We prove that the maximum violation is generally smaller than the algebraic maximum of the corresponding correlation, and determine Tsirelson-like bounds for a class of causal inequalities including some of the most paradigmatic examples. Our results motivate a search for physical principles characterizing the boundary of the set of quantum correlations with indefinite causal order. Quantum theory has been shown to be compatible with processes violating a definite causal order, but no detailed analysis of the maximum allowed degree of violation has been carried out so far. Here, the authors fill this gap by providing the analogue of Tsirelson’s bound for the violation of causal inequalities.
We prove a version of the data-processing inequality for the relative entropy for general von Neumann algebras with an explicit lower bound involving the measured relative entropy. The inequality, which generalizes previous work by Sutter et al. on finite-dimensional density matrices, yields a bound for how well a quantum state can be recovered after it has been passed through a channel. Some natural applications of our results are in quantum field theory where the von Neumann algebras are known to be of type III. Along the way we generalize various multi-trace inequalities to general von Neumann algebras.
In order to analyze an information theoretical derivation of Tsirelson's bound based on information causality, we introduce a generalized mutual information (GMI), defined as the optimal coding rate of a channel with classical inputs and general probabilistic outputs. In the case where the outputs are quantum, the GMI coincides with the quantum mutual information. In general, the GMI does not necessarily satisfy the chain rule. We prove that Tsirelson's bound can be derived by imposing the chain rule on the GMI. We formulate a principle, which we call the no-supersignaling condition , which states that the assistance of nonlocal correlations does not increase the capability of classical communication. We prove that this condition is equivalent to the no-signaling condition. As a result, we show that Tsirelson's bound is implied by the nonpositivity of the quantitative difference between information causality and no-supersignaling.
Using a tripartite framework consisting of an open quantum system, its environment, and a passive reference system, in this study we discuss quantum mutual information (QMI) and data processing inequality (DPI). Without any restriction on the initial correlations, the necessary and sufficient conditions for the decrease or increase as well as for the conservation of QMI are obtained for any joint unitary evolution of the open quantum system and its environment. In the special case of the input Markov states, it has been shown that as long as the tripartite input state is a Markov state then DPI holds for every joint unitary evolution even in the presence of initial correlations encoded in the input. We also point out that the converse of the last statement, that is, sufficiency of the existence of a local quantum channel or of the fulfillment of DPI for the input Markov state does not hold in general and this fact is exhibited by counterexamples.
Integral representations of quantum relative entropy, and of the directional second and higher order derivatives of von Neumann entropy, are established, and used to give simple proofs of fundamental, known data processing inequalities: the Holevo bound on the quantity of information transmitted by a quantum communication channel, and, much more generally, the monotonicity of quantum relative entropy under trace-preserving positive linear maps – complete positivity of the map need not be assumed. The latter result was first proved by Müller-Hermes and Reeb, based on work of Beigi. For a simple application of such monotonicities, we consider any `divergence' that is non-increasing under quantum measurements, such as the concavity of von Neumann entropy, or various known quantum divergences. An elegant argument due to Hiai, Ohya, and Tsukada is used to show that the infimum of such a `divergence' on pairs of quantum states with prescribed trace distance is the same as the corresponding infimum on pairs of binary classical states. Applications of the new integral formulae to the general probabilistic model of information theory, and a related integral formula for the classical Rényi divergence, are also discussed.