Quantum state separation is a probabilistic map that transforms a given set of pure states into another set of more distinguishable ones. Here we investigate such a map acting onto uniparametric families of symmetric linearly dependent or independent quantum states. We obtained analytical solutions for the success probability of the maps---which is shown to be optimal---as well as explicit constructions in terms of positive operator valued measures. Our results can be used for state discrimination strategies interpolating continuously between minimum-error and unambiguous (or maximum-confidence) discrimination, which, in turn, have many applications in quantum information protocols. As an example, we show that quantum teleportation through a nonmaximally entangled quantum channel can be accomplished with higher probability than the one provided by unambiguous (or maximum-confidence) discrimination and with higher fidelity than the one achievable by minimum-error discrimination. Finally, an optical network is proposed for implementing parametric state separation.
Quantum state separation is a probabilistic map that transforms a given set of pure states into another set of more distinguishable ones. Here we investigate such a map acting onto uniparametric families of symmetric linearly dependent or independent quantum states. We obtained analytical solutions for the success probability of the maps---which is shown to be optimal---as well as explicit constructions in terms of positive operator valued measures. Our results can be used for state discrimination strategies interpolating continuously between minimum-error and unambiguous (or maximum-confidence) discrimination, which, in turn, have many applications in quantum information protocols. As an example, we show that quantum teleportation through a nonmaximally entangled quantum channel can be accomplished with higher probability than the one provided by unambiguous (or maximum-confidence) discrimination and with higher fidelity than the one achievable by minimum-error discrimination. Finally, an optical network is proposed for implementing parametric state separation.
In our work we explore the field of quantum state discrimination and quantum cloning. Recently the problem of optimal state discrimination with a Fixed Rate of Inconclusive Outcomes (FRIO strategy) has been solved for two pure quantum states and a few other highly symmetric cases. An optical implementation to FRIO for pure states is provided. The physical implementation can be carried out with the use of a six-port interferometer constructed with optical fibers beam splitters, phase shifters and mirrors. The input states are composed of qubits which are realized as photons in the dual-rail representation. The non-unitary measurements are carried out at the output for the presence or absence of a photon. The setup optimally interpolates between minimum error and unambiguous state discrimination. We also extend the FRIO strategy to two mixed states, whose eigenvectors in their spectral representation form a Jordan basis. We derive the minimum error rate PE for a fixed inconclusive rate Q and, in particular, the optimal distribution of the total Q over the Jordan subspaces. As Q is varied between the two limits, 0 < Q < Qc, a structure with multiple thresholds, Q1(th) (=0) < Q2(th) < . . . < QN(th) < Qc, emerges. We also solve the problem of state separation of two known pure states in the general case where the known states have arbitrary prior probabilities. The solution emerges from a geometric formulation of the problem. This formulation also reveals a deeper connection between cloning and state discrimination. The results are then applied in designing a scheme for hybrid cloning which interpolates between approximate and probabilistic exact cloning. It is shown that state separation and hybrid cloning are generalized schemes to well established state discrimination and cloning strategies. The connection between cloning and state separation is derived in the asymptotic limit.
The quantum state discrimination problem is ubiquitous in quantum information and serves as the foundation for many quantum communication schemes proposed so far. This paper investigates the optimal discrimination of three symmetric quantum states with equal prior probabilities. To obtain completely accessible information about the input pure states, this strategy makes improvements to the two standard strategies of quantum state discrimination, namely the minimum error discrimination and unambiguous discrimination. The new discrimination strategy proposed in this paper can be applied to both linearly independent and dependent quantum states.
Unambiguously distinguishing between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In principle, the problem can be solved by mapping the set of nonorthogonal quantum states onto a set of orthogonal ones, which then can be distinguished without error. Such nonunitary transformations can be performed conditionally on quantum systems; a unitary transformation is carried out on a larger system of which the system of interest is a subsytem, a measurement is performed, and if the proper result is obtained the desired nonunitary transformation has been performed on the subsystem. We show how to construct generalized interferometers (multiports), which when combined with measurements on some of the output ports, implement nonunitary transformations of this type. The input states are single-photon states in which the photon is divided among several modes. A number of explicit examples of distinguishing among three nonorthogonal states are discussed, and the networks that optimally distinguish among these states are presented.
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure states in the general case where the known states have arbitrary a priori probabilities. The problem is formulated from a geometric perspective and shown to be equivalent to the problem of finding tangent curves within two families of conics that represent the unitarity constraints and the objective functions to be optimized, respectively. We present the corresponding analytical solutions in various forms. In the limit of perfect state separation, which is equivalent to unambiguous state discrimination, the solution exhibits a phenomenon analogous to a second order symmetry breaking phase transition. We also propose a linear optics implementation of separation which is based on the dual rail representation of qubits and single-photon multiport interferometry.
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.
It is known that unambiguous discrimination among nonorthogonal but linearly independent quantum states is possible with a certain probability of success. Here, we consider a variant of that problem. Instead of discriminating among all of the different states, we shall only discriminate between two subsets of them. In particular, for the case of three nonorthogonal states, ${|{\ensuremath{\psi}}_{1}〉,|{\ensuremath{\psi}}_{2}〉,|{\ensuremath{\psi}}_{3}〉},$ we show that the optimal strategy to distinguish $|{\ensuremath{\psi}}_{1}〉$ from the set ${|{\ensuremath{\psi}}_{2}〉,|{\ensuremath{\psi}}_{3}〉}$ has a higher success rate than if we wish to discriminate among all three states. Somewhat surprisingly, for unambiguous discrimination the subsets need not be linearly independent. A fully analytical solution is presented, and we also show how to construct generalized interferometers (multiport) which provide an optical implementation of the optimal strategy.