Optimal Unambiguous State Discrimination Research Articles

Quantum state discrimination in a PT -symmetric system

Nonorthogonal quantum state discrimination (QSD) plays an important role in quantum information and quantum communication. In addition, compared to Hermitian quantum systems, parity-time-($\mathcal{PT}$-)symmetric non-Hermitian quantum systems exhibit novel phenomena and have attracted considerable attention. Here, we experimentally demonstrate QSD in a $\mathcal{PT}$-symmetric system (i.e., $\mathcal{PT}$-symmetric QSD), by having quantum states evolve under a $\mathcal{PT}$-symmetric Hamiltonian in a lossy linear optical setup. We observe that two initially nonorthogonal states can rapidly evolve into orthogonal states, and the required evolution time can even be vanishing provided the matrix elements of the Hamiltonian become sufficiently large. We also observe that the cost of such a discrimination is a dissipation of quantum states into the environment. Furthermore, by comparing $\mathcal{PT}$-symmetric QSD with optimal strategies in Hermitian systems, we find that at the critical value, $\mathcal{PT}$-symmetric QSD is equivalent to the optimal unambiguous state discrimination in Hermitian systems. We also extend the $\mathcal{PT}$-symmetric QSD to the case of discriminating three nonorthogonal states. The QSD in a $\mathcal{PT}$-symmetric system opens a new door for quantum state discrimination, which has important applications in quantum computing, quantum cryptography, and quantum communication.

Qutrit state tomography via optimal unambiguous state discrimination and mutually unbiased measurements

We propose an efficient scheme for qutrit state tomography based on optimal unambiguous discrimination of three nonorthogonal pure qutrit states. In our scheme, we first introduce an ancillary qubit initially prepared in a known state and apply a joint unitary transformation on the whole system composed of a qutrit state and an ancillary qubit state. Afterwards, we make a local von Neumann measurement (VNM) on the ancillary qubit. If it is projected onto the state | 0 〉 , we finally perform mutually unbiased measurements (MUMs) on the collapsed qutrit state arbitrarily chosen from a complete set of four mutually unbiased bases (MUBs). With only six properly-chosen projectors, the real and imaginary parts of non-diagonal elements can be entirely obtained. Together with the diagonal elements obtained directly from one VNM in the computational bases, the density matrix of an arbitrary unknown qutrit state can be fully determined. Compared with the previous work (R. Salazar and A. Delgado 2012), our scheme consumes much less resources. In comparison with MUBs-based tomography scheme (H. Yuan, et al., 2016), our scheme requires more measurements and less projectors, but pays the price of a loss of certain fraction identically prepared states. Our proposal can be extended to the case of other d -dimensional quantum states if their d MUBs are exactly known. • An efficient scheme for qutrit state tomography based on optimal unambiguous state discrimination is proposed. • Three mutually unbiased measurements with six projectors are performed. • Our scheme consumes much less resources, compared to the previous works.

Optimal unambiguous discrimination of pure quantum states using SDP method

• POVM as a generalized measurement. • Linearly independent pure states. • KKT optimization. In the present paper, an exact analytic solution for the optimal unambiguous state discrimination(OPUSD) problem involving an arbitrary number of pure linearly independent quantum states with real and complex inner product is presented. Using semidefinite programming and Karush-Kuhn-Tucker convex optimization method, we derive an analytical formula which shows the relation between optimal solution of unambiguous state discrimination problem and an arbitrary number of pure linearly independent quantum states.

Practical Quantum Key Distribution with Non-Phase-Randomized Coherent States

Quantum key distribution (QKD) based on coherent states is well known for its implementation simplicity, but it suffers from loss-dependent attacks based on optimal unambiguous state discrimination. Crucially, previous research has suggested that coherent-state QKD is limited to short distances, typically below 100 km assuming standard optical fiber loss and system parameters. In this work, we propose a six-coherent-state phase-encoding QKD protocol that is able to tolerate the total loss of up to 38 dB assuming realistic system parameters, and up to 56 dB loss assuming zero noise. The security of the protocol is calculated using a recently developed security proof technique based on semi-definite programming, which assumes only the inner-product information of the encoded coherent states, the expected statistics, and that the measurement is basis-independent. Our results thus suggest that coherent-state QKD could be a promising candidate for high-speed provably-secure QKD.

