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.41444

Almost-Quantum Correlations Violate Information Causality

Anandamay Das Bhowmik, Manik Banik

quant-phSubmitted Oct 30, 2026• Announced Nov 2, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

AI Summary

The paper addresses whether almost-quantum (AQ) correlations satisfy information causality (IC), a question previously unresolved despite numerical evidence suggesting compatibility. It constructs AQ-assisted random-access protocols whose summed Shannon mutual information exceeds the one-bit communication budget without bound. The resource is an explicit binary-output AQ box with $N$ settings per party and $p(0,0|x,y)=\delta_{xy}/17$. Thus, outcome $(0,0)$ certifies equal settings with probability $1/17$, independent of $N$; quantum certificate boxes instead obey $s\leq1/N$. An explicit projector construction verifies AQ membership. Alice divides independent fair bits into $N$ blocks of length $k$, inputs the index of the first all-ones block, and sends her outcome as one classical bit. Bob’s outcome and the message can certify a requested block without error. Using this certificate as the guess for any bit in that block gives $\mathcal I\geq ks[1-(1-2^{-k})^N]$, because a certificate occurring with probability $t$ contributes at least $t$ bits of mutual information. For $s=1/17$, $k=18$ and $N=757{,}693$ yield $\mathcal I\geq1.00000018$. Taking $N=k2^k$ gives $\mathcal I\geq k(1-e^{-k})/17$, which diverges. Consequently, theories realizing these correlations cannot admit mutual information satisfying consistency, data processing and the chain rule simultaneously. The exhibited violation requires many settings. More economical constructions and useful noise thresholds remain open. Exact zero probabilities simplify certification but are not essential to a finite violation. The result neither establishes unphysicality by itself nor identifies which information axiom must fail in every possible realization.

No sign of AI-generated textAI use disclosed
The large language model Claude (Anthropic) was used to assist with editing the prose, checking the numerical thresholds and preparing the figure.

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

Comments
4.5 pages, two-column, 1 figure; comments are welcome

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

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

Bounding single-copy information causality violations

Marco Pompili, Costantino Budroni

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.

quant-pharXiv:2610.32783•Oct 26, 2026•0 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

Information-causality and extremal tripartite correlations

Tzyh Haur Yang, Daniel Cavalcanti, Mafalda L Almeida +2 more

We study the principle of information-causality (IC) in the presence of extremal no-signaling correlations on a tripartite scenario. We prove that all, except one, of the non-local correlations lead to violation of IC. The remaining non-quantum correlation is shown to satisfy any bipartite physical principle.

arXiv:1108.2293•New Journal of Physics•Jan 30, 2012•43 citations

Information causality beyond the random-access-code model

Baichu Yu, Valerio Scarani

Information causality (IC) was one of the first principles that have been invoked to bound the set of quantum correlations. For some families of correlations, this principle recovers exactly the boundary of the quantum set; for others, there is still a gap. We close some of these gaps using a new quantifier for IC, based on the notion of ``redundant information''. This progress was made possible by the recognition that the principle of IC can be captured without referring to the success criterion of random access codes. We give strong numerical evidence that the new definition is still obeyed by quantum correlations in the same scenario.

arXiv:2201.08986•Physical Review A•Jun 22, 2026•7 citations
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.
The paper addresses whether almost-quantum (AQ) correlations satisfy information causality (IC), a question previously unresolved despite numerical evidence suggesting compatibility. It constructs AQ-assisted random-access protocols whose summed Shannon mutual information exceeds the one-bit communication budget without bound.
The resource is an explicit binary-output AQ box with NNN settings per party and p(0,0∣x,y)=δxy/17p(0,0|x,y)=\delta_{xy}/17p(0,0∣x,y)=δxy​/17. Thus, outcome (0,0)(0,0)(0,0) certifies equal settings with probability 1/171/171/17, independent of NNN; quantum certificate boxes instead obey s≤1/Ns\leq1/Ns≤1/N. An explicit projector construction verifies AQ membership. Alice divides independent fair bits into NNN blocks of length kkk, inputs the index of the first all-ones block, and sends her outcome as one classical bit. Bob’s outcome and the message can certify a requested block without error. Using this certificate as the guess for any bit in that block gives I≥ks[1−(1−2−k)N]\mathcal I\geq ks[1-(1-2^{-k})^N]I≥ks[1−(1−2−k)N], because a certificate occurring with probability ttt contributes at least ttt bits of mutual information.
For s=1/17s=1/17s=1/17, k=18k=18k=18 and N=757,693N=757{,}693N=757,693 yield I≥1.00000018\mathcal I\geq1.00000018I≥1.00000018. Taking N=k2kN=k2^kN=k2k gives I≥k(1−e−k)/17\mathcal I\geq k(1-e^{-k})/17I≥k(1−e−k)/17, which diverges. Consequently, theories realizing these correlations cannot admit mutual information satisfying consistency, data processing and the chain rule simultaneously.
The exhibited violation requires many settings. More economical constructions and useful noise thresholds remain open. Exact zero probabilities simplify certification but are not essential to a finite violation. The result neither establishes unphysicality by itself nor identifies which information axiom must fail in every possible realization.
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) 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.
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.
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 (IC) was one of the first principles that have been invoked to bound the set of quantum correlations. For some families of correlations, this principle recovers exactly the boundary of the quantum set; for others, there is still a gap. We close some of these gaps using a new quantifier for IC, based on the notion of ``redundant information''. This progress was made possible by the recognition that the principle of IC can be captured without referring to the success criterion of random access codes. We give strong numerical evidence that the new definition is still obeyed by quantum correlations in the same scenario.