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

近优的远程态制备中纠缠-通信权衡

Near-optimal entanglement-communication tradeoffs for remote state preparation

Srijita Kundu, Olivier Lalonde

AI总结:

本文研究了远程态制备任务中纠缠和通信成本的权衡问题,提出了针对混合态的近似匹配上下界,展示了纯纠缠态在通信成本为o(d)时可提取log d ebits纠缠,反之亦然。

摘要:

我们研究了以下任务:Alice被给出一个秩为k的投影算子P在C^d上的经典描述,Alice和Bob希望通过共享的纠缠和经典通信在Bob的一侧制备量子态P/k。该任务的一般形式称为远程态制备(RSP)。我们为RSP的P/k态的纠缠成本和通信成本给出了近似的下界和上界。我们的结果是首次针对混合态RSP的近似匹配上下界,在纯态的特殊情况下,我们的下界优于已知的最佳下界。我们的结果表明,任何能够用o(d)比特通信进行这些态RSP的纯纠缠态,可以提取log d ebits的纠缠;反之,任何能够提取log d ebits纠缠的状态都可以高效地用于这些态的RSP。作为我们的结果的应用,我们重新推导了形式为P/k的态的不可压缩性结果,并给出了一个新的基于纠缠的通信协议,用于等式函数,该协议使用1/2 log n + O(1)个ebits和O(1)的通信。

英文摘要:

We study the following task: Alice is given a classical description of a rank-$k$ projector $P$ on $\mathbb{C}^d$, and Alice and Bob want to prepare the quantum state $P/k$ on Bob's side using shared entanglement and classical communication. The general form of this task is known as remote state preparation (RSP). We give nearly-matching lower and upper bounds for the entanglement cost and communication cost for RSP of the states $P/k$. Ours are the first nearly matching upper and lower bounds for RSP of mixed states, and in the special case of pure states, our lower bound outperforms the best previously known lower bound. Our results show that any pure entangled state that can be used to do RSP of these states with $o(d)$ bits of communication, can distill $\log d$ ebits of entanglement, and conversely, any state that can distill $\log d$ ebits of entanglement can be used to do RSP of these states efficiently. As applications of our results, we rederive a previously-known incompressibility result for states of the form $P/k$, and give a new entanglement-assisted communication protocol for the equality function that uses $\frac{1}{2}\log n + O(1)$ many ebits, and $O(1)$ communication.

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

↑