arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1209.2683quant-ph
收藏

广义隐形传态与纠缠循环

Generalized teleportation and entanglement recycling

Sergii Strelchuk, Michał Horodecki, Jonathan Oppenheim

摘要:

我们介绍了新的隐形传态协议,这些协议是使用泡利群的原始隐形传态协议[Bennett等人,物理评论快报,70(13)1895-1899]以及由Hiroshima和Ishizaka介绍的基于端口的隐形传态协议[物理评论快报,101(24)240501]的推广,使用对称置换群。我们推导出一组操作的充分条件,这在一般情况下不需要形成一个组,产生一个隐形传态协议,并提供这样的计划的例子。这种推广导致协议具有新的属性,并需要推动基于它们的新的计算方案。基于端口的隐形传态协议和我们的推广使用一个大的资源状态组成的N个单态,可靠地传送只有一个量子比特状态。我们提供了两个不同的协议,回收资源状态,以远距传送多个状态,误差随其数量线性增加。第一个协议包括顺序传送量子比特状态,第二个协议是批量传送。

英文摘要:

We introduce new teleportation protocols which are generalizations of the original teleportation protocols that use the Pauli group [Bennett, et al. Physical Review Letters, 70(13) 1895-1899] and the port-based teleportation protocols, introduced by Hiroshima and Ishizaka [Physical Review Letters, 101(24) 240501], that use the symmetric permutation group. We derive sufficient condition for a set of operations, which in general need not form a group, to give rise to a teleportation protocol and provide examples of such schemes. This generalization leads to protocols with novel properties and is needed to push forward new schemes of computation based on them. Port-based teleportation protocols and our generalizations use a large resource state consisting of N singlets to teleport only a single qubit state reliably. We provide two distinct protocols which recycle the resource state to teleport multiple states with error linearly increasing with their number. The first protocol consists of sequentially teleporting qubit states, and the second teleports them in a bulk.

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

↑