We discuss the problem of designing an unambiguous programmable discriminator for mixed quantum states. We prove that there does not exist such a universal unambiguous programmable discriminator for mixed quantum states that has two program registers and one data register. However, we find that we can use the idea of programmable discriminator to unambiguously discriminate mixed quantum states. The research shows that by using such an idea, when the success probability for discrimination reaches the upper bound, the success probability is better than what we do not use the idea to do, except for some special cases.
The discrimination between two unknown states can be performed by a universal programmable discriminator, where the copies of the two possible states are stored in two program systems respectively and the copies of data, which we want to confirm, are provided in the data system. In the present paper, we propose a group-theretic approach to the multi-copy programmable state discrimination problem. By equivalence of unknown pure states to known mixed states and with the representation theory of
U(n) group, we construct the Jordan basis to derive the analytical results for both the optimal unambiguous discrimination and minimum-error discrimination. The POVM operators for unambiguous discrimination and orthogonal measurement operators for minimum-error discrimination are obtained. We find that the optimal failure probability and minimum-error probability for the discrimination between the mean input mixd states are dependent on the dimension of the unknown qudit states. We applied the approach to generalize the results of He and Bergou (2007) from qubit to qudit case, and we further solve the problem of programmable dicriminators with arbitrary copies of unknown states in both program and data systems.
The universal programmable discriminator is a device for discrimination between unknown quantum states. It has two kinds of registers: the program register and the data register. The states that are stored in registers are all unknown. It is assured that the data state is identical with one of the program states with the certain probability. The aim is to optimally identify the state stored in the data register with one of the program states that it is done by discriminating between unknown states of the combined system contains program and data registers. We design an optimal universal unambiguous programmable discriminator that has
N qubit systems in the program register, to unambiguously identify the qubit state of data with one of
N program qubit states. All unknown qubit states are pure and
ND copies of the data state are available. We determine the optimal positive-operator valued measure (POVM) elements in two different ways. First, we find optimal POVMs that maximize the average of the overall success probability of discrimination between
N unknown pure states of the combined system. In another way, the problem of discrimination between
N unknown pure states of the combined system is reduced to discrimination between
N known average mixed states. It is shown that theses two different ways lead to the same results. We show that at least $N\ensuremath{-}1$ copies of the data state are necessary for discriminating between
N unknown states of the combined system.