Minimal-error quantum state discrimination versus robustness of entanglement:More indistinguishability with less entanglement

We relate the the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. In particular, we identify upper and lower bounds on the probability of discriminating the states, appearing in an arbitrary multiparty ensemble, in terms of their robustness of entanglement and the probability of discriminating states of the closest separable ensemble. These bounds hold true, irrespective of the dimension of the constituent systems the number of parties involved, the size of the ensemble, and whether the measurement strategies are local or global. Additional lower bounds on the same quantity is determined by considering two special cases of two-state multiparty ensembles, either having equal entanglement or at least one of them being separable. The case of equal entanglement reveals that it is always easier to discriminate the entangled states than the ones in the corresponding closest separable ensemble, a phenomenon which we refer as "More indistinguishability with less entanglement". Furthermore, we numerically explore how tight the bounds are by examining the global discrimination probability of states selected from Haar-uniformly generated ensembles of two two-qubit states. We find that for two-element ensembles of unequal entanglements, the minimum of the two entanglements must possess a threshold value for the ensemble to exhibit "More indistinguishability with less entanglement".