We present a generic study of the unambiguous discrimination between two mixed quantum states. We derive operational optimality conditions and show that the optimal measurements can be classified according to their rank. In Hilbert space dimensions less than or equal to
5, this leads to the complete optimal solution. We demonstrate our method with a physical example, namely, the unambiguous comparison of
n quantum states, and find the optimal success probability.
We find the allowed complex numbers associated with the inner product of N equally separated pure quantum states. The allowed areas on the unitary complex plane have the form of petals. A point inside the petal-shape represents a set of N linearly independent (LI) pure states, and a point on the edge of that area represents a set of N linearly dependent (LD) pure states. For each one of those LI sets we study the complete discrimination of its N equi-separated states combining sequentially the two known strategies: first the unambiguous identification protocol for LI states, followed, if necessary, by the error-minimizing measurement scheme for LD states. We find that the probabilities of success for both unambiguous and ambiguous discrimination procedures depend on both the module and the phase of the involved inner product complex number. We show that, with respect to the phase-parameter, the maximal probability of discriminating unambiguously the N non-orthogonal pure states holds just when there no longer be probability of obtaining ambiguously information about the prepared state by applying the second protocol if the first one was not successful.
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.
In this paper, we investigate the relationship between the minimum-error probability
QE of ambiguous discrimination and the optimal inconclusive probability
QU of unambiguous discrimination. It is known that for discriminating two states, the inequality ${Q}_{U}\ensuremath{\geqslant}2{Q}_{E}$ has been proved in the literature. The main technical results are as follows: (1) We show that, for discriminating more than two states, ${Q}_{U}\ensuremath{\geqslant}2{Q}_{E}$ may not hold again, but the infimum of
QU/QE is
1, and there is no supremum of
QU/QE, which implies that the failure probabilities of the two schemes for discriminating some states may be narrowly or widely gapped. (2) We derive two concrete formulas of the minimum-error probability
QE and the optimal inconclusive probability
QU, respectively, for ambiguous discrimination and unambiguous discrimination among arbitrary
m simultaneously diagonalizable mixed quantum states with given prior probabilities. In addition, we show that
QE and
QU satisfy the relationship that ${Q}_{U}\ensuremath{\geqslant}\frac{m}{m\ensuremath{-}1}{Q}_{E}$.