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

• URL: http://arxiv.org/abs/2606.02416v1
• Date: Mon, 01 Jun 2026 15:58:11 GMT
• Title: Bounds on Nonlocality and Random Access Codes from Extended Information Causality Principle
• Abstract summary: We extend Information Causality to allow correlations among Alice's inputs.<n>We derive a family of quantum Bell inequalities that strengthen previously known constraints on quantum correlations.<n>We prove that, despite being stronger in general, the extended principle does not improve the bounds obtained from the original Information Causality principle.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• New Rules for Causal Identification with Background Knowledge [59.733125324672656]
  We propose two novel rules for incorporating BK, which offer a new perspective to the open problem. We show that these rules are applicable in some typical causality tasks, such as determining the set of possible causal effects with observational data.
  arXiv  Detail & Related papers  (2024-07-21T20:21:21Z)
• Information causality as a tool for bounding the set of quantum correlations [0.0]
  Information causality was initially proposed as a physical principle aimed at deriving predictions of quantum mechanics on the type of correlations observed in the Bell experiment. We present a technique for obtaining inequalities from information causality, bounding the set of physical correlations in any Bell scenario.
  arXiv  Detail & Related papers  (2023-08-04T17:40:53Z)
• Information causality in multipartite scenarios [1.0312968200748118]
  We report a new formulation of the information causality principle in multipartite scenarios. We prove that such inequalities hold for all quantum resources, and forbid some stronger-than-quantum ones.
  arXiv  Detail & Related papers  (2022-12-11T20:32:21Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Information causality beyond the random access code model [0.0]
  Information causality (IC) was one of the first principles that have been invoked to bound the set of quantum correlations. We use a new quantifier for IC, based on the notion of "redundant information'
  arXiv  Detail & Related papers  (2022-01-22T07:57:14Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Shannon theory for quantum systems and beyond: information compression for fermions [68.8204255655161]
  We show that entanglement fidelity in the fermionic case is capable of evaluating the preservation of correlations. We introduce a fermionic version of the source coding theorem showing that, as in the quantum case, the von Neumann entropy is the minimal rate for which a fermionic compression scheme exists.
  arXiv  Detail & Related papers  (2021-06-09T10:19:18Z)
• Geometry of Banach spaces: a new route towards Position Based Cryptography [65.51757376525798]
  We study Position Based Quantum Cryptography (PBQC) from the perspective of geometric functional analysis and its connections with quantum games. The main question we are interested in asks for the optimal amount of entanglement that a coalition of attackers have to share in order to compromise the security of any PBQC protocol. We show that the understanding of the type properties of some more involved Banach spaces would allow to drop out the assumptions and lead to unconditional lower bounds on the resources used to attack our protocol.
  arXiv  Detail & Related papers  (2021-03-30T13:55:11Z)
• Quantum Bell inequalities from Information Causality -- tight for Macroscopic Locality [0.34771439623170125]
  In a Bell test, the set of observed probability distributions complying with the principle of local realism is fully characterized by Bell inequalities. We present a family of inequalities, which approximate the set of quantum correlations in Bell scenarios where the number of settings or outcomes can be arbitrary.
  arXiv  Detail & Related papers  (2021-03-08T19:36:13Z)
• Information Causality without concatenation [0.5043455303941253]
  Information Causality is a physical principle which states that the amount of randomly accessible data over a classical communication channel cannot exceed its capacity. We show that concatenation can be successfully replaced by limits on the communication channel capacity.
  arXiv  Detail & Related papers  (2021-01-29T18:05:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.