Extracting remaining information from an inconclusive result in optimal unambiguous state discrimination

In unambiguous state discrimination, the measurement results consist of the error-free results and an inconclusive result, and an inconclusive result is conventionally regarded as a useless remainder from which no information about initial states is extracted. In this paper, we investigate the problem of extracting remaining information from an inconclusive result, provided that the optimal total success probability is determined. We present three simple examples. An inconclusive answer in the first two examples can be extracted partial information, while an inconclusive answer in the third one cannot be. The initial states in the third example are defined as the highly symmetric states.

Distinguishing between Nonorthogonal Quantum States of a Single Nuclear Spin

An important task for quantum-information processing is optimal discrimination between two nonorthogonal quantum states, which until now has been realized only optically. Here, we present and compare experimental realizations of optimal quantum measurements for distinguishing between two nonorthogonal quantum states encoded in a single (14)N nuclear spin at a nitrogen-vacancy defect in diamond. Implemented measurement schemes are the minimum-error measurement (known as Helstrom measurement), unambiguous state discrimination using a standard projective measurement, and optimal unambiguous state discrimination [known as Ivanovic-Dieks-Peres (IDP) measurement], which utilizes a three-dimensional Hilbert space. This allows us to benchmark the IDP measurement against the standard projective measurements. Measurement efficiencies are found to be above 80% for all schemes and reach a value of 90% for the IDP measurement.

Optical scheme for realization of optimal unambiguous state discrimination of the JS limit

We exploit optimal probabilistic cloning to rederive the JS limit. Dependent on the formulation given by the optimal probabilistic cloning, the explicit transformation of a measure of the JS limit is presented. Based on linear optical devices, we propose an experimentally feasible scheme to implement the JS limit measure of a general pair of two nonorthogonal quantum states. The success probability of the proposed scheme is unity.

Minimax Strategy of Optimal Unambiguous State Discrimination

In this paper, we consider the minimax strategy to unambiguously discriminate two pure nonorthogonal quantum states without knowing a priori probability. By exploiting the positive-operator valued measure, we derive the upper bound of the minimax measurement of the optimal unambiguous state discrimination. Based on the linear optical devices, we propose an experimentally feasible scheme to implement a minimax measure of a general pair of two nonorthogonal quantum states.

Structural approach to unambiguous discrimination of two mixed quantum states

We analyze the optimal unambiguous discrimination of two arbitrary mixed quantum states. We show that the optimal measurement is unique and we present this optimal measurement for the case where the rank of the density operator of one of the states is at most 2 (“solution in four dimensions”). The solution is illustrated by some examples. The optimality conditions proven by Eldar et al. [Phys. Rev. A 69, 062318 (2004)] are simplified to an operational form. As an application we present optimality conditions for the measurement, when only one of the two states is detected. The current status of optimal unambiguous state discrimination is summarized via a general strategy.

OPTIMAL UNAMBIGUOUS DISCRIMINATION OF TWO FINITE-DIMENSIONAL COHERENT STATES

An exact analytical solution to the optimal unambiguous state discrimination involving two finite-dimensional coherent states that occur with given prior probabilities is presented using the Lewenstein–Sanpera decomposition method. Furthermore, a numerical method is advised for efficient solving of the unambiguous state discrimination of the two finite-dimensional coherent states with the same dimensions. In this manner, it is shown that the maximum success rate for the unambiguous states discrimination of the two finite-dimensional coherent states with the arbitrary prior probability is decreased by increasing the dimensionality of the finite-dimensional coherent states. Also, the success rate for the unambiguous states discrimination of the two coherent states satisfies the upper bound proportional to the fidelity of the states for a given prior probability.

Optimal unambiguous discrimination of quantum states

