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:2610.32783

Bounding single-copy information causality violations

Marco Pompili, Costantino Budroni

quant-phSubmitted Oct 23, 2026• Announced Oct 26, 2026• 0 citations
arXivHTMLPDF

Abstract

Information causality is a physical principle that constrains bipartite post-quantum nonlocal correlations from information-theoretic assumptions. A direct characterization of the correlations satisfying it, however, remains difficult because the defining entropic condition must hold for all admissible protocols in the corresponding task. Here, we formulate the single-copy information causality problem as an optimization over all protocol parameters and simplify it by proving a deterministic reduction. We then show that generic adaptive multi-copy protocols can be represented as single-copy protocols applied to an effective behavior obtained by local wirings. As a consequence, for families of correlations closed under wirings, excluding single-copy violations suffices to exclude all finite-copy adaptive-protocol violations. We formulate the resulting membership and set-inclusion problems as optimization problems and discuss possible semidefinite programming relaxations. As an application, we study expansions of the information causality functional around zero-capacity channels, generalizing a method recently employed by Gachechiladze and Miklin to derive the Tsirelson--Landau--Masanes boundary from information causality. For expansions centered on channels whose output distribution has full support, imposing the second-order constraints for all single-copy protocols characterizes exactly the set of macroscopic locality in the CHSH scenario. Expanding instead around appropriate constant-output channels with perturbations that change the channel support, we show that every single-copy IC violation can be witnessed already at first order with a channel of arbitrarily small capacity.

AI Summary

Information causality (IC) constrains post-quantum correlations through an entropic inequality that must hold for every allowed communication protocol. This paper formulates membership in generalized IC—with correlated database entries and conditional mutual-information terms—as an optimization over database distributions, local strategies, and noisy classical channels. Convexity arguments show that measurement choices and decoding can be taken deterministic; the database distribution and communication channel remain stochastic. The optimized single-copy violation is convex in the shared behavior. Finite-copy adaptive protocols, including locally adaptive orders of box use, are represented as single-copy protocols on effective behaviors obtained by local wirings. Consequently, for a wiring-closed family such as the almost-quantum family, single-copy satisfaction across **all Bell scenarios** excludes every finite-copy violation within the causal structure considered. This is not a fixed-behavior single-copy equivalence. The main application characterizes low-capacity channel expansions. Around any zero-capacity channel with full-support output, the leading quadratic constraints from all single-copy protocols characterize exactly macroscopic locality, $\mathcal Q^1$, in the CHSH scenario. The proof reduces these constraints to positive-semidefinite quadratic forms and the TLM criterion for renormalized correlators. Support-changing perturbations instead recover any single-copy violation at linear order: adding flagged erasure gives $\Lambda(T^\varepsilon)=\varepsilon\Lambda(T)$ while scaling channel capacity by $\varepsilon$. The almost-quantum-versus-IC question remains unresolved. Polynomial/semidefinite bounds are proposed but not implemented; computational tractability, stronger higher-order full-support constraints, and larger Bell scenarios remain open.

No sign of AI-generated textAI use disclosed
The authors acknowledge the use of LLM tools (Claude Opus 5.5) for assistance in the expansion around zero-capacity channels.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
13 + 11 pages, 2 figures

Related papers

Information Causality Characterizes the Set of Quantum Correlations in the Simplest Bell Scenario

Mariami Gachechiladze, Nikolai Miklin

Information causality (IC) was introduced as a physical principle constraining correlations in non-signaling theories. Whether it can recover the exact quantum correlation boundary, beyond Uffink's inequality, has remained an open question. Here, we combine its generalized formulation for correlated inputs with a new communication protocol to derive quantum Bell inequalities that exactly characterize the quantum correlations in the simplest bipartite Bell scenario, with two binary measurements. In particular, we derive the Tsirelson-Landau-Masanes criterion directly from IC. Thus, the generalized IC implies macroscopic locality, while we also present macroscopically local correlations that violate the generalized IC. This establishes that generalized IC is a strictly stronger principle in this scenario. Together with our earlier result that generalized IC implies a nontrivial communication complexity principle, these findings strengthen the role of information causality in explaining the limits of quantum nonlocality and provide a systematic route to deriving tighter bounds on the set of quantum correlations in more general Bell scenarios.

