Inclusion-Minimal local indistinguishability: a weak form of nonlocality

Abstract

Local discrimination of quantum states is a fundamental task in distributed quantum information processing and underlies applications such as quantum communication, data hiding, and secret sharing. Here we investigate a weak form of local indistinguishability by asking how easily it can disappear when the candidate set is reduced or an additional copy of the unknown state is supplied. We introduce inclusion-minimal locally indistinguishable sets, namely, locally indistinguishable sets for which every proper subset is perfectly distinguishable by local operations and classical communication (LOCC), and show that every finite locally indistinguishable set contains such a subset. We further find that any inclusion-minimal locally indistinguishable sets becomes perfectly distinguishable by LOCC when two identical copies are available, although a single copy is insufficient. Fininally, We construct explicit inclusion-minimal locally indistinguishable product-state sets in $(\mathbb C^d)^{\otimes n}$ for every odd $d=2k+1$ and $n\ge2$. These results show that local indistinguishability can be nontrivial at the single-copy level yet fragile under either the removal of candidate states or a modest increase in copy resources, providing a complementary perspective on the structure of quantum nonlocality.