首页> 外文期刊>Physical Review, A. Atomic, molecular, and optical physics >Entanglement required in achieving entanglement-assisted channel capacities - art. no. 052313
【24h】

Entanglement required in achieving entanglement-assisted channel capacities - art. no. 052313

机译:实现纠缠辅助通道容量所需的纠缠-艺术。没有。 052313

获取原文
获取原文并翻译 | 示例
           

摘要

Entanglement shared between the two ends of a quantum-communication channel has been shown to be a useful resource in increasing both the quantum and classical capacities for these channels. The entanglement-assisted capacities were derived assuming an unlimited amount of shared entanglement per channel use. In this paper, bounds are derived on the minimum amount of entanglement required per use of a channel, in order to asymptotically achieve the capacity. This is achieved by introducing a class of entanglement-assisted quantum codes. Codes for classes of qubit channels are shown to achieve the quantum entanglement-assisted channel capacity when an amount of shared entanglement per channel given by, E(Q)(Random)greater than or equal to1-Q(E), is provided. It is also shown that for very noisy channels, as the capacities become small, the amount of required entanglement converges for the classical and quantum capacities. [References: 31]
机译:量子通信通道两端共享的纠缠已被证明是增加这些通道的量子和经典容量的有用资源。假设每个通道使用的共享纠缠量不受限制,则可以得出纠缠辅助容量。在本文中,为了渐近地实现容量,在每次使用通道所需的最小纠缠量上得出边界。这是通过引入一类纠缠辅助量子码来实现的。当提供由E(Q)(Random)大于或等于1-Q(E)给出的每个通道的共享纠缠量时,显示了用于量子比特通道的代码,以实现量子纠缠辅助的通道容量。还表明,对于非常嘈杂的通道,随着容量变小,经典和量子容量所需的纠缠量会聚。 [参考:31]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号