Bound on local minimum-error discrimination of bipartite quantum states

Abstract

We consider the optimal discrimination of bipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition for a measurement to realize the upper bound. We further establish a necessary and sufficient condition for this upper bound to be saturated. Finally, we illustrate our results using an example.

5 pages, no figure

References in corpus (5)

• Quantum state discrimination and its applications
• Distinguishing Arbitrary Multipartite Basis Unambiguously Using Local Operations and Classical Communication
• Distinguishability of Quantum States by Separable Operations
• On the conditions for discrimination between quantum states with minimum error
• Entanglement cost of discriminating noisy Bell states by local operations and classical communication

Cited by in corpus (6)

• Nonlocal quantum state ensembles and quantum data hiding
• Bound on optimal local discrimination of multipartite quantum states
• Minimal-error quantum state discrimination versus robustness of entanglement:More indistinguishability with less entanglement
• Structure of quantum measurements implementable with one round of classical communication
• Unbounded entanglement-sustaining sequential local quantum state discrimination
• Multi-player quantum data hiding by nonlocal quantum state ensembles