Related papers: Optimal Trace Inequalities for Single-Shot Quantum…
Many of the traditional results in information theory, such as the channel coding theorem or the source coding theorem, are restricted to scenarios where the underlying resources are independent and identically distributed (i.i.d.) over a…
Harnessing the unique properties of quantum mechanics offers the possibility to deliver new technologies that can fundamentally outperform their classical counterparts. These technologies only deliver advantages when components operate with…
Information inequalities govern the ultimate limitations in information theory and as such play an pivotal role in characterizing what values the entropy of multipartite states can take. Proving an information inequality, however, quickly…
Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studied specially in the setting of many independent uses of the…
Quantum information decoupling is a fundamental quantum information processing task, which also serves as a crucial tool in a diversity of topics in quantum physics. In this paper, we characterize the reliability function of catalytic…
We give necessary and sufficient conditions in order that inequalities of the type $$ \| T_K f\|_{L^q(d\mu)}\leq C \|f\|_{L^p(d\sigma)}, \qquad f \in L^p(d\sigma), $$ hold for a class of integral operators $T_K f(x) = \int_{R^n} K(x, y)…
We prove a lower bound on the information leakage of any classical protocol computing the equality function in the simultaneous message passing (SMP) model. Our bound is valid in the finite length regime and is strong enough to demonstrate…
Non-contextuality (NC) and Bell inequalities can be expressed as bounds $\Omega$ for positive linear combinations $S$ of probabilities of events, $S \leq \Omega$. Exclusive events in $S$ can be represented as adjacent vertices of a graph…
We show that a simple telescoping sum trick, together with the triangle inequality and a tensorisation property of expected-contractive coefficients of random channels, allow us to achieve general simultaneous decoupling for multiple users…
We study the problem of source and message compression in the one-shot setting for the point-to-point and multi-party scenarios (with and without side information). We derive achievability results for these tasks in a unified manner, using…
We establish sharp trace- and Korn-type inequalities that involve vectorial differential operators, the focus being on situations where global singular integral estimates are not available. Starting from a novel approach to sharp Besov…
We introduce an encoding of information in the relative displacement or photon number of different optical modes. Since the loss rate to interference is insensitive to squeezing and many non-Gaussian fluctuations, such a space is relatively…
Entropy is a fundamental concept in quantum information theory that allows to quantify entanglement and investigate its properties, for example its monogamy over multipartite systems. Here, we derive variational formulas for relative…
We show that approximating the trace norm contraction coefficient of a quantum channel within a constant factor is NP-hard. Equivalently, this shows that determining the optimal success probability for encoding a bit in a quantum system…
A quantum generalized divergence by definition satisfies the data-processing inequality; as such, the relative decrease in such a divergence under the action of a quantum channel is at most one. This relative decrease is formally known as…
Masking-based post-hoc explanation methods, such as KernelSHAP and LIME, estimate local feature importance by querying a black-box model under randomized perturbations. This paper formulates this procedure as communication over a query…
The operational characterization of quantum coherence is the corner stone in the development of resource theory of coherence. We introduce a new coherence quantifier based on max-relative entropy. We prove that max-relative entropy of…
Quantum communications promises reliable transmission of quantum information, efficient distribution of entanglement and generation of completely secure keys. For all these tasks, we need to determine the optimal point-to-point rates that…
Connecting multiple processors via quantum interconnect technologies could help overcome scalability issues in single-processor quantum computers. Transmission via these interconnects can be performed more efficiently using quantum…
The data processing inequality is the most basic requirement for any meaningful measure of information. It essentially states that distinguishability measures between states decrease if we apply a quantum channel and is the centerpiece of…