Bounds for Revised Unambiguous Discrimination Tasks of Quantum Resources

TL;DR

This paper establishes upper bounds for revised unambiguous discrimination of quantum resources, extending to channels and demonstrating quantum advantages over classical methods.

Contribution

It introduces new upper bounds for success probabilities in revised unambiguous discrimination tasks, including quantum channels, and shows these bounds can be efficiently computed.

Findings

Upper bounds for success probability in revised unambiguous discrimination

Extension of discrimination tasks from quantum states to channels

Quantum advantage demonstrated over classical discrimination methods

Abstract

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.