Related papers: On Information Links
We prove that the quantum Gibbs states of spin systems above a certain threshold temperature are approximate quantum Markov networks, meaning that the conditional mutual information decays rapidly with distance. We demonstrate the…
In this paper, we study measures of quantum non-Markovianity based on the conditional mutual information. We obtain such measures by considering multiple parts of the total environment such that the conditional mutual information can be…
Comparing the top $k$ elements between two or more ranked results is a common task in many contexts and settings. A few measures have been proposed to compare top $k$ lists with attractive mathematical properties, but they face a number of…
We investigate the Bell-Mermin-Klyshko inequalities and the one-way information deficit of Dirac fields in noninertial frames, where the quantum correlations are shared between inertial and accelerated observers due to the Unruh effect. We…
We investigate the delocalization of quantum information in the nonequilibrium dynamics of the $XY$ spin chain with asymptotically decaying interactions $\sim 1/r^{\alpha}$. As a figure of merit, we employ the tripartite mutual information…
Information bottleneck (IB) is a paradigm to extract information in one target random variable from another relevant random variable, which has aroused great interest due to its potential to explain deep neural networks in terms of…
The possibility of calculation of the conditional and unconditional complexity of description of information objects in the algorithmic theory of information is connected with the limitations for the set of the used languages of programming…
Information flow provides a natural measure for the causal interaction between dynamical events. This study extends our previous rigorous formalism of componentwise information flow to the bulk information flow between two complex…
We study the top-$K$ ranking problem where the goal is to recover the set of top-$K$ ranked items out of a large collection of items based on partially revealed preferences. We consider an adversarial crowdsourced setting where there are…
In this paper we give a first set of communication lower bounds for distributed clustering problems, in particular, for k-center, k-median and k-means. When the input is distributed across a large number of machines and the number of…
In this note, we recall the definition of the binary branching model with Moran type interactions (BBMMI) introduced in [8]. In this interacting particle system, particles evolve, reproduce and die independently and, with a probability that…
Two alternative exact characterizations of the minimum error probability of Bayesian M-ary hypothesis testing are derived. The first expression corresponds to the error probability of an induced binary hypothesis test and implies the…
A space-time symmetric and explicitly Lorentz covariant path integral formalism of relativistic quantum mechanics is proposed, which produces partial locally correlations of quantum processes of massive particles with the velocity of light…
We use Khovanov and Kuperberg's web growth rules to identify the minimal term in the invariant associated to an $\text{SL}_3$ web diagram, with respect to a particular term order.
We develop a microscopic approach to the kinetic theory of many-particle systems with dissipative and potential interactions in presence of active fluctuations. The approach is based on a generalization of Bogolyubov--Peletminsky reduced…
While the quantum mutual information is a fundamental measure of quantum information, it is only defined for spacelike-separated quantum systems. Such a limitation is not present in the theory of classical information, where the mutual…
This contribution presents a Bayesian approach to the issue of linking of the results from key comparison measurements. A mathematical treatment based on Bayesian statistics for the analysis of the results from two comparisons with some…
The sum of $n$ {non-independent} Bernoulli random variables could be modeled in several different ways. One of these is the Multiplicative Binomial Distribution (MBD), introduced by Altham (1978) and revised by Lovison (1998). In this work,…
We derive a tight lower bound on equivocation (conditional entropy), or equivalently a tight upper bound on mutual information between a signal variable and channel outputs. The bound is in terms of the joint distribution of the signals and…
Several variations of the classical Kalman-Yakubovich-Popov Lemma, as well the associated minimax theorem are presented.