Abstract We consider multipartite quantum state discrimination and show that the minimum-error discrimination by separable measurements is closely related to the concept of entanglement witness (EW). Based on the properties of EW, we establish some necessary and/or sufficient conditions on minimum-error discrimination by separable measurements. We also provide some conditions on the upper bound of the maximum success probability over all possible separable measurements. Our results are illustrated by examples of multidimensional multipartite quantum states. Finally, we provide a systematic way in terms of the EW to construct multipartite quantum state ensembles showing nonlocality in state discrimination.
Quantum channel discrimination is a fundamental task in quantum information processing. In the one-shot regime, discrimination between two candidate channels is characterized by the diamond norm. Beyond this basic setting, however, many scenarios in distributed quantum information processing remain unresolved, motivating notions of distinguishability that capture the power of the available resources. In this work, we formulate a theory of testers for bipartite channel discrimination, leading to the concept of the entanglement cost of bipartite channel discrimination: the minimum Schmidt rank
k of a shared maximally entangled state required for local protocols to achieve the globally optimal success probability. We introduce
k-injectable testers as a tester-based description of entanglement-assisted local discrimination and, in particular, study the class of
k-injectable positive-partial-transpose (PPT) testers, which constitutes a numerically tractable relaxation of the practically relevant class of LOCC testers.
For every
k, we derive a semidefinite program (SDP) for the optimal success probability, which in turn yields an efficiently computable one-shot PPT entanglement cost. To render these optimization problems numerically feasible, we prove a symmetry-reduction principle for covariant channel pairs, thereby reducing the effective dimension of the associated SDPs. Finally, by dualizing the SDP, we derive bounds on the composite channel-discrimination problem and illustrate our framework with proof-of-principle examples based on the depolarizing channel, the depolarized SWAP channel, and the Werner--Holevo channels.
The unique features of entanglement and non-locality in quantum systems, where there are pairs of bipartite states perfectly distinguishable by general entangled measurements yet indistinguishable by local operations and classical communication, hold significant importance in quantum entanglement theory, distributed quantum information processing, and quantum data hiding. This paper delves into the entanglement cost for discriminating two bipartite quantum states, employing positive operator-valued measures (POVMs) with positive partial transpose (PPT) to achieve optimal success probability through general entangled measurements. First, we introduce an efficiently computable quantity called the spectral PPT-distance of a POVM to quantify the localness of a general measurement. We show that it can be a lower bound for the entanglement cost of optimal discrimination by PPT POVMs. Second, we establish an upper bound on the entanglement cost of optimal discrimination by PPT POVMs for any pair of states. Leveraging this result, we show that a pure state can be optimally discriminated against any other state with the assistance of a single Bell state. This study advances our understanding of the pivotal role played by entanglement in quantum state discrimination, serving as a crucial element in unlocking quantum data hiding against locally constrained measurements.
We consider multipartite quantum state discrimination and provide a specific relation between the properties of entanglement witness and quantum nonlocality inherent in the confidence of measurement. We first provide the definition of the confidence of measurement as well as its useful properties for various types of multipartite measurement. We show that globally-maximum confidence that cannot be achieved by local operations and classical communication strongly depends on the existence of a certain type of entanglement witness. We also provide conditions for an upper bound on maximum of locally-achievable confidence. Finally, we establish a method in terms of entanglement witness to construct quantum state ensembles with nonlocal maximum confidence.