2000 character limit reached
Unambiguous discrimination of linearly independent pure quantum states: Optimal average probability of success (1404.3574v3)
Published 14 Apr 2014 in quant-ph
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.