Bounds for Revised Unambiguous Discrimination Tasks of Quantum Resources

Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. In this manuscript, we consider a revised unambiguous discrimination of quantum resources. First, we present an upper bound of the success probability for a revised unambiguous discrimination task in the unasymptotic and asymptotic scenarios. Next, we generalize the task from quantum states to quantum channels. We present an upper bound of the success probability for the task under the adaptive strategy. Furthermore, we show the bound can be computed efficiently. Finally, compared with the classical unambiguous discrimination, we show the advantage of the quantum by considering a quantifier on a set of semidefinite positive operators.