Mathematical nature of and a family of lower bounds for the success probability of unambiguous discrimination
Lists
Only you see this
Abstract
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.
BibTeX
@inproceedings{sun2002mathematical,
author = {Xiaoming Sun and Shengyu Zhang and Yuan Feng and Mingsheng Ying},
title = {{Mathematical nature of and a family of lower bounds for the success probability of unambiguous discrimination}},
booktitle = {Physical},
year = {2002},
doi = {10.1103/physreva.65.044306},
}Loading related content...