arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1905.02110quant-phcs.CCcs.ITmath.IT
收藏

单次压缩的纠缠代价

On the Entanglement Cost of One-Shot Compression

Shima Bab Hadiashar, Ashwin Nayak

摘要:

我们重新审视的任务,可见压缩的量子态与纠缠援助在一次性设置的系综。实现最佳压缩的协议使用比系综中状态中的量子比特数量多得多的共享纠缠量子比特。其他压缩协议,具有潜在的更大的通信成本,具有由给定状态中的量子比特的数量限制的纠缠成本。这引发了一个问题,即纠缠是否真的是压缩所必需的,如果是的话,需要多少。出于通信复杂性的问题,我们解除了某些限制,放置在压缩协议的任务,如状态分裂和信道模拟。我们表明,集成的形式设计的Jain,Radhakrishnan和森(ICALP'03)饱和的通信和纠缠成本的总和上的已知界限,即使与宽松的压缩协议,我们研究。集成和相关的单向通信协议有几个显着的属性。在没有共享纠缠的情况下,即使允许恒定的误差,该系综也是不可压缩的。此外,在存在共享纠缠的情况下,压缩的通信成本可以任意小于纠缠成本。因此,该协议的量子信息成本可以任意小于没有共享纠缠的压缩成本。该集成也可以用来显示通过压缩来减少用于计算布尔函数的两方协议中的共享纠缠的不可能性。

英文摘要:

We revisit the task of visible compression of an ensemble of quantum states with entanglement assistance in the one-shot setting. The protocols achieving the best compression use many more qubits of shared entanglement than the number of qubits in the states in the ensemble. Other compression protocols, with potentially larger communication cost, have entanglement cost bounded by the number of qubits in the given states. This motivates the question as to whether entanglement is truly necessary for compression, and if so, how much of it is needed. Motivated by questions in communication complexity, we lift certain restrictions that are placed on compression protocols in tasks such as state-splitting and channel simulation. We show that an ensemble of the form designed by Jain, Radhakrishnan, and Sen (ICALP'03) saturates the known bounds on the sum of communication and entanglement costs, even with the relaxed compression protocols we study. The ensemble and the associated one-way communication protocol have several remarkable properties. The ensemble is incompressible by more than a constant number of qubits without shared entanglement, even when constant error is allowed. Moreover, in the presence of shared entanglement, the communication cost of compression can be arbitrarily smaller than the entanglement cost. The quantum information cost of the protocol can thus be arbitrarily smaller than the cost of compression without shared entanglement. The ensemble can also be used to show the impossibility of reducing, via compression, the shared entanglement used in two-party protocols for computing Boolean functions.

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

↑