Tightening Continuity Bounds for Entropies and Bounds on Quantum Capacities

被引:0
|
作者
Jabbour, Michael G. [1 ]
Datta, Nilanjana [2 ]
机构
[1] Univ Libre Bruxelles, Ecole Polytech Bruxelles, Ctr Quantum Informat & Commun, CP 165-59, B-1050 Brussels, Belgium
[2] Univ Cambridge, Ctr Math Sci, Dept Appl Math & Theoret Phys, Cambridge CB3 0WA, England
关键词
Entropy; Probability distribution; Upper bound; Information theory; Quantum state; Hilbert space; Diamonds; Channel capacity; Vectors; Random variables; Continuity bound; von Neumann entropy; operator norm; completely bounded norm; semidefinite programs; quantum capacity; private classical capacity; NORMS;
D O I
10.1109/JSAIT.2024.3469929
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between probability distributions or quantum states, typically, the total variation- or trace distance. However, if an additional distance measure is known, the continuity bounds can be significantly strengthened. Here, we prove a tight uniform continuity bound for the Shannon entropy in terms of both the local- and total variation distances, sharpening an inequality in (Sason, 2013). We also obtain a uniform continuity bound for the von Neumann entropy in terms of both the operator norm- and trace distances. We then apply our results to compute upper bounds on channel capacities. We first refine the concept of approximate degradable channels by introducing $(\varepsilon ,\nu)$ -degradable channels. These are $\varepsilon $ -close in diamond norm and $\nu $ -close in completely bounded spectral norm to their complementary channel when composed with a degrading channel. This leads to improved upper bounds to the quantum- and private classical capacities of such channels. Moreover, these bounds can be further improved by considering certain unstabilized versions of the above norms. We show that upper bounds on the latter can be efficiently expressed as semidefinite programs. As an application, we obtain a new upper bound on the quantum capacity of the qubit depolarizing channel.
引用
收藏
页码:645 / 658
页数:14
相关论文
共 50 条
  • [31] Chaining Mutual Information and Tightening Generalization Bounds
    Asadi, Amir R.
    Abbe, Emmanuel
    Verdu, Sergio
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [32] On efficiency of tightening bounds in interval global optimization
    Zilinskas, Antanas
    Zilinskas, Julius
    APPLIED PARALLEL COMPUTING: STATE OF THE ART IN SCIENTIFIC COMPUTING, 2006, 3732 : 197 - 205
  • [33] Tightening Bounds for Bayesian Network Structure Learning
    Fan, Xiannian
    Yuan, Changhe
    Malone, Brandon
    PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 2439 - 2445
  • [34] Tightening robust price bounds for exotic derivatives
    Luetkebohmert, Eva
    Sester, Julian
    QUANTITATIVE FINANCE, 2019, 19 (11) : 1797 - 1815
  • [35] Tightening Upper Bounds for Approximate State Conversion
    Hai-Xin Zuo
    Feng Liu
    International Journal of Theoretical Physics, 61
  • [36] On Tightening the M-Best MAP Bounds
    Cheng, Qiang
    Chen, Li
    Xing, Yuanjian
    Yang, Yuhao
    PATTERN RECOGNITION (CCPR 2016), PT I, 2016, 662 : 625 - 637
  • [37] PRECISE ESTIMATES OF BOUNDS ON RELATIVE OPERATOR ENTROPIES
    Furuichi, Shigeru
    MATHEMATICAL INEQUALITIES & APPLICATIONS, 2015, 18 (03): : 869 - 877
  • [38] Bounds for degree-based network entropies
    Chen, Zengqiang
    Dehmer, Matthias
    Shi, Yongtang
    APPLIED MATHEMATICS AND COMPUTATION, 2015, 265 : 983 - 993
  • [39] Rigorous bounds to information entropies for atomic systems
    Tao, JM
    Li, GB
    Li, JM
    PHYSICA SCRIPTA, 1997, 56 (03): : 284 - 288
  • [40] TIGHT RIGOROUS BOUNDS TO ATOMIC INFORMATION ENTROPIES
    ANGULO, JC
    DEHESA, JS
    JOURNAL OF CHEMICAL PHYSICS, 1992, 97 (09): : 6485 - 6495