arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0512015quant-ph
收藏

量子香农理论的资源框架

A Resource Framework for Quantum Shannon Theory

I. Devetak, A. W. Harrow, A. Winter

摘要:

量子香农理论被松散地定义为编码定理的集合,例如经典和量子源压缩、噪声信道编码定理、纠缠蒸馏等,其表征量子和经典通道和状态的渐近性质。在本文中,我们主张一个统一的方法来解决一类重要的问题,在量子香农理论,包括那些是双向的,单向的和无记忆的。我们将两个长期以来被默认的原则形式化。首先,我们描述了更大的希尔伯特空间的教会如何允许我们在状态,通道,合奏及其纯化之间灵活移动。其次,我们引入有限和渐近(量子)信息处理资源作为量子香农理论的基本对象,并将直接编码定理中使用的协议改写为资源之间的不等式。我们开发的资源演算的规则,使我们能够操纵和结合资源的不平等。这个框架简化了许多编码定理证明,并提供了结构性的见解编码定理之间的逻辑依赖关系。我们回顾了上述基本的编码结果,并展示了如何将它们的子集统一成一个家庭的相关资源的不平等。最后,我们使用这个家庭找到最佳的权衡曲线的所有协议,涉及一个噪声量子资源和两个无噪声的。

英文摘要:

Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distillation, etc., which characterize asymptotic properties of quantum and classical channels and states. In this paper we advocate a unified approach to an important class of problems in quantum Shannon theory, consisting of those that are bipartite, unidirectional and memoryless. We formalize two principles that have long been tacitly understood. First, we describe how the Church of the larger Hilbert space allows us to move flexibly between states, channels, ensembles and their purifications. Second, we introduce finite and asymptotic (quantum) information processing resources as the basic objects of quantum Shannon theory and recast the protocols used in direct coding theorems as inequalities between resources. We develop the rules of a resource calculus which allows us to manipulate and combine resource inequalities. This framework simplifies many coding theorem proofs and provides structural insights into the logical dependencies among coding theorems. We review the above-mentioned basic coding results and show how a subset of them can be unified into a family of related resource inequalities. Finally, we use this family to find optimal trade-off curves for all protocols involving one noisy quantum resource and two noiseless ones.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