All inequalities for the relative entropy

From MaRDI portal
Publication:883003

DOI10.1007/S00220-006-0081-6zbMATH Open1122.82003arXivquant-ph/0511260OpenAlexW3103995399WikidataQ57522279 ScholiaQ57522279MaRDI QIDQ883003FDOQ883003

Noah Linden, Ben Ibinson, Andreas Winter

Publication date: 31 May 2007

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/quant-ph/0511260




Recommendations




Cites Work


Cited In (11)





This page was built for publication: All inequalities for the relative entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883003)