English
Related papers

Related papers: Marginal-constrained entropy accumulation theorem

200 papers

We investigate minimum output (R\'enyi) entropy of qubit channels and unital quantum channels. We obtain an exact formula for the minimum output entropy of qubit channels, and bounds for unital quantum channels. Interestingly, our bounds…

Quantum Physics · Physics 2019-12-02 Motohisa Fukuda , Gilad Gour

We discuss information-theoretic concepts on infinite-dimensional quantum systems. In particular, we lift the smooth entropy formalism as introduced by Renner and collaborators for finite-dimensional systems to von Neumann algebras. For the…

Quantum Physics · Physics 2015-12-02 Mario Berta , Fabian Furrer , Volkher B. Scholz

Entropic uncertainty relations are quantitative characterizations of Heisenberg's uncertainty principle, which make use of an entropy measure to quantify uncertainty. In quantum cryptography, they are often used as convenient tools in…

Quantum Physics · Physics 2012-06-22 Niek J. Bouman , Serge Fehr , Carlos González-Guillén , Christian Schaffner

It is well-known that von Neumann entropy is nonmonotonic unlike Shannon entropy (which is monotonically nondecreasing). Consequently, it is difficult to relate the entropies of the subsystems of a given quantum state. In this paper, we…

Quantum Physics · Physics 2011-04-07 Pradeep Sarvepalli

We present chain rules for a new definition of the quantum R\'enyi conditional entropy sometimes called the "sandwiched" R\'enyi conditional entropy. More precisely, we prove analogues of the equation $H(AB|C) = H(A|BC) + H(B|C)$, which…

Quantum Physics · Physics 2025-06-24 Frédéric Dupuis

In this article, we introduce the Sharma-Mittal entropy of a graph, which is a generalization of the existing idea of the von-Neumann entropy. The well-known R{\'e}nyi, Thallis, and von-Neumann entropies can be expressed as limiting cases…

Discrete Mathematics · Computer Science 2019-02-21 Souma Mazumdar , Amrik Singh , Supriyo Dutta , Sandeep Kumar Yadav , Partha Guha

We derive, for a bistochastic strictly contractive quantum channel on a matrix algebra, a relation between the contraction rate and the rate of entropy production. We also sketch some applications of our result to the statistical physics of…

Mathematical Physics · Physics 2007-05-23 Maxim Raginsky

Based on trajectory dependent path probability formalism in state space, we derive generalized entropy production fluctuation relations for a quantum system in the presence of measurement and feedback. We have obtained these results for…

Statistical Mechanics · Physics 2015-06-04 Shubhashis Rana , Sourabh Lahiri , A. M. Jayannavar

Using the bitstring probabilities of ground states of bipartitioned ladders of Rydberg atoms, we calculate the mutual information, which is a lower bound on the corresponding bipartite von Neumann quantum entanglement entropy $S^{vN}_A$. We…

We conclude a sequence of work by giving near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves on prior results that obtain…

Data Structures and Algorithms · Computer Science 2008-12-18 Nicholas J. A. Harvey , Jelani Nelson , Krzysztof Onak

Applying the theory of self-adjoint extensions of Hermitian operators to Koopman von Neumann classical mechanics, the most general set of probability distributions is found for which entropy is conserved by Hamiltonian evolution. A new…

Statistical Mechanics · Physics 2019-06-24 Gerard McCaul , Alexander Pechen , Denys I. Bondar

Data partitioning that maximizes/minimizes the Shannon entropy, or more generally the R\'enyi entropy is a crucial subroutine in data compression, columnar storage, and cardinality estimation algorithms. These partition algorithms can be…

Data Structures and Algorithms · Computer Science 2025-11-05 Aryan Esmailpour , Sanjay Krishnan , Stavros Sintos

We consider Hidden Markov Chains obtained by passing a Markov Chain with rare transitions through a noisy memoryless channel. We obtain asymptotic estimates for the entropy of the resulting Hidden Markov Chain as the transition rate is…

Information Theory · Computer Science 2010-12-10 Yuval Peres , Anthony Quas

This paper presents the notion of a variation entropy. This concept is an entropy framework for the gradient of the solution of a conservation law instead of on the solution itself. It appears that all semi-norms are admissible variation…

Numerical Analysis · Mathematics 2019-07-01 M. ten Eikelder , I. Akkerman

A notion of entangled Markov chain was introduced by Accardi and Fidaleo in the context of quantum random walk. They proved that, in the finite dimensional case, the corresponding states have vanishing entropy density, but they did not…

Quantum Physics · Physics 2007-05-23 Takayuki Miyadera

We derive a strengthened monotonicity inequality for quantum relative entropy by employing properties of $\alpha$-R\'{e}nyi relative entropy. We develop a unifying treatment towards the improvement of some quantum entropy inequalities. In…

Quantum Physics · Physics 2016-03-21 Lin Zhang

The maximum entropy principle, as applied to quantum systems, is a fundamental prescript positing that for a quantum system for which we only have partial knowledge, the maximum entropy state consistent with the partial knowledge is a…

Quantum Physics · Physics 2025-07-24 Siddhartha Das , Ujjwal Sen

A variety of new measures of quantum Renyi mutual information and quantum Renyi conditional entropy have recently been proposed, and some of their mathematical properties explored. Here, we show that the Renyi mutual information attains…

Quantum Physics · Physics 2016-10-20 Masahito Hayashi , Marco Tomamichel

We leverage the Gibbs inequality and its natural generalization to R\'enyi entropies to derive closed-form parametric expressions of the optimal lower bounds of $\rho$th-order guessing entropy (guessing moment) of a secret taking values on…

Information Theory · Computer Science 2024-01-31 Julien Béguinot , Olivier Rioul

Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…

Information Theory · Computer Science 2015-12-18 Jihad Fahs , Ibrahim Abou-Faycal