Alessandro Cosentino, Vincent Russo
We show how to construct sets of fewer than $d$ orthogonal maximally entangled states in $C^d \otimes C^{d}$ that are not perfectly distinguishable by local operations and classical communication (LOCC). This improves upon previous results, which only showed sets of $k \geq d$ such states. Our results hold for an even wider class of operations, which is the class of positive-partial-transpose measurements (PPT). The proof uses the characterization of the PPT distinguishability problem as a semidefinite program. As an explicit example, we exhibit a set of 15 locally indistinguishable maximally entangled states in $C^{16} \otimes C^{16}$.
View original:
http://arxiv.org/abs/1307.3232
No comments:
Post a Comment