pith. sign in

arxiv: 1307.3232 · v2 · pith:4HU5L264new · submitted 2013-07-11 · 🪐 quant-ph

Small sets of locally indistinguishable orthogonal maximally entangled states

classification 🪐 quant-ph
keywords statessetscaseentangledevenexistloccmathbb
0
0 comments X
read the original abstract

We study the problem of distinguishing quantum states using local operations and classical communication (LOCC). A question of fundamental interest is whether there exist sets of $k \leq d$ orthogonal maximally entangled states in $\mathbb{C}^{d}\otimes\mathbb{C}^{d}$ that are not perfectly distinguishable by LOCC. A recent result by Yu, Duan, and Ying [Phys. Rev. Lett. 109 020506 (2012) -- arXiv:1107.3224 [quant-ph]] gives an affirmative answer for the case $k = d$. We give, for the first time, a proof that such sets of states indeed exist even in the case $k < d$. Our result is constructive and holds for an even wider class of operations known as positive-partial-transpose measurements (PPT). The proof uses the characterization of the PPT-distinguishability problem as a semidefinite program.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Local state antimarking : Nonlocality without entanglement

    quant-ph 2026-05 unverdicted novelty 7.0

    Certain sequences of product states allow global but not local identification of excluded sequences via the new LSAM task, showing nonlocality without entanglement.

  2. Graph Structures for Local Distinguishability of Quantum Product States

    quant-ph 2026-06 unverdicted novelty 6.0

    Graph structures are used to identify classes of bipartite product states locally distinguishable under two-way LOCC, with closure properties derived for the distinguishable graph set.