Belavkin–Staszewski Relative Entropy, Conditional Entropy, and Mutual Information

Author:

Zhai YuanORCID,Yang Bo,Xi Zhengjun

Abstract

Belavkin–Staszewski relative entropy can naturally characterize the effects of the possible noncommutativity of quantum states. In this paper, two new conditional entropy terms and four new mutual information terms are first defined by replacing quantum relative entropy with Belavkin–Staszewski relative entropy. Next, their basic properties are investigated, especially in classical-quantum settings. In particular, we show the weak concavity of the Belavkin–Staszewski conditional entropy and obtain the chain rule for the Belavkin–Staszewski mutual information. Finally, the subadditivity of the Belavkin–Staszewski relative entropy is established, i.e., the Belavkin–Staszewski relative entropy of a joint system is less than the sum of that of its corresponding subsystems with the help of some multiplicative and additive factors. Meanwhile, we also provide a certain subadditivity of the geometric Rényi relative entropy.

Funder

National Natural Science Foundation of China

Publisher

MDPI AG

Subject

General Physics and Astronomy

Reference36 articles.

1. On measures of information and entropy;Rényi;Proc. Symp. Math. Stat. Probab.,1961

2. On Information and Sufficiency

3. Elements of Information Theory;Cover,2006

4. Information Theory: Coding Theorems for Discrete Memoryless Systems;Csiszár,2011

5. Quantum information processing with finite resources;Tomamichel;arXiv,2015

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Continuity of Quantum Entropic Quantities via Almost Convexity;IEEE Transactions on Information Theory;2023-09

2. Chain rules for a mutual information based on Rényi zero-relative entropy;Physical Review A;2023-07-10

3. General Continuity Bounds for Quantum Relative Entropies;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

4. Bounds for smooth min- and max-entropy;Quantum Information Processing;2023-05-19

5. Data release for machine learning via correlated differential privacy;Information Processing & Management;2023-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3