English
Related papers

Related papers: Conditional Information Inequalities for Entropic …

200 papers

A definition of the nonadditive (nonextensive) conditional entropy indexed by q is presented. Based on the composition law in terms of it, the Shannon-Khinchin axioms are generalized and the uniqueness theorem is established for the Tsallis…

Quantum Physics · Physics 2007-05-23 Sumiyoshi Abe , A. K. Rajagopal

Quantum entropy and skew information play important roles in quantum information science. They are defined by the trace of the positive operators so that the trace inequalities often have important roles to develop the mathematical theory…

Functional Analysis · Mathematics 2010-08-23 Shigeru Furuichi

A direct connection of information entropy $S$ and kinetic energy $T$ is obtained for nuclei and atomic clusters, which establishes $T$ as a measure of the information in a distribution. It is conjectured that this is a universal property…

Nuclear Theory · Physics 2009-11-07 S. E. Massen , C. P. Panos

We prove the quantum conditional Entropy Power Inequality for quantum additive noise channels. This inequality lower bounds the quantum conditional entropy of the output of an additive noise channel in terms of the quantum conditional…

Quantum Physics · Physics 2018-12-05 Giacomo De Palma , Stefan Huber

The challenge of equality in the strong subadditivity inequality of entropy is approached via a general additivity of correlation information in terms of nonoverlapping clusters of subsystems in multipartite states (density operators). A…

Quantum Physics · Physics 2007-05-23 Fedor Herbut

In this paper a general definition of quantum conditional entropy for infinite-dimensional systems is given based on recent work of Holevo and Shirokov arXiv:1004.2495 devoted to quantum mutual and coherent informations in the…

Mathematical Physics · Physics 2021-11-24 A. A. Kuznetsova

According to E.T. Jaynes and E.P. Wigner, entropy is an anthropomorphic concept in the sense that in a physical system correspond many thermodynamic systems. The physical system can be examined from many points of view each time examining…

Information Theory · Computer Science 2015-12-03 Panteleimon Rodis

This paper studies the informativity problem for reachability and null-controllability of constrained systems. To be precise, we will focus on an unknown linear systems with convex conic constraints from which we measure data consisting of…

Optimization and Control · Mathematics 2021-05-03 Jaap Eising , M. Kanat Camlibel

The Shannon-Khinchin axioms for the ordinary information entropy are generalized in a natural way to the nonextensive systems based on the concept of nonextensive conditional entropy, and a complete proof of the uniqueness theorem for the…

Statistical Mechanics · Physics 2009-10-31 Sumiyoshi Abe

The chain rule for the Shannon and von Neumann entropy, which relates the total entropy of a system to the entropies of its parts, is of central importance to information theory. Here we consider the chain rule for the more general smooth…

Quantum Physics · Physics 2013-10-25 Alexander Vitanov , Frederic Dupuis , Marco Tomamichel , Renato Renner

Thermodynamic entropy, as defined by Clausius, characterizes macroscopic observations of a system based on phenomenological quantities such as temperature and heat. In contrast, information-theoretic entropy, introduced by Shannon, is a…

Quantum Physics · Physics 2017-01-04 Mirjam Weilenmann , Lea Krämer , Philippe Faist , Renato Renner

Entropic uncertainty relations provide an information-theoretic framework for quantifying the fundamental indeterminacy inherent in quantum mechanics. We propose more stringent quantum-memory-assisted entropic uncertainty relations for…

Quantum Physics · Physics 2026-04-07 Qing-Hua Zhang , Cong Xu , Jing-Feng Wu , Shao-Ming Fei

We propose a generalization of the asymptotic equipartition property to discrete sources with an ambiguous alphabet, and prove that it holds for irreducible stationary Markov sources with an arbitrary distinguishability relation. Our…

Information Theory · Computer Science 2022-07-29 Tamás Tasnádi , Péter Vrana

The assumption of local realism in a Bell locality scenario imposes non-trivial conditions on the Shannon entropies of the associated probability distributions, expressed by linear entropic Bell inequalities. In principle, these entropic…

Quantum Physics · Physics 2013-06-24 Rafael Chaves

In this thesis, we provide an initial investigation into bounds for topological entropy of switched linear systems. Entropy measures, roughly, the information needed to describe the behavior of a system with finite precision on finite time…

Optimization and Control · Mathematics 2016-10-14 James Schmidt

The derivation of Bell inequalities in terms of quantum statistical (thermodynamic) entropies is considered. Inequalities of the Wigner form are derived but shown to be extremely limiting in their applicability due to the nature of the…

Quantum Physics · Physics 2007-05-23 Ian T. Durham

Although compartmental dynamical systems are used in many different areas of science, model selection based on the maximum entropy principle (MaxEnt) is challenging because of the lack of methods for quantifying the entropy for this type of…

Information Theory · Computer Science 2023-08-23 Holger Metzler , Carlos A. Sierra

We show that a proper expression of the uncertainty relation for a pair of canonically-conjugate continuous variables relies on entropy power, a standard notion in Shannon information theory for real-valued signals. The resulting…

Quantum Physics · Physics 2018-01-16 Anaelle Hertz , Michael G. Jabbour , Nicolas J. Cerf

The information-theoretic representation of quantum systems, which complements the familiar energy description of the density-functional and wave-function-based theories, is here discussed. According to it, the internal disorder of the…

Quantum Physics · Physics 2013-05-27 J. S. Dehesa , D. Manzano , P. S. Sánchez-Moreno , R. J. Yáñez

There are (at least) three approaches to quantifying information. The first, algorithmic information or Kolmogorov complexity, takes events as strings and, given a universal Turing machine, quantifies the information content of a string as…

Information Theory · Computer Science 2011-11-29 David Balduzzi