New general lower and upper bounds under minimum-error quantum state discrimination

Abstract

For the optimal success probability under minimum-error discrimination between $r\ge 2$ arbitrary quantum states prepared with any a priori probabilities, we find new general analytical lower and upper bounds and specify the relations between these new general bounds and the general bounds known in the literature. We also present the example where the new general analytical bounds, lower and upper, on the optimal success probability are tighter than most of the general analytical bounds known in the literature. The new upper bound on the optimal success probability explicitly generalizes to $r>2$ the form of the Helstrom bound. For $r=2$, each of our new bounds, lower and upper, reduces to the Helstrom bound.

15 pages

References in corpus (4)

• Minimum-error discrimination between mixed quantum states
• Multiparty data hiding of quantum information
• Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds
• Generalized Perfect Codes for Symmetric Classical-Quantum Channels

Cited by in corpus (5)

• Contextuality witness inspired by optimal state discrimination
• Geometric Bloch Vector Solution to Minimum Error Discriminations of Mixed Qubit States
• Minimal-error quantum state discrimination versus robustness of entanglement:More indistinguishability with less entanglement
• Conclusive discrimination by $N$ sequential receivers between $r\ge 2$ arbitrary quantum states
• Unbounded entanglement-sustaining sequential local quantum state discrimination