科研之友
微信
新浪微博
Facebook
分享链接
摘要
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-4
- 单位清华大学
