Generalized remote state preparation: Trading cbits, qubits, and ebits in quantum communication

Generalized remote state preparation: Trading cbits, qubits, and ebits in quantum communication
复制标题

DOI:
10.1103/physreva.68.062319
复制
发表时间:
2003-08
期刊:
影响因子:
2.9
通讯作者:
Anura Abeyesinghe;P. Hayden
Anura Abeyesinghe;P. Hayden
中科院分区:
物理与天体物理2区
文献类型:
--
作者:
Anura Abeyesinghe;P. Hayden

文献摘要

被引文献

相似文献

我们考虑了同时利用无噪声经典信道、无噪声量子信道和共享纠缠来通信量子态的问题。我们专门研究问题的版本,其中发送方被告知要通信的状态的知识。在这种情况下,这三种资源之间会产生一种权衡,其中的一些部分已经在之前的量子经典权衡的背景下进行了研究,包括数据压缩、远程状态准备和量子状态的超密集编码,其中每一种都相当于只允许这三种资源中的两种。我们提出了一个三重资源权衡公式,将其计算简化为评估数据压缩权衡公式。在此过程中,我们还构建了实现所有最优点的协议。事实证明,对于涉及上述三种资源中的两种资源的情况,可以通过权衡编码和最佳协议之间的适当时间共享来实现这些目标。
We consider the problem of communicating quantum states by simultaneously making use of a noiseless classical channel, a noiseless quantum channel, and shared entanglement. We specifically study the version of the problem in which the sender is given knowledge of the state to be communicated. In this setting, a trade-off arises between the three resources, some portions of which have been investigated previously in the contexts of the quantum-classical trade-off in data compression, remote state preparation, and superdense coding of quantum states, each of which amounts to allowing just two out of these three resources. We present a formula for the triple resource trade-off that reduces its calculation to evaluating the data compression trade-off formula. In the process, we also construct protocols achieving all the optimal points. These turn out to be achievable by trade-off coding and suitable time sharing between optimal protocols for cases involving two resources out of the three mentioned above.