Monotonicity of quantum relative entropy revisited

Monotonicity under coarse-graining is a crucial property of the quantum relative entropy. The aim of this paper is to investigate the condition of equality in the monotonicity theorem and in its consequences such as the strong sub-additivity of the von Neumann entropy, the Golden-Thompson trace inequality and the monotonicity of the Holevo quantity.The relation to quantum Markovian states is briefly indicated.Comment: 13 pages, LATEX fil

All Inequalities for the Relative Entropy

The relative entropy of two n-party quantum states is an important quantity exhibiting, for example, the extent to which the two states are different. The relative entropy of the states formed by reducing two n-party to a smaller number $m$ of parties is always less than or equal to the relative entropy of the two original n-party states. This is the monotonicity of relative entropy. Using techniques from convex geometry, we prove that monotonicity under restrictions is the only general inequality satisfied by relative entropies. In doing so we make a connection to secret sharing schemes with general access structures. A suprising outcome is that the structure of allowed relative entropy values of subsets of multiparty states is much simpler than the structure of allowed entropy values. And the structure of allowed relative entropy values (unlike that of entropies) is the same for classical probability distributions and quantum states.Comment: 15 pages, 3 embedded eps figure

Second Law-Like Inequalities with Quantum Relative Entropy: An Introduction

We review the fundamental properties of the quantum relative entropy for finite-dimensional Hilbert spaces. In particular, we focus on several inequalities that are related to the second law of thermodynamics, where the positivity and the monotonicity of the quantum relative entropy play key roles; these properties are directly applicable to derivations of the second law (e.g., the Clausius inequality). Moreover, the positivity is closely related to the quantum fluctuation theorem, while the monotonicity leads to a quantum version of the Hatano-Sasa inequality for nonequilibrium steady states. Based on the monotonicity, we also discuss the data processing inequality for the quantum mutual information, which has a similar mathematical structure to that of the second law. Moreover, we derive a generalized second law with quantum feedback control. In addition, we review a proof of the monotonicity in line with Petz.Comment: As a chapter of: M. Nakahara and S. Tanaka (eds.), "Lectures on Quantum Computing, Thermodynamics and Statistical Physics", Kinki University Series on Quantum Computing (World Scientific, 2012

On the structure of isentropes of polynomial maps

The structure of isentropes (i.e. level sets of constant topological entropy) including the monotonicity of entropy, has been studied for polynomial interval maps since the 1980s. We show that isentropes of multimodal polynomial families need not be locally connected and that entropy does in general not depend monotonically on a single critical value.Comment: 16 page

Two remarks on generalized entropy power inequalities

This note contributes to the understanding of generalized entropy power inequalities. Our main goal is to construct a counter-example regarding monotonicity and entropy comparison of weighted sums of independent identically distributed log-concave random variables. We also present a complex analogue of a recent dependent entropy power inequality of Hao and Jog, and give a very simple proof.Comment: arXiv:1811.00345 is split into 2 papers, with this being on