Distinguishing bipartitite orthogonal states using LOCC: Best and worst cases
By Michael Nathanson. 2004
159 citations recorded by the source corpus.
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.
Subfields: Artificial Intelligence, Materials Chemistry, Spectroscopy
View Paper: https://www.semanticscholar.org/paper/af67bd3c5628e79eb45f4e2d10316cd14fa7dfcb
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Materials Chemistry
In Spectroscopy
Citations in the corpus
- The Theory of Quantum Information (2018, background): “33 was proved by Nathanson [160], and Theorem 6.”