We propose a ``programmable'' quantum device that is able to perform a specific generalized measurement from a certain set of measurements depending on a quantum state of a ``program register.'' In particular, we study a situation when the programmable measurement device serves for the unambiguous discrimination between nonorthogonal states. The particular pair of states that can be unambiguously discriminated is specified by the state of a program qubit. The probability of successful discrimination is not optimal for all admissible pairs. However, for some subsets it can be very close to the optimal value.
We propose a programmable'' quantum device that is able to perform a specific generalized measurement from a certain set of measurements depending on a quantum state of a program register.'' In particular, we study a situation when the programmable measurement device serves for the unambiguous discrimination between nonorthogonal states. The particular pair of states that can be unambiguously discriminated is specified by the state of a program qubit. The probability of successful discrimination is not optimal for all admissible pairs. However, for some subsets it can be very close to the optimal value.
We discuss the problem of designing unambiguous programmable discriminators for any n unknown quantum states in an m-dimensional Hilbert space. The discriminator is a fixed measurement that has two kinds of input registers: the program registers and the data register. The quantum state in the data register is what users want to identify, which is confirmed to be among the n states in program registers. The task of the discriminator is to tell the users which state stored in the program registers is equivalent to that in the data register. First, we give a necessary and sufficient condition for judging an unambiguous programmable discriminator. Then, if m=n, we present an optimal unambiguous programmable discriminator for them, in the sense of maximizing the worst-case probability of success. Finally, we propose a universal unambiguous programmable discriminator for arbitrary n quantum states.
We discuss the problem of designing unambiguous programmable discriminators for any n unknown quantum states in an m-dimensional Hilbert space. The discriminator is a fixed measurement which has two kinds of input registers: the program registers and the data register. The program registers consist of the n states, while the data register is prepared among them. The task of the discriminator is to tell us which state stored in the program registers is equivalent to that in the data register. First, we give a necessary and sufficient condition for judging an unambiguous programmable discriminator. Then, if m=n, we present an optimal unambiguous programmable discriminator for them, in the sense of maximizing the worst-case probability of success. Finally, we propose a universal unambiguous programmable discriminator for arbitrary n quantum states. We also show how to use this universal discriminator to unambiguously discriminate mixed states.
We construct a device that can unambiguously discriminate between two unknown quantum states. The unknown states are provided as inputs, or programs, for the program registers, and a third system, which is guaranteed to be prepared in one of the states stored in the program registers, is fed into the data register of the device. The device will then, with some probability of success, tell us whether the unknown state in the data register matches the state stored in the first or the second program register. We show that the optimal device, i.e., the one that maximizes the probability of success, is universal. It does not depend on the actual unknown states that we wish to discriminate.
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.
We describe a class of programmable devices that can discriminate between two quantum states. We consider two cases. In the first, both states are unknown. One copy of each of the unknown states is provided as an input, or program, for the two program registers, and the data state, which is guaranteed to be prepared in one of the program states, is fed into the data register of the device. This device will then tell us, in an optimal way, which of the templates stored in the program registers the data state matches. In the second case, we know one of the states while the other is unknown. One copy of the unknown state is fed into the single program register, and the data state which is guaranteed to be prepared in either the program state or the known state, is fed into the data register. The device will then tell us, again optimally, whether the data state matches the template or is the known state. We determine two types of optimal devices. The first performs discrimination with minimum error, and the second performs optimum unambiguous discrimination. In all cases we first treat the simpler problem of only one copy of the data state and then generalize the treatment to n copies. In comparison to other works we find that providing n>1 copies of the data state yields higher success probabilities than providing n>1 copies of the program states.
We present an optical implementation of two programmable quantum measurement devices. The first one serves for unambiguous discrimination of two nonorthogonal states of a qubit. The particular pair of states to be discriminated is specified by the quantum state of a program qubit. The second device can perform von Neumann measurements on a single qubit in any basis located on the equator of the Bloch sphere. Again, the basis is selected by the state of a program qubit. In both cases the data and program qubits are represented by polarization states of photons. The experimental apparatus exploits the fact that two Bell states can be distinguished solely by means of linear optics. The outcome corresponding to the remaining two Bell states represents an inconclusive result.