Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review A

Upper bound for the success probability of unambiguous discrimination among quantum states

Shengyu Zhang, Yuan Feng, Xiaoming Sun, Mingsheng Ying

Published Nov 8, 2001• 52 citations
Publisher

Abstract

One strategy to the discrimination problem is to identify the state with certainty, leaving a possibility of undecidability. This paper gives an upper bound for the maximal success probability of unambiguous discrimination among n states. This bound coincides with the known IDP limit when two states are considered.
DOI
10.1103/physreva.64.062103

Related papers

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

Xiaoming Sun, Shengyu Zhang, Yuan Feng +1 more

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.

Physical Review A•Apr 10, 2002•30 citations

Upper bound on the success probability of separation among quantum states

Daowen Qiu

Quantum state separation is a more general operation for identifying states than unambiguous discrimination. In this paper, we derive an upper bound on the success probability of separation among n states with arbitrary a priori probabilities, extending some of the important results given in the literature. This conclusion generalizes that obtained by Chefles and Barnett for separating two states having equal a priori probabilities. Some of the known bounds on the success probabilities of unambiguous discrimination such as the Ivanovic–Dieks–Peres limit, the more general limit by Jaeger and Shimony, and an upper bound for the case of unambiguously discriminating n states, are special cases of our results. Notably, we also give implicitly a different method to derive the upper bound on the probability of successful unambiguous discrimination among n states. Finally, we apply our conclusion to quantum cloning and then derive some upper bounds on the success probabilities for several probabilistic cloning machines.

Journal of Physics A Mathematical and General•Jul 30, 2002•25 citations

Bounds for Revised Unambiguous Discrimination Tasks of Quantum Resources

Xian Shi

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.

arXiv:2410.04504•Oct 6, 2024•0 citations

Bounds on unambiguous discrimination between quantum states

Lvjun Li

In this paper, we present a general upper bound on the success probability for unambiguous discrimination among arbitrary $m$ mixed quantum states with given a priori probability. We further analyze how this upper bound can be achievable by presenting a sufficient condition related to it, and we compare this upper bound with three other upper bounds. Moreover, for the issue of the unambiguous identification of $m$ unknown multicopy qudit pure states, we also get a bound.

Physical Review A•Sep 17, 2012•6 citations

Bounds of generalized unambiguous discrimination tasks for quantum resources

Xian Shi

Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. In this manuscript, we consider an extended unambiguous discrimination of quantum resources. First, we present an upper bound of the success probability for an extended unambiguous discrimination task in the non-asymptotic 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 generalized unambiguous discrimination, we show the advantage of the quantum with the aid of a quantifier based on a set of semi-definite positive operators.

Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Jul 1, 2025•1 citation

Unambiguous discrimination of mixed states

Terry Rudolph, Robert W. Spekkens, Peter S. Turner

We present the conditions under which probabilistic error-free discrimination of mixed states is possible, and provide upper and lower bounds on the maximum probability of success for the case of two mixed states. We solve certain special cases exactly, and demonstrate how the problems of state filtering and state comparison can be recast as problems of mixed state unambiguous discrimination.

arXiv:quant-ph/0303071•Physical Review A•Jul 17, 2003•143 citations
Quantum state separation is a more general operation for identifying states than unambiguous discrimination. In this paper, we derive an upper bound on the success probability of separation among n states with arbitrary a priori probabilities, extending some of the important results given in the literature. This conclusion generalizes that obtained by Chefles and Barnett for separating two states having equal a priori probabilities. Some of the known bounds on the success probabilities of unambiguous discrimination such as the Ivanovic–Dieks–Peres limit, the more general limit by Jaeger and Shimony, and an upper bound for the case of unambiguously discriminating n states, are special cases of our results. Notably, we also give implicitly a different method to derive the upper bound on the probability of successful unambiguous discrimination among n states. Finally, we apply our conclusion to quantum cloning and then derive some upper bounds on the success probabilities for several probabilistic cloning machines.
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.
In this paper, we present a general upper bound on the success probability for unambiguous discrimination among arbitrary mmm mixed quantum states with given a priori probability. We further analyze how this upper bound can be achievable by presenting a sufficient condition related to it, and we compare this upper bound with three other upper bounds. Moreover, for the issue of the unambiguous identification of mmm unknown multicopy qudit pure states, we also get a bound.
Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. In this manuscript, we consider an extended unambiguous discrimination of quantum resources. First, we present an upper bound of the success probability for an extended unambiguous discrimination task in the non-asymptotic 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 generalized unambiguous discrimination, we show the advantage of the quantum with the aid of a quantifier based on a set of semi-definite positive operators.