Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding

被引:0
|
作者
Hayashi, Masahito [1 ,2 ,3 ,4 ]
Cai, Ning [5 ]
机构
[1] Southern Univ Sci & Technol, Shenzhen Inst Quantum Sci & Engn, Shenzhen 518055, Peoples R China
[2] Southern Univ Sci & Technol, Guangdong Prov Key Lab Quantum Sci & Engn, Shenzhen 518055, Peoples R China
[3] Int Quantum Acad SIQA, Shenzhen 518048, Peoples R China
[4] Nagoya Univ, Grad Sch Math, Nagoya, Aichi 4648602, Japan
[5] ShanghaiTech Univ, Sch Informat Sci & Technol, Shanghai 201210, Peoples R China
关键词
Codes; Decoding; Compounds; Receivers; Error probability; Channel coding; Channel capacity; Universal code; Schur duality; multiple access channel; broadcast channel with degraded message sets; compound channel; packing lemma; classical-quantum channel; BROADCAST CHANNELS; ERROR EXPONENTS; CAPACITY; CODES; COMPOUND; THEOREM;
D O I
10.1109/TIT.2021.3131575
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding by using generalized packing lemmas for the type method. Using our classical-quantum universal superposition code, we establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets. Our universal classical-quantum multiple access channel codes have two types of codes. One is a code with joint decoding and the other is a code with separate decoding. It is not so easy to construct a former code that universally achieves general points of the capacity region beyond corner points. First, we construct the latter code that universally achieves general points of the capacity region. Then, converting the latter code to the former coder, we construct the above desired code with the former type.
引用
收藏
页码:1822 / 1850
页数:29
相关论文
共 50 条
  • [1] Universal classical-quantum multiple access channel coding
    Hayashi, Masahito
    Cai, Ning
    [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 402 - 407
  • [2] Universal Coding for Classical-Quantum Channel
    Masahito Hayashi
    [J]. Communications in Mathematical Physics, 2009, 289 : 1087 - 1098
  • [3] Universal Coding for Classical-Quantum Channel
    Hayashi, Masahito
    [J]. COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2009, 289 (03) : 1087 - 1098
  • [4] 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
  • [5] Cooperation for the Classical-Quantum Multiple Access Channel
    Boche, H.
    Noetzel, J.
    [J]. 2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 156 - 160
  • [6] Strong Converse Exponent for Classical-Quantum Channel Coding
    Milán Mosonyi
    Tomohiro Ogawa
    [J]. Communications in Mathematical Physics, 2017, 355 : 373 - 426
  • [7] Strong Converse Exponent for Classical-Quantum Channel Coding
    Mosonyi, Milan
    Ogawa, Tomohiro
    [J]. COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2017, 355 (01) : 373 - 426
  • [8] Duality Between Source Coding With Quantum Side Information and Classical-Quantum Channel Coding
    Cheng, Hao-Chung
    Hanson, Eric P.
    Datta, Nilanjana
    Hsieh, Min-Hsiu
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (11) : 7315 - 7345
  • [9] A Note on Random Coding Bounds for Classical-Quantum Channels
    Dalai, M.
    [J]. PROBLEMS OF INFORMATION TRANSMISSION, 2017, 53 (03) : 222 - 228
  • [10] Ergodic classical-quantum channels: Structure and coding theorems
    Bjelakovic, Igor
    Boche, Holger
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (02) : 723 - 742