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

对称态的纠缠代价和可压缩纠缠

Entanglement cost and distillable entanglement of symmetric states

Keiji Matsumoto

摘要:

我们计算了对称子空间上支持态的纠缠代价和纠缠度。不仅给出了一般公式,而且将其应用于最优克隆机的输出状态。令人惊讶的是,在某些设置下,最佳的n到m个克隆和真正的m个副本是相同的纠缠措施。然而,它们的纠缠稀释的误差指数不同。我们还提出了适用于任何非独立同分布态序列的纠缠稀释理论。

英文摘要:

We compute entanglement cost and distillable entanglement of states supported on symmetric subspace. Not only giving general formula, we apply them to the output states of optimal cloning machines. Surprisingly, under some settings, the optimal n to m clone and true m copies are the same in entanglement measures. However, they differ in the error exponent of entanglement dilution. We also presented a general theory of entanglement dilution which is applicable to any non-i.i.d sequence of states.

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

↑