Zhang Zhi-Chao, Gao Fei, Cao Tian-Qing, Qin Su-Juan, Wen Qiao-Yan
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China.
State Key Laboratory of Cryptology, P.O. Box 5159, Beijing, 100878, China.
Sci Rep. 2016 Jul 26;6:30493. doi: 10.1038/srep30493.
It is known that there are many sets of orthogonal product states which cannot be distinguished perfectly by local operations and classical communication (LOCC). However, these discussions have left the following open question: What entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In m ⊗ n, certain classes of unextendible product bases (UPB) which can be distinguished perfectly using entanglement as a resource, had been presented in 2008. In this paper, we present protocols which use entanglement more efficiently than teleportation to distinguish some classes of orthogonal product states in m ⊗ n, which are not UPB. For the open question, our results offer rather general insight into why entanglement is useful for such tasks, and present a better understanding of the relationship between entanglement and nonlocality.
众所周知，存在许多组正交乘积态，无法通过局域操作和经典通信（LOCC）完美区分。然而，这些讨论留下了以下未解决的问题：对于LOCC能够完成此任务而言，哪些纠缠资源是必要的和/或充分的？在(m\otimes n)中，2008年已提出某些类别的不可扩展乘积基（UPB），它们可以将纠缠用作资源来完美区分。在本文中，我们提出了一些协议，这些协议比隐形传态更有效地利用纠缠来区分(m\otimes n)中的某些类别的正交乘积态，这些态不是UPB。对于这个未解决的问题，我们的结果为纠缠为何对此类任务有用提供了相当普遍的见解，并更好地理解了纠缠与非局域性之间的关系。
