arXiv:1110.6321 · Linear and Multilinear Algebra

Entropy, stochastic matrices, and quantum operations

Lin Zhang

Published Mar 26, 2013• 1 citation

Abstract

The goal of the present paper is to derive some conditions on saturation of (strong) subadditivity inequality for the stochastic matrices. The notion of relative entropy of stochastic matrices is introduced by mimicking quantum relative entropy. Some properties of this concept are listed, and the connection between the entropy of the stochastic quantum operations and that of stochastic matrices are discussed.

DOI: 10.1080/03081087.2013.779266

Related papers

Quantum weighted entropy and its properties

Yu. M. Suhov, Stefan Zohren

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 entropy, as well as an analog of the Araki-Lieb inequality. Interesting byproducts of the proofs are a weighted analog of Klein's inequality and non-negativity of quantum weighted relative entropy. A main difficulty is the fact that the weights in general do not commute with the density matrices.

arXiv:1411.0892Nov 4, 20144 citations

Quantum Entropy and Correlations in Quantum Information

Reinhold A. Bertlmann, Nicolai Friis

Abstract Chapter 20 provides a discussion of entropies and entropic quantities in quantum information theory, briefly considering the generalizations of the Rényi entropy to the quantum regime, but mainly focusing on the von Neumann entropy and its properties such as concavity, the Araki-Lieb inequality, and subadditivity. We introduce the quantum relative entropy, quantum joint entropy, quantum conditional entropy, and quantum mutual information, and prove key properties and results for these quantities, including Klein’s inequality, joint convexity, additivity, and monotonicity under completely positive and trace-preserving maps of the relative entropy, as well as weak monotonicity and strong subadditivity of the von Neumann entropy. We then analyse the relation of (negative) conditional entropy and entanglement. In this context we discuss the conditional amplitude operator and the mutual amplitude operator, as well as conditional Rényi entropies and their role for entanglement detection.

Sep 7, 20230 citations

Inequalities for Quantum Entropy: A Review with Conditions for Equality

Mary Beth Ruskai

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. Moreover, the approach presented here, which is based on Klein's inequality and one of Lieb's less well-known concave trace functions, allows one to obtain conditions for equality. Using the fact that the Holevo bound on the accessible information in a quantum ensemble can be obtained as a consequence of the monotonicity of relative entropy, we show that equality can be attained for that bound only when the states in the ensemble commute. The paper concludes with an Appendix giving a short description of Epstein's elegant proof of the relevant concavity theorem of Lieb.

May 13, 2002159 citations

Inequalities for quantum entropy: A review with conditions for equality

Mary Beth Ruskai

This article presents self-contained proofs of the strong subadditivity inequality for von Neumann’s quantum entropy, S(ρ), and some related inequalities for the quantum relative entropy, most notably its convexity and its monotonicity under stochastic maps. Moreover, the approach presented here, which is based on Klein’s inequality and Lieb’s theorem that the function A→Tr eK+log A is concave, allows one to obtain conditions for equality. In the case of strong subadditivity, which states that S(ρ123)+S(ρ2)⩽S(ρ12)+S(ρ23) where the subscripts denote subsystems of a composite system, equality holds if and only if log ρ123=log ρ12−log ρ2+log ρ23. Using the fact that the Holevo bound on the accessible information in a quantum ensemble can be obtained as a consequence of the monotonicity of relative entropy, we show that equality can be attained for that bound only when the states in the ensemble commute. The article concludes with an Appendix giving a short description of Epstein’s elegant proof of Lieb’s theorem.

arXiv:quant-ph/0205064Journal of Mathematical PhysicsSep 1, 2002185 citations

Structure of states saturating an another version of strong subadditivity

Lin Zhang

Strong subadditivity inequality of quantum entropy, proved by Lieb and Ruskai, is a powerful tool in quantum information theory. The fact that the strong subadditivity inequality saturated only by a so-called Markov states is obtained in the recent literature [P. Hayden et al., Commun. Math. Phys. 246, 359 (2004).]. In this report, we will give a characterization to an another equivalent version of strong subadditivity inequality. The possible applications are discussed.

Sep 25, 20120 citations

Structure of states which satisfy strong subadditivity of quantum entropy with equality

Patrick M. Hayden, Richard Jozsa, Petz, D +1 more

We give an explicit characterisation of the quantum states which saturate the strong subadditivity inequality for the von Neumann entropy. By combining a result of Petz characterising the equality case for the monotonicity of relative entropy with a recent theorem by Koashi and Imoto, we show that such states will have the form of a so-called short quantum Markov chain, which in turn implies that two of the systems are independent conditioned on the third, in a physically meaningful sense. This characterisation simultaneously generalises known necessary and sufficient entropic conditions for quantum error correction as well as the conditions for the achievability of the Holevo bound on accessible information.

Apr 1, 2003279 citations