quant-pharXiv:2609.10508•Sep 10, 2026•3 citations

Almost-Quantum Correlations Violate Information Causality

Anandamay Das Bhowmik, Manik Banik

Information causality (IC) posits that communicating m classical bits cannot give the receiver access to more than m bits of information about the sender's independent data. Although IC holds in quantum theory and excludes a broad class of supra-quantum correlations, its validity for the almost-quantum set has remained open. This semidefinite relaxation of the quantum set satisfies nontrivial communication complexity, no advantage for non-local computation, macroscopic locality, local orthogonality, and numerical evidence has suggested that it may also satisfy IC. Here we show that almost-quantum correlations violate IC, and do so without bound. Unlike earlier violations of IC, which rely on biased guesses, ours is driven by zero-error certificates: each is rare but never wrong, carries information linear in its probability, and vouches for many of the sender's bits at once. This establishes a sharp dichotomy: either IC is a valid physical principle that excludes these correlations, or any nonsignalling theory realizing them admits no mutual information obeying consistency, data processing and the chain rule. In the latter case, we discuss why the chain rule is the natural property to relinquish, and how this possibility relates to histories-based formulations and to locality defined relative to the state rather than presupposed in a fixed spacetime.

quant-pharXiv:2610.41444•Nov 2, 2026•1 citation

Information causality does not single out the set of quantum correlations

Marco Pompili, Mirjam Weilenmann

Information causality (IC) was introduced as a physical principle that imposes constraints on the non-local correlations between two parties (Alice and Bob) in a Bell scenario. Specifically, it states that the information that Bob can gain about an $n$-bit database held by Alice is bounded by the information she communicates to him. To date, the question whether IC for any $n \in \mathbb{N}$ singles out the set of quantum correlations remains open, meaning that it is unknown whether for any number of inputs $m$ and outputs $d$ of the two parties the set of correlations that satisfy IC exactly coincides with the quantum correlations. In this work, we answer this question in the negative. Firstly, we show that for any finite database length $n \geq 2$, there is a bipartite set of correlations that satisfies IC for all compatible protocols and that exhibits post-quantum correlations in the Bell scenario with $n+1$ inputs and $2$ outcomes per party. This result relies on constructing an entropic proof of IC for GPTs that may be of independent interest. We further show that in the Bell scenario with $n+1$ inputs and $2$ outcomes per party, our constructed sets of correlations lead to neither a superset nor a subset of the quantum correlations. Secondly, we construct a set of correlations in the Bell scenario with $3$ inputs and $2$ outputs per party that satisfies IC (for all database sizes $n \in \mathbb{N}$) and that includes post-quantum points. Consequently, all known formulations of information causality fail to fully characterize the bipartite set of quantum correlations, already in the $3$-input, $2$-outcome Bell scenario.

quant-pharXiv:2610.06604•Oct 6, 2026•2 citations

Information-Theoretic Constraints on Quantum Correlations

POMPILI, MARCO

Bell's theorem asserts that no local hidden variable theory can explain the predictions of quantum theory in an experiment where spacelike separated measurements are performed in distant laboratories. Loophole-free Bell tests performed in the last decade demonstrate Bell nonlocality as a property of Nature. However, the amount of nonlocality allowed in quantum theory is limited, compared to the sole restriction of no-signaling, meaning the impossibility of faster-than-light communication implied by special relativity. Information causality is a physical principle that generalizes no-signaling and is satisfied by quantum theory. It is based on the idea that shared quantum entanglement cannot enable a receiver to obtain more classical information than how much was sent by a distant sender. Remarkably, the principle was shown to imply the maximal quantum bound for the violation of the most well-known Bell inequality. The aim of this thesis is to widen our understanding of information causality and compare its predictions with other known outer approximations of the quantum set of correlations. We build upon the recent realization that most of the known consequences of information causality can be derived with a single copy of the shared systems, whereas before it was thought that many copies were necessary. We develop a novel optimization framework which bounds the possible violations of information causality by other sets of correlations, allowing us to certify when violations are not possible. We generalize the statement of information causality and reach a precise definition for the set of correlations satisfying this principle. We show that when searching for violations of information causality by physical theories, considering many copies is not necessary. Our aforementioned optimization framework approximates the information causality set from the outside. Conversely, we propose a different approach which allows us to approximate this set from the inside.

