Related papers: Data processing for the sandwiched R\'enyi diverge…
The R\'enyi and Shannon entropies are information-theoretic measures which have enabled to formulate the position-momentum uncertainty principle in a much more adequate and stringent way than the (variance-based) Heisenberg-like relation.…
Quantum entanglement plays essential roles in quantum information processing. The monogamy and polygamy relations characterize the entanglement distributions in the multipartite systems. We present a class of monogamy inequalities related…
Data-processing inequalities capture the phenomenon that two probability distributions can only become less distinguishable under any common post-processing. For more fine-grained inequalities, one turns to strong data-processing inequality…
I compute the leading contribution to the ground state Renyi entropy $S_{\alpha}$ for a region of linear size $L$ in a Fermi liquid. The result contains a universal boundary law violating term simply related the more familiar entanglement…
Ensuring fairness in AI systems is critical, especially in high-stakes domains such as lending, hiring, and healthcare. This urgency is reflected in emerging global regulations that mandate fairness assessments and independent bias audits.…
For positive definite matrices $A$ and $B$, the Araki-Lieb-Thirring inequality amounts to an eigenvalue log-submajorisation relation for fractional powers $$\lambda(A^t B^t) \prec_{w(\log)} \lambda^t(AB), \quad 0<t\le 1,$$ while for…
We introduce a family of inhomogeneous XX spin chains whose squared couplings are a polynomial of degree at most four in the site index. We show how to obtain an asymptotic approximation for the R\'enyi entanglement entropy of all such…
It is not generally known, that the inequality that Bell derived using three random variables must be identically satisfied by any three corresponding data sets of plus and minus 1s that are writable on paper.This surprising fact is not…
In this paper, we explore the concept of pseudo R\'enyi entropy within the context of quantum field theories (QFTs). The transition matrix is constructed by applying operators situated in different regions to the vacuum state. Specifically,…
Bell's theorem sets a boundary between the classical and quantum realms, by providing a strict proof of the existence of entangled quantum states with no classical counterpart. An experimental violation of Bell's inequality demands…
Quantum entanglement is a crucial resource in quantum information processing, advancing quantum technologies. The greater the uncertainty in subsystems' pure states, the stronger the quantum entanglement between them. From the dual form of…
This paper studies a specific class of statistical divergences for spectral densities of time series: the spectral $\alpha$-R\'{e}nyi divergences, which include the Itakura-Saito divergence as a limiting case. The aim of this paper is to…
Bounds on information combining are a fundamental tool in coding theory, in particular when analyzing polar codes and belief propagation. They usually bound the evolution of random variables with respect to their Shannon entropy. In recent…
This paper focuses on solving a stochastic variational inequality (SVI) problem under relaxed smoothness assumption for a class of structured non-monotone operators. The SVI problem has attracted significant interest in the machine learning…
We examine the privacy amplification of channels that do not necessarily satisfy any LDP guarantee by analyzing their contraction behavior in terms of $f_\alpha$-divergence, an $f$-divergence related to R\'enyi-divergence via a monotonic…
We derive closed-form asymptotic formulas for the R\'enyi entanglement entropies of the open XX spin-$1/2$ chain by mapping the underlying determinant of the boundary correlation matrix (which has Toeplitz-plus-Hankel structure) to a Hankel…
In recent work, Akers et al. proved that the entanglement of purification $E_p(A:B)$ is bounded below by half of the $q$-R\'enyi reflected entropy $S_R^{(q)}(A:B)$ for all $q\geq2$, showing that $E_p(A:B) = \frac{1}{2} S_R^{(q)}(A:B)$ for a…
The entropy accumulation theorem, and its subsequent generalized version, is a powerful tool in the security analysis of many device-dependent and device-independent cryptography protocols. However, it has the drawback that the finite-size…
Designing machine learning algorithms that are accurate yet fair, not discriminating based on any sensitive attribute, is of paramount importance for society to accept AI for critical applications. In this article, we propose a novel fair…
This paper develops systematic approaches to obtain $f$-divergence inequalities, dealing with pairs of probability measures defined on arbitrary alphabets. Functional domination is one such approach, where special emphasis is placed on…