This paper constructs a local operation and classical communication protocol that achieves the global optimality of conclusive discrimination of any two pure states with arbitrary a priori probability. This can be interpreted that there is no ``nonlocality'' in the conclusive discrimination of two multipartite pure states.
We consider one copy of a quantum system prepared in one of two nonorthogonal pure product states of multipartite distributed among separated parties. We show that there exist protocols that achieve optimal conclusive discrimination by means of local operations and classical communications as good as by global measurements. Also, we show a protocol that minimizes the average number of local operations. Our result implies that two pure product multipartite states might not have the nonlocal property although more than two can have.
We consider one copy of a quantum system prepared with equal prior probability in one of two nonorthogonal entangled states of multipartite distributed among separated parties. We demonstrate that these two states can be optimally distinguished in the sense of conclusive discrimination by local operations and classical communications alone. This proves strictly the conjecture that Virmani et al. confirmed numerically and analytically. Generally the optimal protocol requires local POVM operations which are explicitly constructed. The result manifests that distinguishable information is obtained only and completely at the last operation and all prior operations give no information about that state.
In a recent paper, Walgate et. al. demonstrated that any two orthogonal multipartite pure states can be optimally distinguished using only local operations. We utilise their result to show that this is true for any two multiparty pure states, in the sense of inconclusive discrimination. There are also certain regimes of conclusive discrimination for which the same also applies, although we can only conjecture that the result is true for all conclusive regimes. We also discuss a class of states that can be distinguished locally according to any discrimination measure, as they can be locally recreated in the hands of one party. A consequence of this is that any two maximally entangled states can always be optimally discriminated locally, according to any figure of merit.
Nonlocality exhibited by ensembles of composite quantum states, wherein local operations and classical communication (LOCC) yield suboptimal discrimination probabilities compared to global strategies, is one of the striking nonclassical features of quantum theory. A variant of this phenomenon arises in conclusive local state discrimination, where the correct state must be identified with zero error, albeit allowing for inconclusive outcomes. More recently, the notion of local state marking has been introduced, with the focus shifted to correctly identifying the permutation of a subset of states randomly chosen from a given set of multipartite states under LOCC. In this work, we unify these two approaches by introducing the task of conclusive local state marking, which reveals a finer hierarchy of nonlocality in multipartite quantum state ensembles. Notably, we demonstrate that certain ensembles of product states can exhibit a stronger form of nonlocality than entangled ensembles traditionally considered highly nonlocal.
Unambiguous state discrimination of two mixed bipartite states via local operations and classical communications (LOCC) is studied and compared with the result of a scheme realized via global measurement. We show that the success probability of a global scheme for mixed-state discrimination can be achieved perfectly by the local scheme. In addition, we simulate this discrimination via a pair of pure entangled bipartite states. This simulation is perfect for local rather than global schemes due to the existence of entanglement and global coherence in the pure states. We also prove that LOCC protocol and the sequential state discrimination (SSD) can be interpreted in a unified view. We then hybridize the LOCC protocol with three protocols (SSD, reproducing, and broadcasting) relying on classical communications. Such hybridizations extend the gaps between the optimal success probability of global and local schemes, which can be eliminated only for the SSD rather than the other two protocols.
We analyze the difference in the local distinguishability among the following three restrictions: (i) local operations and only one-way classical communications (one-way LOCC) are permitted; (ii) local operations and two-way classical communications (two-way LOCC) are permitted; and (iii) all separable operations are permitted. We obtain two main results concerning the discrimination between a given bipartite pure state and the completely mixed state with the condition that the given state should be detected perfectly. As the first result, we derive the optimal discrimination protocol for a bipartite pure state in cases (i) and (iii). As the second result, by constructing a concrete two-way local discrimination protocol, it is proven that case (ii) is much better than case (i), i.e. two-way classical communication remarkably improves the local distinguishability in comparison with one-way classical communication at least for a low-dimensional bipartite pure state.