•Oct 15, 2025•0 citations

Bounds on Nonlocality and Random Access Codes from Extended Information Causality Principle

Prabhav Jain, Nikolai Miklin, Mariami Gachechiladze

Information Causality was introduced as a physical principle for constraining the set of nonlocal correlations. In recent work, we proposed an extension of Information Causality that allows correlations among Alice's inputs. This extended principle yields tighter constraints than the original formulation and recovers part of the quantum boundary in certain Bell scenarios. In this work, we further investigate the implications of extended Information Causality and apply it to scenarios beyond binary inputs and outputs. We derive a family of quantum Bell inequalities that strengthen previously known constraints on quantum correlations. Using these inequalities, we obtain an improved analytical bound for the Collins-Gisin family of Bell inequalities. We also apply Information Causality to entanglement-assisted random access codes and derive new theory-independent analytical bounds on the winning probability. For this latter task, we prove that, despite being stronger in general, the extended principle does not improve the bounds obtained from the original Information Causality principle. This suggests that the existing Information Causality bounds are optimal for this class of random access codes.

quant-pharXiv:2606.02416•Jun 2, 2026•3 citations

Information Causality as a Tool for Bounding the Set of Quantum Correlations

Prabhav Jain, Mariami Gachechiladze, Nikolai Miklin

Information causality was initially proposed as a physical principle aimed at deriving the predictions of quantum mechanics on the type of correlations observed in the Bell experiment. In the same work, information causality was famously shown to imply the Uffink inequality that approximates the set of quantum correlations and rederives Tsirelson's bound of the Clauser-Horne-Shimony-Holt inequality. This result found limited generalizations due to the difficulty of deducing implications of the information causality principle on the set of nonlocal correlations. In this Letter, we present a simple technique for obtaining polynomial inequalities from information causality bounding the set of physical correlations in any bipartite Bell scenario. This result makes information causality an efficient tool for approximating the set of quantum correlations. To demonstrate our method, we derive a family of inequalities which nontrivially constrains the set of nonlocal correlations in Bell scenarios with binary outcomes and equal number of measurement settings. Finally, we propose an improved statement of the information causality principle and obtain a tighter constraint for the simplest Bell scenario that goes beyond the Uffink inequality and recovers a part of the boundary of the quantum set.

