One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
复制标题
量子信道编码中的一次性三资源权衡
DOI：
10.1109/tit.2022.3222775
复制
发表时间：
2023
影响因子：
2.5
通讯作者：
Nakata Yoshifumi
中科院分区：
文献类型：
--
作者：
Wakakuwa Eyuri;Nakata Yoshifumi
我们分析了一个任务，其中经典和量子信息同时通过一个有噪声的量子信道进行通信，并辅以有限数量的共享纠缠。我们导出了用光滑条件熵和误差容限表示的单次容量区域的正逆界。该证明基于随机化部分解耦定理，它是解耦定理的推广。这两个边界在无记忆信道无穷多次使用的渐近极限上是匹配的，并且与Hsieh和Wilde先前得到的结果一致。在单次和渐近情况下，得到了各种通信任务的正界和逆界。
We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel, assisted with a limited amount of shared entanglement. We derive direct and converse bounds for the one-shot capacity region, represented by the smooth conditional entropies and the error tolerance. The proof is based on the randomized partial decoupling theorem, which is a generalization of the decoupling theorem. The two bounds match in the asymptotic limit of infinitely many uses of a memoryless channel and coincide with the previous result obtained by Hsieh and Wilde. Direct and converse bounds for various communication tasks are obtained as corollaries, both for the one-shot and asymptotic scenarios.