In this paper, we discuss the problem of determining whether a quantum system is in a pure state, or in a mixed state. We apply two strategies to settle this problem: the unambiguous discrimination and the maximum confidence discrimination. We prove that the optimal versions of both strategies are equivalent. Furthermore, the scheme also provides a method to estimate the purity of quantum states, and the Schmidt number of composed systems.
In this paper, we discuss the problem of determining whether a quantum system is in a pure state, or in a mixed state. We apply two strategies to settle this problem: the unambiguous discrimination and the maximum confidence discrimination. We prove that the optimal versions of both strategies are equivalent. Furthermore, the scheme also provides a method to estimate the purity of quantum states, and the Schmidt number of composed systems.
We study an optimized measurement which discriminates N mixed quantum states occurring with given prior probabilities. The measurement yields the maximum achievable confidence for each of the N conclusive outcomes, thereby keeping the overall probability of inconclusive outcomes as small as possible. It corresponds to optimum unambiguous discrimination when for each outcome the confidence is equal to unity. Necessary and sufficient optimality conditions are derived and general properties of the optimum measurement are obtained. The results are applied to the optimized maximum-confidence discrimination of N equiprobable symmetric mixed states. Analytical solutions are presented for a number of examples, including the discrimination of N symmetric pure states spanning a d-dimensional Hilbert space ($d\ensuremath{\leqslant}N$) and the discrimination of N symmetric mixed qubit states.
The discrimination of two mixed quantum states is a fundamental task in quantum state estimation and quantum information theory. In quantum state discrimination a quantum system is assumed to be in one of two possible – in general mixed – non-orthogonal quantum states. The discrimination then consists of a measurement strategy that allows to decide in which state the system was before the measurement. In unambiguous state discrimination the aim is to make this decision without errors, but it is allowed to give an inconclusive answer.
Especially interesting are measurement strategies that minimize the probability of an inconclusive answer. A starting point for the analysis of this optimization problem was a result by Eldar et al. [Phys. Rev. A 69, 062318 (2004)], which provides non-operational necessary and sufficient conditions for a given measurement strategy to be optimal. These conditions are reconsidered and simplified in such a way that they become operational. The simplified conditions are the basis for further central results: It is shown that the optimal measurement strategy is unique, a statement that is e.g. of importance for the complexity analysis of optimal measurement devices. The optimal measurement strategy is derived for the case, where one of the possible input states has at most rank two, which was an open problem for many years. Furthermore, using the optimality criterion it is shown that there always exists a threshold probability for each state, such that below this probability it is optimal to exclude this state from the discrimination strategy.
If the two states subject to discrimination can be brought to a diagonal structure with (2×2)-dimensional blocks, then the unambiguous discrimination of these states can be reduced to the unambiguous discrimination of pure states.
A criterion is presented that allows to identify the presence of such a structure for two self-adjoint operators. This criterion consists of the evaluation of three commutators and allows an explicit construction of the (2×2)-dimensional blocks.
As an important application of unambiguous state discrimination, unambiguous
state comparison, i.e., the question whether two states are identical or not, is generalized and optimal measurements for this problem are constructed.
If for a certain family of states, a physical device maps the input state to an output state, such that a second device can be built that yields back the original input state, such a map is called reversible on this family. With respect to state discrimination, such reversible maps are particularly interesting, if the output states are pure. A complete characterization of all families that allow such a reversible and purifying map is provided. If the states are mapped to pure states, but the map itself is not reversible, upper and lower bounds are analyzed for the “deviation from perfect faithfulness”, a quantity which measures the deviation from a reversible mapping.
We investigate the unambiguous comparison of quantum states in a scenario that is more general than the one that was originally suggested by Barnett et al. First, we find the optimal solution for the comparison of two states taken from a set of two pure states with arbitrary a priori probabilities. We show that the optimal coherent measurement is always superior to the optimal incoherent measurement. Second, we develop a strategy for the comparison of two states from a set of N pure states, and find an optimal solution for some parameter range when N=3. In both cases we use the reduction method for the corresponding problem of mixed-state discrimination, as introduced by Raynal et al., which reduces the problem to the discrimination of two pure states only for N=2. Finally, we provide a necessary and sufficient condition for unambiguous comparison of mixed states to be possible.
We consider two different optimized measurement strategies for the discrimination of nonorthogonal quantum states. The first is ambiguous discrimination with a minimum probability of inferring an erroneous result, and the second is unambiguous, i.e., error-free, discrimination with a minimum probability of getting an inconclusive outcome, where the measurement fails to give a definite answer. For distinguishing between two mixed quantum states, we investigate the relation between the minimum-error probability achievable in ambiguous discrimination, and the minimum failure probability that can be reached in unambiguous discrimination of the same two states. The latter turns out to be at least twice as large as the former for any two given states. As an example, we treat the case where the state of the quantum system is known to be, with arbitrary prior probability, either a given pure state, or a uniform statistical mixture of any number of mutually orthogonal states. For this case we derive an analytical result for the minimum probability of error and perform a quantitative comparison with the minimum failure probability.
Deterministic discrimination of nonorthogonal states is forbidden by quantum measurement theory. However, if we do not want to succeed all the time, i.e., allow for inconclusive outcomes to occur, then unambiguous discrimination becomes possible with a certain probability of success. A variant of the problem is set discrimination: the states are grouped in sets and we want to determine to which particular set a given pure input state belongs. We consider here the simplest case, termed quantum state filtering, when the N given nonorthogonal states ${\ensuremath{\mid}{\ensuremath{\psi}}_{1}⟩,\dots{},\ensuremath{\mid}{\ensuremath{\psi}}_{N}⟩}$ are divided into two sets and the first set consists of one state only while the second consists of all of the remaining states. We present the derivation of the optimal measurement strategy, in terms of a generalized measurement (positive-operator-valued measure), to distinguish $\ensuremath{\mid}{\ensuremath{\psi}}_{1}⟩$ from the set ${\ensuremath{\mid}{\ensuremath{\psi}}_{2}⟩,\dots{},\ensuremath{\mid}{\ensuremath{\psi}}_{N}⟩}$ and the corresponding optimal success and failure probabilities. The results, but not the complete derivation, were presented previously [Phys. Rev. Lett. 90, 25901 (2003)] as the emphasis there was on appplication of the results to probabilistic quantum algorithms. We also show that the problem is equivalent to the discrimination of a pure state and an arbitrary mixed state.
We investigate the discrimination of pure-mixed (quantum filtering) and mixed-mixed states and compare their optimal success probability with the one for discriminating other pairs of pure states superposed by the vectors included in the mixed states. We prove that under the equal-fidelity condition, the pure-pure state discrimination scheme is superior to the pure-mixed (mixed-mixed) one. With respect to quantum filtering, the coherence exists only in one pure state and is detrimental to the state discrimination for lower dimensional systems; while it is the opposite for the mixed-mixed case with symmetrically distributed coherence. Making an extension to infinite-dimensional systems, we find that the coherence which is detrimental to state discrimination may become helpful and vice versa.