Unambiguous discrimination between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this study, using the connection between Lewenstein-Sanpera decomposition (LSD) and optimal unambiguous state discrimination (OPUSD), an analytic relation for the feasible region of $N$ linearly independent quantum states is presented in terms of inner product of reciprocal states. Then, for the real inner product of states, an exact analytic solution for the OPUSD problem involving an arbitrary number of pure linearly independent quantum states is presented using the Karush-Kuhn-Tucker convex optimization method. In another approach, an analytic relation for the feasible region for an arbitrary number of pure linearly independent quantum states is presented in terms of the inner product of states. To this end, the relevant semidefinite programming task is reduced to a linear programming (LP) one with a feasible region of polygon type which can be solved via simplex method. Moreover, using the obtained feasible region, an exact analytic solution to an OPUSD problem involving two and three pure linearly independent quantum states is provided.

Experimental scheme for unambiguous discrimination of linearly independent symmetric states

We propose an experimental setup for discriminating four linearly independent nonorthogonal symmetric quantum states. The setup is based on linear optics only and can be configured to implement both optimal unambiguous state discrimination [Chefles and Barnett, Phys. Lett. A 250, 223 (1998)] and minimum error discrimination. In both cases, the setup is characterized by an optimal success probability. The experimental setup can be generalized to the case of discrimination among $N$ linearly nonorthogonal symmetric quantum states. We also study the discrimination between two incoherent superpositions of symmetric states. In this case, the setup also achieves an optimal success probability in the case of unambiguous discrimination as well as minimum error discrimination.

Optimal unambiguous state discrimination of two density matrices: A second class of exact solutions

We consider the unambiguous state discrimination (USD) of two mixed quantum states. We study the rank and the spectrum of the elements of an optimal USD measurement. This naturally leads to a partial fourth reduction theorem. This theorem shows that either the failure probability equals its overall lower bound given in terms of the fidelity or a two-dimensional subspace can be split off from the original Hilbert space. We then use this partial reduction theorem to derive the optimal solution for any two equally probable geometrically uniform states ${\ensuremath{\rho}}_{0}$ and ${\ensuremath{\rho}}_{1}=U{\ensuremath{\rho}}_{0}{U}^{\ifmmode\dagger\else\textdagger\fi{}}$, ${U}^{2}=\mathbb{1}$, in a four-dimensional Hilbert space. This represents a second class of analytical solutions for USD problems that cannot be reduced to some pure state cases. We apply our result to answer two questions that are relevant in implementations of the Bennett and Brassard 1984 quantum key distribution protocol using weak coherent states.

Erratum: Optimal unambiguous state discrimination of two density matrices: Lower bound and class of exact solutions [Phys. Rev. A 72, 022342 (2005)

Erratum: Optimal unambiguous state discrimination of two density matrices: Lower bound and class of exact solutions [Phys. Rev. A 72, 022342 (2005)

Optimal unambiguous state discrimination of two density matrices: Lower bound and class of exact solutions

Recently the problem of unambiguous state discrimination of mixed quantum states has attracted much attention. So far, bounds on the optimum success probability have been derived [T. Rudolph, R. W. Spekkens, and P. S. Turner, Phys. Rev. A 68, 010301(R) (2003)]. For two mixed states they are given in terms of the fidelity. Here we give tighter bounds as well as necessary and sufficient conditions for two mixed states to reach these bounds. Moreover we construct the corresponding optimal measurement strategies. With this result, we provide analytical solutions for unambiguous discrimination of a class of generic mixed states. This goes beyond known results which are all reducible to some pure state case. Additionally, we show that examples exist where the bounds cannot be reached.

Reduction theorems for optimal unambiguous state discrimination of density matrices

We present reduction theorems for the problem of optimal unambiguous state discrimination of two general density matrices. We show that this problem can be reduced to that of two density matrices that have the same rank n and are described in a Hilbert space of dimensions 2n. We also show how to use the reduction theorems to discriminate unambiguously between N mixed states (N{>=}2)