相关论文: Success probabilities for universal unambiguous di…
Two unknown states can be unambiguously distinguished by a universal programmable discriminator, which has been widely discussed in previous works and the optimal solution has also been obtained. In this paper, we investigate the…
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…
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…
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…
Given $n$ linearly independent pure states and their prior probabilities, we study the problem of optimum unambiguous discrimination of these states. We derive the properties of the optimum solution and the equations that must be satisfied…
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…
We consider the unambiguous discrimination between two unknown qudit states in $n$-dimensional ($n\geqslant2$) Hilbert space. By equivalence of unknown pure states to known mixed states and with the Jordan-basis method, we demonstrate that…
The problem of optimally discriminating between two completely unknown qubit states is generalized by allowing an error margin. It is visualized as a device---the programmable discriminator---with one data and two program ports, each fed…
We consider the problem of unambiguous (error-free) discrimination of N linearly independent pure quantum states with prior probabilities, where the goal is to find a measurement that maximizes the average probability of success. We derive…
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 input, or program, for the two…
In this paper, we consider the problem of unambiguous discrimination between a set of mixed quantum states. We first divide the density matrix of each mixed state into two parts by the fact that it comes from ensemble of pure quantum…
Based on our previous publication [U. Herzog and J. A. Bergou, Phys.Rev. A 71, 050301(R) (2005)] we investigate the optimum measurement for the unambiguous discrimination of two mixed quantum states that occur with given prior…
We study how to unambiguously identify a given quantum pure state with one of the two reference pure states when no classical knowledge on the reference states is given but a certain number of copies of each reference quantum state are…
Recently the problem of Unambiguous State Discrimination (USD) of mixed quantum states has attracted much attention. So far, bounds on the optimum success probability have been derived [1]. For two mixed states they are given in terms of…
In this paper we present the solution to the problem of optimally discriminating among quantum states, i.e., identifying the states with maximum probability of success when a certain fixed rate of inconclusive answers is allowed. By varying…
In this paper we consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can…
We consider two different optimized measurement strategies for the discrimination of nonorthogonal quantum states. The first is conclusive discrimination with a minimum probability of inferring an erroneous result, and the second is…
We address the problem of unambiguously identifying the state of a probe qudit with the state of one of d reference qudits. The reference states are assumed pure and linearly independent but we have no knowledge of them. The state of the…
We consider the problem of determining the state of an unknown quantum sequence without error. The elements of the given sequence are drawn with equal probability from a known set of linearly independent pure quantum states with the…
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…