Unambiguous discrimination of linearly independent pure quantum states: Optimal average probability of success

Abstract

We consider the problem of unambiguous (error-free) discrimination of N linearly independent pure quantum states with prior probabilities, where the goal is to find a measurement that maximizes the average probability of success. We derive an upper bound on the optimal average probability of success using a result on optimal local conversion between two bipartite pure states. We prove that an optimal measurement in general saturates our bound. In the exceptional cases we show that the bound is tight, but not always optimal.

16 pages. v2: Typos fixed in examples 1 and 2; v3: journal version, abstract slightly modified, partly rewritten for clarity, results unchanged

References in corpus (2)

• Optimal Unambiguous Discrimination of Quantum States
• Complete solution for unambiguous discrimination of three pure states with real inner products

Cited by in corpus (7)

• Exact Identification of a Quantum Change Point
• Generalized quantum state discrimination problems
• Wave-particle duality relations based on entropic bounds for which-way information
• Ultimate limits of approximate unambiguous discrimination
• Unambiguous discrimination of sequences of quantum states
• Minimal-error quantum state discrimination versus robustness of entanglement:More indistinguishability with less entanglement
• Unbounded entanglement-sustaining sequential local quantum state discrimination