Local indistinguishability and LOCC monotones

Preprint
Publisher Website
Google Scholar
  • 19 April 2002
Abstract
We provide a method for checking indistinguishability of a set of orthogonal states by local operations and classical communication (LOCC). It bases on the principle of nonincreasing of entanglement under LOCC. This method originates from the one introduced by Ghosh et al. (Phys. Rev. Lett. 87, 5807 (2001) (quant-ph/0106148)), though we deal with pure states. We apply it to show that an arbitrary complete orthogonal basis of an mXn system is indistinguishable if it contains at least one entangled state. We also show that probabilistic distinguishing is possible for full basis if and only if all vectors are product.

This publication has 0 references indexed in Scilit: