Identification over quantum broadcast channels

被引：0
作者：
Johannes Rosenberger
Christian Deppe
Uzi Pereg
机构：
[1] Technical University of Munich,Department of Computer Engineering, School of Computation, Information and Technology
[2] Munich Center for Quantum Science and Technology,Department of Electrical and Computer Engineering
[3] Technion - Israel Institute of Technology,Helen Diller Quantum Center
[4] Technion - Israel Institute of Technology,undefined
来源：
Quantum Information Processing | / 22卷
关键词：
Identification capacity; Broadcast communication; Bosonic channels; Random coding; Pool-selection coding; Hypergraph covering;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Identification over quantum broadcast channels is considered. As opposed to the information transmission task, the decoder only identifies whether a message of his choosing was sent or not. This relaxation allows for a double-exponential code size. An achievable identification region is derived for a quantum broadcast channel, and a full characterization for the class of classical-quantum broadcast channels. The identification capacity region of the single-mode pure-loss bosonic broadcast channel is obtained as a consequence. Furthermore, the results are demonstrated for the quantum erasure broadcast channel, where our region is suboptimal, but improves on the best previously known bounds.
引用
收藏
相关论文
共 108 条
[1]  
Tariq F(2020)A speculative study on 6G IEEE Wirel. Commun. 27 118-125
[2]  
Khandaker MRA(2021)6g: the personal tactile internet—and open questions for information theory IEEE BITS Inf. Theory Mag. 3 20-29
[3]  
Wong K-K(2020)What should 6G be? Nat. Electron. 27 623-656
[4]  
Imran MA(1948)A mathematical theory of communication Bell Syst. Tech. J. 35 15-29
[5]  
Bennis M(1989)Identification via channels IEEE Trans. Inf. Theory 47 1410-1422
[6]  
Debbah M(2001)Identification in the presence of side information with application to watermarking IEEE Trans. Inf. Theory 13 1641-1655
[7]  
Fettweis GP(2018)Secure identification for wiretap channels; robustness, super-additivity and continuity IEEE Trans. Inf. Forensics Secur. 48 569-579
[8]  
Boche H(2002)Strong converse for identification via quantum channels IEEE Trans. Inf. Theory 65 6734-6749
[9]  
Dang S(2019)Secure and robust identification via classical-quantum channels IEEE Trans. Inf. Theory 25 306-311
[10]  
Amin O(1979)A coding theorem for the discrete memoryless broadcast channel IEEE Trans. Inf. Theory 53 350-355
12345678910