arXiv:2610.41444
Almost-Quantum Correlations Violate Information Causality
Anandamay Das Bhowmik, Manik Banik
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.
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