Phys. Rev. A 65, 044306 (2002) [3 pages]Mathematical nature of and a family of lower bounds for the success probability of unambiguous discriminationReceived 8 November 2001; published 10 April 2002 Unambiguous discrimination is a strategy to the discrimination problem that identifies the state with certainty, leaving a possibility of undecidability. This paper points out that the optimal success probability of unambiguous discrimination is mathematically the well-known semidefinite programming problem. A family of lower bounds of the optimal success probability is also given. © 2002 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.65.044306
DOI:
10.1103/PhysRevA.65.044306
PACS:
03.67.-a, 03.65.Ta
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.