论文标题

正交产品状态的局部性通过乘以

Locality of Orthogonal Product States via Multiplied Copies

论文作者

Shu, Hao

论文摘要

在本文中,我们考虑了产品状态的LOCC可区分性。我们采用多边形来分析任何系统中的正交产品状态,以表明使用LOCC协议,以区分七个正交产品状态,一个人可以通过一个副本排除四个状态。在两部分系统中,该结果意味着,如果$ \ weft \ lceil \ lceil \ frac {n} {n} {4} \ right \ rceil $ copies可以区分n正交产品状态,则可以区分locc。在多部分系统中,此结果意味着,如果允许允许$ \ weft \ lceil \ frac {n} {4} \ right \ rceil + 1 $副本,则n正交产品状态可以区分LOCC。如果我们通过双方系统中的LOCC协议来区分N正交产品状态,我们还会给出一个定理,以显示可以通过单个副本排除多少个状态。不像以前的结果一样,我们的结果是任何系统中任何一套正交产品状态的一般结果。

In this paper, we consider the LOCC distinguishability of product states. We employ polygons to analyze orthogonal product states in any system to show that with LOCC protocols, to distinguish seven orthogonal product states, one can exclude four states via a single copy. In bipartite systems, this result implies that N orthogonal product states are LOCC distinguishable if $\left \lceil \frac{N}{4} \right \rceil$ copies are allowed, where $\left \lceil l\right \rceil$ for a real number $l$ means the smallest integer not less than $l$. In multipartite systems, this result implies that N orthogonal product states are LOCC distinguishable if $\left \lceil \frac{N}{4}\right \rceil + 1$ copies are allowed. We also give a theorem to show how many states can be excluded via a single copy if we are distinguishing n orthogonal product states by LOCC protocols in a bipartite system. Not like previous results, our result is a general result for any set of orthogonal product states in any system.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源