Related papers: A simple proof of the strong subadditivity inequal…
The data processing inequality (DPI) is a fundamental feature of information theory. Informally it states that you cannot increase the information content of a quantum system by acting on it with a local physical operation. When the smooth…
It is observed that the entropy reduction (the information gain in the initial terminology) of an efficient (ideal or pure) quantum measurement coincides with the generalized quantum mutual information of a q-c channel mapping an a priori…
In this short note, we give a simple derivation of the strong subadditivity inequalities: S(13) + S(23) \ge S(1) + S(2) and S(12) + S(23) \ge S(2) + S(123). The simplicity is due to the way we represent the quantum systems. We make a few…
Uncertainty relations provide constraints on how well the outcomes of incompatible measurements can be predicted, and, as well as being fundamental to our understanding of quantum theory, they have practical applications such as for…
We review with a tutorial scope the information theory foundations of quantum statistical physics. Only a small proportion of the variables that characterize a system at the microscopic scale can be controlled, for both practical and…
Information plays an important role in our understanding of the physical world. We hence propose an entropic measure of information for any physical theory that admits systems, states and measurements. In the quantum and classical world,…
The relative entropy is a principal measure of distinguishability in quantum information theory, with its most important property being that it is non-increasing with respect to noisy quantum operations. Here, we establish a remainder term…
The goal of this note is to show that Hastings' counterexample to the additivity of minimal output von Neumann entropy can be readily deduced from a sharp version of Dvoretzky's theorem on almost spherical sections of convex bodies.
We review the postulates of quantum mechanics that are needed to discuss the von Neumann's entropy. We introduce it as a generalization of Shannon's entropy and propose a simple game that makes easier understanding its physical meaning.
Is is shown here that the "simple test of quantumness for a single system" of arXiv:0704.1962 (for a recent experimental realization see arXiv:0804.1646) has exactly the same relation to the discussion of to the problem of describing the…
This paper presents self-contained proofs of the strong subadditivity inequality for quantum entropy and some related inequalities for the quantum relative entropy, most notably its convexity and its monotonicity under stochastic maps.…
In quantum information theory, von Neumann entropy plays an important role. The entropies can be obtained analytically only for a few states. In continuous variable system, even evaluating entropy numerically is not an easy task since the…
Relations among von Neumann entropies of different parts of an $N$-partite quantum system have direct impact on our understanding of diverse situations ranging from spin systems to quantum coding theory and black holes. Best formulated in…
Incremental information, as measured by the quantum entropy, is increasing when two ensembles are united. This result was proved by Lieb and Ruskai, and it is the foundation for the proof of strong subadditivity of quantum entropy. We…
The strong subadditivity of entropy plays a key role in several areas of physics and mathematics. It states that the entropy S[\rho]= - Tr (\rho \ln \rho) of a density matrix \rho_{123} on the product of three Hilbert spaces satisfies…
Integral representations of quantum relative entropy, and of the directional second and higher order derivatives of von Neumann entropy, are established, and used to give simple proofs of fundamental, known data processing inequalities: the…
In this paper, we derive a new generalisation of the strong subadditivity of the entropy to the setting of general conditional expectations onto arbitrary finite-dimensional von Neumann algebras. The latter inequality, which we call…
The joint convexity of the map $(X,A) \mapsto X^* A^{-1} X$, an integral representation of operator convex functions, and an observation of Ando are used to obtain a simple proof of both the joint convexity of relative entropy and a trace…
A new axiomatic characterization with a minimum of conditions for entropy as a function on the set of states in quantum mechanics is presented. Traditionally unspoken assumptions are unveiled and replaced by proven consequences of the…
The classical asymptotic equipartition property is the statement that, in the limit of a large number of identical repetitions of a random experiment, the output sequence is virtually certain to come from the typical set, each member of…