量子广播信道上的识别
Identification Over Quantum Broadcast Channels
AI总结:
本文研究量子广播信道上的识别问题,推导了可达识别区域并完整刻画了经典-量子广播信道类,同时得到了单模纯损耗玻色子广播信道的识别容量区域,改进了量子擦除广播信道上的已知最佳界。
摘要:
本文考虑了量子广播信道上的识别问题。与信息传输任务不同,解码器仅识别其选择的消息是否被发送。这种放松允许双指数级的码字大小。本文推导了量子广播信道的可达识别区域,并对经典-量子广播信道类进行了完整刻画。作为推论,得到了单模纯损耗玻色子广播信道的识别容量区域。此外,结果在量子擦除广播信道上得到了验证,其中我们的区域虽非最优,但改进了此前已知的最佳界。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。