arXiv:2308.02478•Physical Review Letters•Oct 18, 2024•10 citations
Information causality is a physical principle that constrains bipartite post-quantum nonlocal correlations from information-theoretic assumptions. A direct characterization of the correlations satisfying it, however, remains difficult because the defining entropic condition must hold for all admissible protocols in the corresponding task. Here, we formulate the single-copy information causality problem as an optimization over all protocol parameters and simplify it by proving a deterministic reduction. We then show that generic adaptive multi-copy protocols can be represented as single-copy protocols applied to an effective behavior obtained by local wirings. As a consequence, for families of correlations closed under wirings, excluding single-copy violations suffices to exclude all finite-copy adaptive-protocol violations. We formulate the resulting membership and set-inclusion problems as optimization problems and discuss possible semidefinite programming relaxations. As an application, we study expansions of the information causality functional around zero-capacity channels, generalizing a method recently employed by Gachechiladze and Miklin to derive the Tsirelson--Landau--Masanes boundary from information causality. For expansions centered on channels whose output distribution has full support, imposing the second-order constraints for all single-copy protocols characterizes exactly the set of macroscopic locality in the CHSH scenario. Expanding instead around appropriate constant-output channels with perturbations that change the channel support, we show that every single-copy IC violation can be witnessed already at first order with a channel of arbitrarily small capacity.
Information causality (IC) constrains post-quantum correlations through an entropic inequality that must hold for every allowed communication protocol. This paper formulates membership in generalized IC—with correlated database entries and conditional mutual-information terms—as an optimization over database distributions, local strategies, and noisy classical channels.
Convexity arguments show that measurement choices and decoding can be taken deterministic; the database distribution and communication channel remain stochastic. The optimized single-copy violation is convex in the shared behavior. Finite-copy adaptive protocols, including locally adaptive orders of box use, are represented as single-copy protocols on effective behaviors obtained by local wirings. Consequently, for a wiring-closed family such as the almost-quantum family, single-copy satisfaction across all Bell scenarios excludes every finite-copy violation within the causal structure considered. This is not a fixed-behavior single-copy equivalence.
The main application characterizes low-capacity channel expansions. Around any zero-capacity channel with full-support output, the leading quadratic constraints from all single-copy protocols characterize exactly macroscopic locality, Q1\mathcal Q^1Q1, in the CHSH scenario. The proof reduces these constraints to positive-semidefinite quadratic forms and the TLM criterion for renormalized correlators. Support-changing perturbations instead recover any single-copy violation at linear order: adding flagged erasure gives Λ(Tε)=εΛ(T)\Lambda(T^\varepsilon)=\varepsilon\Lambda(T)Λ(Tε)=εΛ(T) while scaling channel capacity by ε\varepsilonε.
The almost-quantum-versus-IC question remains unresolved. Polynomial/semidefinite bounds are proposed but not implemented; computational tractability, stronger higher-order full-support constraints, and larger Bell scenarios remain open.
Information causality (IC) was introduced as a physical principle constraining correlations in non-signaling theories. Whether it can recover the exact quantum correlation boundary, beyond Uffink's inequality, has remained an open question. Here, we combine its generalized formulation for correlated inputs with a new communication protocol to derive quantum Bell inequalities that exactly characterize the quantum correlations in the simplest bipartite Bell scenario, with two binary measurements. In particular, we derive the Tsirelson-Landau-Masanes criterion directly from IC. Thus, the generalized IC implies macroscopic locality, while we also present macroscopically local correlations that violate the generalized IC. This establishes that generalized IC is a strictly stronger principle in this scenario. Together with our earlier result that generalized IC implies a nontrivial communication complexity principle, these findings strengthen the role of information causality in explaining the limits of quantum nonlocality and provide a systematic route to deriving tighter bounds on the set of quantum correlations in more general Bell scenarios.
Information causality (IC) posits that communicating m classical bits cannot give the receiver access to more than m bits of information about the sender's independent data. Although IC holds in quantum theory and excludes a broad class of supra-quantum correlations, its validity for the almost-quantum set has remained open. This semidefinite relaxation of the quantum set satisfies nontrivial communication complexity, no advantage for non-local computation, macroscopic locality, local orthogonality, and numerical evidence has suggested that it may also satisfy IC. Here we show that almost-quantum correlations violate IC, and do so without bound. Unlike earlier violations of IC, which rely on biased guesses, ours is driven by zero-error certificates: each is rare but never wrong, carries information linear in its probability, and vouches for many of the sender's bits at once. This establishes a sharp dichotomy: either IC is a valid physical principle that excludes these correlations, or any nonsignalling theory realizing them admits no mutual information obeying consistency, data processing and the chain rule. In the latter case, we discuss why the chain rule is the natural property to relinquish, and how this possibility relates to histories-based formulations and to locality defined relative to the state rather than presupposed in a fixed spacetime.
Information causality (IC) was introduced as a physical principle that imposes constraints on the non-local correlations between two parties (Alice and Bob) in a Bell scenario. Specifically, it states that the information that Bob can gain about an nnn-bit database held by Alice is bounded by the information she communicates to him. To date, the question whether IC for any n∈Nn \in \mathbb{N}n∈N singles out the set of quantum correlations remains open, meaning that it is unknown whether for any number of inputs mmm and outputs ddd of the two parties the set of correlations that satisfy IC exactly coincides with the quantum correlations. In this work, we answer this question in the negative. Firstly, we show that for any finite database length n≥2n \geq 2n≥2, there is a bipartite set of correlations that satisfies IC for all compatible protocols and that exhibits post-quantum correlations in the Bell scenario with n+1n+1n+1 inputs and 222 outcomes per party. This result relies on constructing an entropic proof of IC for GPTs that may be of independent interest. We further show that in the Bell scenario with n+1n+1n+1 inputs and 222 outcomes per party, our constructed sets of correlations lead to neither a superset nor a subset of the quantum correlations. Secondly, we construct a set of correlations in the Bell scenario with 333 inputs and 222 outputs per party that satisfies IC (for all database sizes n∈Nn \in \mathbb{N}n∈N) and that includes post-quantum points. Consequently, all known formulations of information causality fail to fully characterize the bipartite set of quantum correlations, already in the 333-input, 222-outcome Bell scenario.
Bell's theorem asserts that no local hidden variable theory can explain the predictions of quantum theory in an experiment where spacelike separated measurements are performed in distant laboratories. Loophole-free Bell tests performed in the last decade demonstrate Bell nonlocality as a property of Nature. However, the amount of nonlocality allowed in quantum theory is limited, compared to the sole restriction of no-signaling, meaning the impossibility of faster-than-light communication implied by special relativity. Information causality is a physical principle that generalizes no-signaling and is satisfied by quantum theory. It is based on the idea that shared quantum entanglement cannot enable a receiver to obtain more classical information than how much was sent by a distant sender. Remarkably, the principle was shown to imply the maximal quantum bound for the violation of the most well-known Bell inequality. The aim of this thesis is to widen our understanding of information causality and compare its predictions with other known outer approximations of the quantum set of correlations. We build upon the recent realization that most of the known consequences of information causality can be derived with a single copy of the shared systems, whereas before it was thought that many copies were necessary. We develop a novel optimization framework which bounds the possible violations of information causality by other sets of correlations, allowing us to certify when violations are not possible. We generalize the statement of information causality and reach a precise definition for the set of correlations satisfying this principle. We show that when searching for violations of information causality by physical theories, considering many copies is not necessary. Our aforementioned optimization framework approximates the information causality set from the outside. Conversely, we propose a different approach which allows us to approximate this set from the inside.
Information Causality was introduced as a physical principle for constraining the set of nonlocal correlations. In recent work, we proposed an extension of Information Causality that allows correlations among Alice's inputs. This extended principle yields tighter constraints than the original formulation and recovers part of the quantum boundary in certain Bell scenarios. In this work, we further investigate the implications of extended Information Causality and apply it to scenarios beyond binary inputs and outputs. We derive a family of quantum Bell inequalities that strengthen previously known constraints on quantum correlations. Using these inequalities, we obtain an improved analytical bound for the Collins-Gisin family of Bell inequalities. We also apply Information Causality to entanglement-assisted random access codes and derive new theory-independent analytical bounds on the winning probability. For this latter task, we prove that, despite being stronger in general, the extended principle does not improve the bounds obtained from the original Information Causality principle. This suggests that the existing Information Causality bounds are optimal for this class of random access codes.
Information causality was initially proposed as a physical principle aimed at deriving the predictions of quantum mechanics on the type of correlations observed in the Bell experiment. In the same work, information causality was famously shown to imply the Uffink inequality that approximates the set of quantum correlations and rederives Tsirelson's bound of the Clauser-Horne-Shimony-Holt inequality. This result found limited generalizations due to the difficulty of deducing implications of the information causality principle on the set of nonlocal correlations. In this Letter, we present a simple technique for obtaining polynomial inequalities from information causality bounding the set of physical correlations in any bipartite Bell scenario. This result makes information causality an efficient tool for approximating the set of quantum correlations. To demonstrate our method, we derive a family of inequalities which nontrivially constrains the set of nonlocal correlations in Bell scenarios with binary outcomes and equal number of measurement settings. Finally, we propose an improved statement of the information causality principle and obtain a tighter constraint for the simplest Bell scenario that goes beyond the Uffink inequality and recovers a part of the boundary of the quantum set.