English
Related papers

Related papers: On Information Links

200 papers

It is well-known:Suppose there are three 1-dimensional links $K_+$, $K_-$, $K_0$ such that $K_+$, $K_-$, and $K_0$ coincide out of a 3-ball $B$ trivially embedded in $S^3$ and that $K_+\cap B$, $K_-\cap B$, and $K_0\cap B$ are drawn as…

Geometric Topology · Mathematics 2007-05-23 Eiji Ogasa

We define a sequence of integer-valued invariants $\gamma^k(L)$ for a $3$-component link $L$. We prove that the resulting $\gamma$-invariants are invariant under concordance, and more generally under weak cobordism, and that they lift…

Geometric Topology · Mathematics 2026-05-25 Christopher W. Davis , JungHwan Park

We study the relation between the quantum conditional mutual information and the quantum $\alpha$-R\'enyi divergences. Considering the totally antisymmetric state we show that it is not possible to attain a proper generalization of the…

Quantum Physics · Physics 2015-06-23 Paul Erker

Lieb and Ruskai's strong subadditivity theorem, which shows that the conditional mutual information must be nonnegative, is fundamental in quantum theory. It has numerous applications, such as in quantum error correction. When the mutual…

Quantum Physics · Physics 2026-05-26 Zhou Gang

If L_1 and L_2 are two Brunnian links with all pairwise linking numbers 0, then we show that L_1 and L_2 are equivalent if and only if they have homeomorphic complements. In particular, this holds for all Brunnian links with at least three…

Geometric Topology · Mathematics 2014-10-01 Brian Mangum , Theodore Stanford

Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special case of the well known disjointness problem, and the…

Computational Complexity · Computer Science 2009-02-11 André Gronemeier

Many network information theory problems face the similar difficulty of single letterization. We argue that this is due to the lack of a geometric structure on the space of probability distribution. In this paper, we develop such a…

Information Theory · Computer Science 2012-06-19 Shao-Lun Huang , Lizhong Zheng

Interaction information is one of the multivariate generalizations of mutual information, which expresses the amount information shared among a set of variables, beyond the information, which is shared in any proper subset of those…

Artificial Intelligence · Computer Science 2017-02-01 AmirEmad Ghassami , Negar Kiyavash

One of the main notions of information theory is the notion of mutual information in two messages (two random variables in Shannon information theory or two binary strings in algorithmic information theory). The mutual information in $x$…

Information Theory · Computer Science 2012-06-19 Ilya Razenshteyn

Extracting higher-order structures from multivariate data has become an area of intensive study in complex systems science, as these multipartite interactions can reveal insights into fundamental features of complex systems like emergent…

Information Theory · Computer Science 2026-01-14 Thomas F. Varley

We consider an extension of $\epsilon$-entropy to a KL-divergence based complexity measure for randomized density estimation methods. Based on this extension, we develop a general information-theoretical inequality that measures the…

Statistics Theory · Mathematics 2007-06-13 Tong Zhang

I review the relation of the Bell inequalities - characteristic of (classical) probabilities defined on Boolean logics - with noncontextual and local hidden variables theories of quantum mechanics and with quantum information.

Quantum Physics · Physics 2021-06-16 Emilio Santos

Combining the Information Bottleneck model with deep learning by replacing mutual information terms with deep neural nets has proved successful in areas ranging from generative modelling to interpreting deep neural networks. In this paper,…

Machine Learning · Computer Science 2020-02-19 Aleksander Wieczorek , Volker Roth

We establish a reversal of Lyapunov's inequality for monotone log-concave sequences, settling a conjecture of Havrilla-Tkocz and Melbourne-Tkocz. A strengthened version of the same conjecture is disproved through counter example. We also…

Information Theory · Computer Science 2021-11-16 James Melbourne , Gerardo Palafox-Castillo

We give a congruence relating a one variable specialization of the two variable Kauffman polynomial of any periodic link to that of its mirror image. Consequently, we obtain a new and simple criterion for periodicity of links.

Geometric Topology · Mathematics 2016-05-31 Khaled Qazaqzeh , Ayman Aboufattoum , Kyle Istvan

In this paper, a lower bound of quantum conditional mutual information is obtained by employing the Peierls-Bogoliubov inequality and Golden Thompson inequality. Comparison with the bounds obtained by other researchers indicates that our…

Quantum Physics · Physics 2014-10-01 Lin Zhang , Junde Wu

We provide necessary and sufficient conditions for hypercontractivity of the minima of nonnegative, i.i.d. random variables and of both the maxima of minima and the minima of maxima for such r.v.'s. It turns out that the idea of…

We present a new notion $R_\ell$ of higher-order common information, which quantifies the information that $\ell\geq 2$ arbitrarily distributed random variables have in common. We provide analytical lower bounds on $R_3$ and $R_4$ for…

Information Theory · Computer Science 2024-06-05 Jan Østergaard

It has been proposed that cobordism and K-theory groups, which can be mathematically related in certain cases, are physically associated to generalised higher-form symmetries. As a consequence, they should be broken or gauged in any…

High Energy Physics - Theory · Physics 2023-04-12 Ralph Blumenhagen , Niccolò Cribiori , Christian Kneissl , Andriana Makridou

In some scenarios there are ways of conveying information with many fewer, even exponentially fewer, qubits than possible classically. Moreover, some of these methods have a very simple structure--they involve only few message exchanges…

Quantum Physics · Physics 2018-03-22 Hartmut Klauck , Ashwin Nayak , Amnon Ta-Shma , David Zuckerman