论文标题
量子频道编码中的一击三重资源权衡
One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
论文作者
论文摘要
我们分析了一项任务，在该任务中，通过嘈杂的量子通道同时传达经典和量子消息，并有助于有限的共享纠缠。我们得出了以光滑的条件熵和误差耐度为代表的一击容量区域的直接和逆向边界。该证明基于随机部分解耦定理，这是解耦定理的概括。这两个边界匹配无限记忆通道的无限用途的渐近极限，并与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.
