It is shown that the relative entropy converges to its equilibrium value when the states converge strongly. This can happen only for subalgebras for which the clustering is uniform. It happens for K-systems for which this uniformity in clustering has the maximal extent which is possible.
We consider sequences of measurements implemented by positive operator valued measures (POVMs). Starting from the assumption that these sequences may be described as consistent and Markovian, even and especially for closed quantum systems, we identify properties of the equilibrium state that coincide with the properties of typical pure quantum states. We define a physical entropy that converges against the standard entropies in the approach to equilibrium. Furthermore, strict limits to its possible decrease are derived on the basis of Renyi entropies. It is demonstrated that Landauer's principle follows directly from these limits. Since the above assumptions are rather strong, we exemplify the fact that they may nevertheless apply by checking them numerically for some transition paths in a concrete model.
This paper is a contribution to the general theory of quantum spin systems. We deal with a general theory in the sense that no concrete interaction shows up but an arbitrary relatively short-range interaction is chosen. It is well known that the mean entropy plays an important role in the thermodynamics of quantum spin systems: it is one of the ingredients of the Lanford–Ruelle–Robinson variational principle. We show that in the background of the existence of the mean entropy, there is an operator convergence which resembles the McMillan theorem from information theory. Asymptotic equipartition property and several entropy densities are investigated, in particular, the relation of the Gibbs condition to relative entropies. Although this paper is not intended to be a review, we try to give an overview of the theory of quantum Gibbs states in the mathematical sense. The paper is organized as follows. Section 1 provides an introduction and further sections contain our new results. Each section is closed with a short discussion on sources and references.
To calculate the entropy of a subalgebra or of a channel with respect to a state, one has to solve an intriguing optimalization problem. The latter is also the key part in the entanglement of formation concept, in which case the subalgebra is a subfactor. I consider some general properties, valid for these definitions in finite dimensions, and apply them to a maximal commutative subalgebra of a full matrix algebra. The main method is an interplay between convexity and symmetry. A collection of helpful tools from convex analysis for the problems in question is collected in an appendix.