The minimum-error probability of ambiguous discrimination for two quantum states is the well-known {\it Helstrom limit} presented in 1976. Since then, it has been thought of as an intractable problem to obtain the minimum-error probability for ambiguously discriminating arbitrary
m quantum states. In this paper, we obtain a new lower bound on the minimum-error probability for ambiguous discrimination and compare this bound with six other bounds in the literature. Moreover, we show that the bound between ambiguous and unambiguous discrimination does not extend to ensembles of more than two states. Specifically, the main technical contributions are described as follows: (1) We derive a new lower bound on the minimum-error probability for ambiguous discrimination among arbitrary
m mixed quantum states with given prior probabilities, and we present a necessary and sufficient condition to show that this lower bound is attainable. (2) We compare this new lower bound with six other bounds in the literature in detail, and, in some cases, this bound is optimal. (3) It is known that if
m=2, the optimal inconclusive probability of unambiguous discrimination
QU and the minimum-error probability of ambiguous discrimination
QE between arbitrary given
m mixed quantum states have the relationship
QU≥2QE. In this paper, we show that, however, if
m>2, the relationship
QU≥2QE may not hold again in general, and there may be no supremum of
QU/QE for more than two states, which may also reflect an essential difference between discrimination for two-states and multi-states. (4) A number of examples are constructed.
We derive a new bound on the minimum-error probability for ambiguous discrimination and compare the new bound with six other bounds in the literature. Specifically, the main technical contributions are as follows. (1) We obtain a general lower bound on the minimum-error probability for ambiguous discrimination among arbitrary
m mixed quantum states with given prior probabilities. We further analyze how this lower bound is attainable by presenting a necessary and sufficient condition related to it. (2) We compare this new lower bound with six other bounds in the literature, in detail. We show that this new bound improves the previous one in the literature and in the equiprobable case; the new bound also improves another one. Moreover, we give an example to show that this new bound is the tightest one for some cases.
We derive a general lower bound on the minimum-error probability for ambiguous discrimination between arbitrary
m mixed quantum states with given prior probabilities. When
m=2, this bound is precisely the well-known Helstrom limit. Also, we give a general lower bound on the minimum-error probability for discriminating quantum operations. Then we further analyze how this lower bound is attainable for ambiguous discrimination of mixed quantum states by presenting necessary and sufficient conditions related to it. Furthermore, with a restricted condition, we work out an upper bound on the minimum-error probability for ambiguous discrimination of mixed quantum states. Therefore, some sufficient conditions are obtained for the minimum-error probability attaining this bound. Finally, under the condition of the minimum-error probability attaining this bound, we compare the minimum-error probability for ambiguously discriminating arbitrary
m mixed quantum states with the optimal failure probability for unambiguously discriminating the same states.
We propose upper and lower bounds on the maximum success probability for discriminating given quantum states. The proposed upper bound is obtained from a suboptimal solution to the dual problem of the corresponding optimal state discrimination problem. We also give a necessary and sufficient condition for the upper bound to achieve the maximum success probability; the proposed lower bound can be obtained from this condition. It is derived that a slightly modified version of the proposed upper bound is tighter than that proposed by Qiu et al. [Phys. Rev. A 81, 042329 (2010)]. Moreover, we propose upper and lower bounds on the maximum success probability with a fixed rate of inconclusive results. The performance of the proposed bounds is evaluated through numerical experiments.
We show a geometric formulation for minimum-error discrimination of qubit states that can be applied to arbitrary sets of qubit states given with arbitrary a priori probabilities. In particular, when qubit states are given with equal a priori probabilities, we provide a systematic way of finding optimal discrimination and the complete solution in a closed form. This generally gives a bound to cases when prior probabilities are unequal. Then it is shown that the guessing probability does not depend on detailed relations among the given states, such as the angles between them, but on a property that can be assigned by the set of given states itself. This also shows how a set of quantum states can be modified such that the guessing probability remains the same. Optimal measurements are also characterized accordingly, and a general method of finding them is provided.