arXiv subjects

Prabhav Jain

Publications and source records attributed to Prabhav Jain.

5 recordsLinked to original sources

arXiv2026

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

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.

quant-ph↗

arXiv2026

Communication complexity bounds from information causality

Communication complexity, which quantifies the minimum communication required for distributed computation, offers a natural setting for investigating the capabilities and limitations of quantum mechanics in information processing. We introduce an information-theoretic approach to study one-way communication complexity based solely on the axioms of mutual information. Within this framework, we derive an extended statement of the information causality principle, which recovers known lower bounds on the communication complexities for a range of functions in a simplified manner and leads to new results. We further prove that the extended information causality principle is at least as strong as the principle of non-trivial communication complexity in bounding the strength of quantum correlations attainable in Bell experiments. Our study establishes a new route for exploring the fundamental limits of quantum technologies from an information-theoretic viewpoint.

quant-ph↗

arXiv2025

Distributional Adversarial Loss

We initiate the study of a new notion of adversarial loss which we call distributional adversarial loss. In this notion, we assume for each original example, the allowed adversarial perturbation set is a family of distributions, and the adversarial loss over each example is the maximum loss over all the associated distributions. The goal is to minimize the overall adversarial loss. We show sample complexity bounds in the PAC-learning setting for our notion of adversarial loss. Our notion of adversarial loss contrasts the prior work on robust learning that considers a set of points, not distributions, as the perturbation set of each clean example. As an application of our approach, we show how to unify the two lines of work on randomized smoothing and robust learning in the PAC-learning setting and derive sample complexity bounds for randomized smoothing methods. Furthermore, we investigate the role of randomness in achieving robustness against adversarial attacks. We show a general derandomization technique that preserves the extent of a randomized classifier's robustness against adversarial attacks and show its effectiveness empirically.

cs.LG↗

arXiv2024

Information causality as a tool for bounding the set of quantum correlations

Information causality was initially proposed as a physical principle aimed at deriving the predictions of quantum mechanics on the type of correlations observed in the Bell experiment. In the same work, information causality was famously shown to imply the Uffink inequality that approximates the set of quantum correlations and rederives Tsirelson's bound of the Clauser-Horne-Shimony-Holt inequality. This result found limited generalizations due to the difficulty of deducing implications of the information causality principle on the set of nonlocal correlations. In this paper, we present a simple technique for obtaining polynomial inequalities from information causality bounding the set of physical correlations in any bipartite Bell scenario. This result makes information causality an efficient tool for approximating the set of quantum correlations. To demonstrate our method, we derive a family of inequalities which non-trivially constrains the set of nonlocal correlations in Bell scenarios with binary outcomes and equal number of measurement settings. Finally, we propose an improved statement of the information causality principle and obtain a tighter constraint for the simplest Bell scenario, that goes beyond the Uffink inequality and recovers a part of the boundary of the quantum set.

quant-ph↗

arXiv2024

Mapping Large N Slightly Broken Higher Spin (SBHS) theory correlators to Free theory correlators

We develop a systematic method to constrain any n-point correlation function of spinning operators in Large N Slightly Broken Higher Spin (SBHS) theories. As an illustration of the methodology, we work out the three point functions which reproduce the previously known results. We then work out the four point functions of spinning operators. We show that the correlation functions of spinning operators in the interacting SBHS theory take a remarkably simple form and that they can be written just in terms of the free fermionic and critical bosonic theory correlators. They also interpolate nicely between the results in these two theories. When expressed in spinor-helicity variables we obtain an anyonic phase which nicely interpolates between the free fermionic and critical bosonic results which makes 3D bosonization manifest. Further, we also obtain a form for five and higher point functions as well by performing a similar analysis.

hep-th↗