Distinguishing bipartitite orthogonal states using LOCC: Best and worst cases

Abstract

Two types of results are presented for distinguishing pure bipartite quantum states using local operations and classical communications. We examine sets of states that can be perfectly distinguished, in particular showing that any three orthogonal maximally entangled states in C3⊗C3 form such a set. In cases where orthogonal states cannot be distinguished, we obtain upper bounds for the probability of error using LOCC taken over all sets of k orthogonal states in Cn⊗Cm. In the process of proving these bounds, we identify some sets of orthogonal states for which perfect distinguishability is not possible.