arXiv:2610.32783
Bounding single-copy information causality violations
Marco Pompili, Costantino Budroni
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.
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