arXiv:2610.06604
Information causality does not single out the set of quantum correlations
Marco Pompili, Mirjam Weilenmann
Abstract
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.
AI Summary
Information causality (IC) bounds the information obtainable about Alice’s database by the classical information communicated to Bob. The paper asks whether imposing IC for every database size and every allowed protocol characterizes bipartite quantum correlations, and gives counterexamples already with three binary measurements per party. For each finite database length $n\geq2$, it proves $\mathrm{GW}_{n-1}\subseteq\mathrm{IC}_n$, where ghostworld correlations admit symmetric nonsignalling extensions. Explicit behaviors in the $(n+1,n+1,2,2)$ scenario lie outside the commuting-operator quantum set. The proof combines conditional measurement entropy with auxiliary extension systems and closure under wirings; the constructed behaviors attain $I_{mm22}=1/m$ for $m=n+1$, optimally within the corresponding ghostworld set. For arbitrary database lengths in a fixed scenario, the paper introduces a sufficient IC criterion using fixed-input KL-divergence contraction coefficients: the coefficients summed over Bob’s inputs must be at most one for each Alice input. An explicit three-input binary-output family $P_\lambda$ is post-quantum for every $\lambda>0$ and satisfies this criterion for $0\leq\lambda\leq21-12\sqrt3\approx0.2154$. A recursive auxiliary-distribution construction extends the guarantee to arbitrarily many independent copies and adaptive local wirings. Taking $P^*=P_{1/5}$, its convex hull with all local behaviors satisfies every IC formulation examined, including correlated-database versions. The all-length construction is a set of resources, not a full GPT, and its guarantee concerns independent boxes. It contains points outside the almost-quantum set but does not determine whether all almost-quantum correlations satisfy IC. Stronger IC principles or alternative characterizations of quantum correlations remain open.
Finally, the model was used to correct grammatical mistakes in this manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 12+14 pages, 2 figures