Related papers: A simple proof of the strong subadditivity inequal…
The von Neumann entropy of an $n$-partite system $A_1^n$ given a system $B$ can be written as the sum of the von Neumann entropies of the individual subsystems $A_k$ given $A_1^{k-1}$ and $B$. While it is known that such a chain rule does…
K. He, J. Hou, and M. Li have recently given a sufficient and necessary condition for unitary equivalence of quantum states. This condition is based on the von Neumann entropy. In this note we first give a short proof of their result, and…
Regarding the strange properties of quantum entropy and entanglement, e.g., the negative quantum conditional entropy, we revisited the foundations of quantum entropy, namely, von Neumann entropy, and raised the new method of quantum…
The von Neumann entropy of a $k$-body reduced density matrix $\gamma_k$ quantifies the entanglement between $k$ quantum particles and the remaining ones. In this short paper, we rigorously prove general properties of this entanglement…
The von Neumann entropy is a key quantity in quantum information theory and, roughly speaking, quantifies the amount of quantum information contained in a state when many identical and independent i.i.d. copies of the state are available,…
Observational entropy provides a general notion of quantum entropy that appropriately interpolates between Boltzmann's and Gibbs' entropies, and has recently been argued to provide a useful measure of out-of-equilibrium thermodynamic…
We give a simple proof of the uncertainty principle with quantum side information, as in [Berta et al. Nature Physics 6, 659 (2010)], invoking the monotonicity of the relative entropy. Our proof shows that the entropic uncertainty principle…
We prove number of quantitative stability bounds for the cases of equality in Petz's monotonicity theorem for quasi-relative entropies defined in terms of an operator monotone decreasing functions. Included in our results is a bound in…
Yet another simple proof of the entropy power inequality is given, which avoids both the integration over a path of Gaussian perturbation and the use of Young's inequality with sharp constant or R\'enyi entropies. The proof is based on a…
In this Thesis, several results in quantum information theory are collected, most of which use entropy as the main mathematical tool. *While a direct generalization of the Shannon entropy to density matrices, the von Neumann entropy behaves…
For all 1 < p < 2, we demonstrate the existence of quantum channels with non-multiplicative maximal p-norms. Equivalently, the minimum output Renyi entropy of order p of a quantum channel is not additive for all 1 < p < 2. The violations…
We introduce quantum weighted entropy in analogy to an earlier notion of (classical) weighted entropy and derive many of its properties. These include the subadditivity, concavity and strong subadditivity property of quantum weighted…
In the present paper we prove a family of tight upper and lower bounds for the Shannon entropy and von Neumann entropy based on the p-norms. This allows us to have an entropy estimate, a criterion for the finiteness of it and a bound on the…
The familiar second derivative test for convexity, combined with resolvent calculus, is shown to yield a useful tool for the study of convex matrix-valued functions. We demonstrate the applicability of this approach on a number of theorems…
Does the sum of correlations in subsystems constitute the correlation in the total system? Such a concept can be expressed by an additivity relationship of correlations. From a strong subadditivity condition of von Neumann entropy, four…
The strong recurrence is equivalent to the Riemann hypothesis. In the present paper, we give a simple proof of the generalized strong recurrence for all non-zero parameters.
An essential quantity in quantum information theory is the von Neumann entropy which depends entirely on the quantum density operator. Once known, the density operator reveals the statistics of observables in a quantum process, and the…
The von Neumann entropy and the subentropy of a mixed quantum state are upper and lower bounds, respectively, on the accessible information of any ensemble consistent with the given mixed state. Here we define and investigate a set of…
We prove a lower bound on the relative entropy between two finite-dimensional states in terms of their entropy difference and the dimension of the underlying space. The inequality is tight in the sense that equality can be attained for any…
In this paper, we characterize the saturation of four universal inequalities in quantum information theory, including a variant version of strong subadditivity inequality for von Neumann entropy, the coherent information inequality, the…