Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications in Mathematical Physics

Entropy inequalities

Huzihiro Araki, Élliott H. Lieb

Published Jun 1, 1970• 568 citations
Publisher
DOI
10.1007/bf01646092

Related papers

The conditional entropy power inequality for quantum additive noise channels

Giacomo De Palma, Stefan Huber

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 entropies of the input state and the noise when they are conditionally independent given the memory. We also show that this conditional entropy power inequality is optimal in the sense that we can achieve equality asymptotically by choosing a suitable sequence of Gaussian input states. We apply the conditional entropy power inequality to find an array of information-theoretic inequalities for conditional entropies which are the analogs of inequalities which have already been established in the unconditioned setting. Furthermore, we give a simple proof of the convergence rate of the quantum Ornstein-Uhlenbeck semigroup based on entropy power inequalities.

arXiv:1803.00470•Journal of Mathematical Physics•Dec 1, 2018•19 citations

Combinatorial properties of holographic entropy inequalities

Guglielmo Grimaldi, Matthew Headrick, Veronika E. Hubeny +1 more

A holographic entropy inequality (HEI) is a linear inequality obeyed by Ryu-Takayanagi holographic entanglement entropies, or equivalently by the minimum cut function on weighted graphs. We establish a new combinatorial framework for studying HEIs, and use it to prove several properties they share, including two majorization-related properties as well as a necessary and sufficient condition for an inequality to be an HEI. We thereby resolve all the conjectures presented in [arXiv:2508.21823], proving two of them and disproving the other two. In particular, we show that the null reduction of any superbalanced HEI passes the majorization test defined in [arXiv:2508.21823], thereby providing strong new evidence that all HEIs are obeyed in time-dependent holographic states.

hep-thCross-listedarXiv:2601.09987•Jan 16, 2026

Entropy Inequalities

Huzihiro Araki, Élliott H. Lieb

Springer eBooks•Jan 1, 2002•12 citations

Weighted entropy

Silviu Guiaşu

Reports on Mathematical Physics•Sep 1, 1971•156 citations

A note on relative entropy

Rodney W. Benoist, Jean-Paul Marchand, Walter Wyss

Letters in Mathematical Physics•May 1, 1979•8 citations

On some entropy inequalities

Lin Zhang

In this short report, we give some new entropy inequalities based on Rényi relative entropy and the observation made by Berta {\em et al} [arXiv:1403.6102]. These inequalities obtained extends some well-known entropy inequalities. We also obtain a condition under which a tripartite operator becomes a Markov state.

arXiv:1403.6590•Mar 26, 2014•3 citations
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 entropies of the input state and the noise when they are conditionally independent given the memory. We also show that this conditional entropy power inequality is optimal in the sense that we can achieve equality asymptotically by choosing a suitable sequence of Gaussian input states. We apply the conditional entropy power inequality to find an array of information-theoretic inequalities for conditional entropies which are the analogs of inequalities which have already been established in the unconditioned setting. Furthermore, we give a simple proof of the convergence rate of the quantum Ornstein-Uhlenbeck semigroup based on entropy power inequalities.
A holographic entropy inequality (HEI) is a linear inequality obeyed by Ryu-Takayanagi holographic entanglement entropies, or equivalently by the minimum cut function on weighted graphs. We establish a new combinatorial framework for studying HEIs, and use it to prove several properties they share, including two majorization-related properties as well as a necessary and sufficient condition for an inequality to be an HEI. We thereby resolve all the conjectures presented in [arXiv:2508.21823], proving two of them and disproving the other two. In particular, we show that the null reduction of any superbalanced HEI passes the majorization test defined in [arXiv:2508.21823], thereby providing strong new evidence that all HEIs are obeyed in time-dependent holographic states.