Mathematical nature of and a family of lower bounds for the success probability of unambiguous discrimination

Publication Type:
Journal Article
Citation:
Physical Review A - Atomic, Molecular, and Optical Physics, 2002, 65 (4), pp. 3 - ?
Issue Date:
2002-01-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2008004804OK.pdf49.06 kB
Adobe PDF
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.
Please use this identifier to cite or link to this item: