LOCC Distinguishability of Orthogonal Product States via Multiply Copies
Hao Shu
Abstract
In this paper, we consider the LOCC distinguishability of product states. We use polygons to analyse 7 orthogonal product states in any system to show that using LOCC protocol to distinguish 7 orthogonal product states in a bipartite or multipartite system, one can exclude 4 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 which is 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 by using a single copy if we are distinguishing n orthogonal product states by LOCC protocol in a bipartite system.