Strong Converse Exponent for Classical-Quantum Channel Coding

被引:0
|
作者
Milán Mosonyi
Tomohiro Ogawa
机构
[1] Budapest University of Technology and Economics,Mathematical Institute
[2] University of Electro-Communications,Graduate School of Information Systems
来源
关键词
D O I
暂无
中图分类号
学科分类号
摘要
We determine the exact strong converse exponent of classical-quantum channel coding, for every rate above the Holevo capacity. Our form of the exponent is an exact analogue of Arimoto’s, given as a transform of the Rényi capacities with parameters α>1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\alpha > 1}$$\end{document}. It is important to note that, unlike in the classical case, there are many inequivalent ways to define the Rényi divergence of states, and hence the Rényi capacities of channels. Our exponent is in terms of the Rényi capacities corresponding to a version of the Rényi divergences that has been introduced recently in Müller-Lennert et al. (J Math Phys 54(12):122203, 2013. arXiv:1306.3142), and Wilde et al. (Commun Math Phys 331(2):593–622, 2014. arXiv:1306.1586). Our result adds to the growing body of evidence that this new version is the natural definition for the purposes of strong converse problems.
引用
收藏
页码:373 / 426
页数:53
相关论文
共 50 条
  • [1] Strong Converse Exponent for Classical-Quantum Channel Coding
    Mosonyi, Milan
    Ogawa, Tomohiro
    [J]. COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2017, 355 (01) : 373 - 426
  • [2] Divergence Radii and the Strong Converse Exponent of Classical-Quantum Channel Coding With Constant Compositions
    Mosonyi, Milan
    Ogawa, Tomohiro
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (03) : 1668 - 1698
  • [3] Universal Coding for Classical-Quantum Channel
    Masahito Hayashi
    [J]. Communications in Mathematical Physics, 2009, 289 : 1087 - 1098
  • [4] Universal Coding for Classical-Quantum Channel
    Hayashi, Masahito
    [J]. COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2009, 289 (03) : 1087 - 1098
  • [5] Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding
    Hayashi, Masahito
    Cai, Ning
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (03) : 1822 - 1850
  • [6] Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding
    Hayashi, Masahito
    [J]. PHYSICAL REVIEW A, 2007, 76 (06):
  • [7] Approximation algorithms for classical-quantum channel coding
    Fawzi, Omar
    Seif, Johanna
    Szilagyi, Daniel
    [J]. 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2569 - 2573
  • [8] Strong converse to the quantum channel coding theorem
    Ogawa, T
    Nagaoka, H
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) : 2486 - 2489
  • [9] Multiple Quantum Hypothesis Testing Expressions and Classical-Quantum Channel Converse Bounds
    Vazquez-Vilar, Gonzalo
    [J]. 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 2854 - 2857
  • [10] Universal classical-quantum multiple access channel coding
    Hayashi, Masahito
    Cai, Ning
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 402 - 407