We give a lower bound on the probability of error in quantum state discrimination. The bound is a weighted sum of the pairwise fidelities of the states to be distinguished.
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 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 conclusive discrimination, and the minimum failure probability that ca…
There are two common settings in a quantum-state discrimination problem. One is minimum-error discrimination where a wrong guess (error) is allowed and the discrimination success probability is maximized. The other is unambiguous discrimination where errors are not allowed but the inconclusive result "I don't know" is possible. We investigate discrimination problem with a finite margin imposed on the error probability. The two common settings correspond to the error margins 1 and 0. For arbitrary error margin, we determine the optimal discrimination probability for two pure states with equal o…
We study an optimized measurement that discriminates two mixed quantum states with maximum confidence for each conclusive result, thereby keeping the overall probability of inconclusive results as small as possible. When the rank of the detection operators associated with the two different conclusive outcomes does not exceed unity we obtain a general solution. As an application, we consider the discrimination of two mixed qubit states. Moreover, for the case of higher-rank detection operators we give a solution for particular states. The relation of the optimized measurement to other discrimin…
We derive a general lower bound on the minimum-error probability for {\it ambiguous discrimination} between arbitrary $m$ mixed quantum states with given prior probabilities. When $m=2$, this bound is precisely the well-known Helstrom limit. Also, we give a general lower bound on the minimum-error probability for discriminating quantum operations. Then we further analyze how this lower bound is attainable for ambiguous discrimination of mixed quantum states by presenting necessary and sufficient conditions related to it. Furthermore, with a restricted condition, we work out a upper bound on th…
We investigate a state discrimination problem which interpolates minimum-error and unambiguous discrimination by introducing a margin for the probability of error. We closely analyze discrimination of two pure states with general occurrence probabilities. The optimal measurements are classified into three types. One of the three types of measurement is optimal depending on parameters (occurrence probabilities and error margin). We determine the three domains in the parameter space and the optimal discrimination success probability in each domain in a fully analytic form. It is also shown that …
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 an upper bound on the optimal average probability of success using a result on optimal local conversion between two bipartite pure states. We prove that an optimal measurement in general saturates our bound. In the exceptional cases we show that the bound is tight, but not always optimal.
We propose an optimal discrimination scheme for a case of four linearly independent nonorthogonal symmetric quantum states, based on linear optics only. The probability of discrimination is in agreement with the optimal probability for unambiguous discrimination among N symmetric states [Phys. Lett. A \textbf{250}, 223 (1998)]. The experimental setup can be extended for the case of discrimination among $2^M$ nonorthogonal symmetric quantum states.
In this paper, we propose a method to discriminate two extremely similar quantum states via a weak measurement. For the two states with equal prior probabilities, the optimum discrimination probability given by Ivanovic-Dieks-Peres limit can be achieved by our protocol with an appropriate choice of the interaction strength. However, compared with the conventional method for state discrimination, our approach shows the advantage of error-tolerance by achieving a better ratio of the success probability to the probability of error.
We provide a general framework of utilizing the no-signaling principle in derivation of the guessing probability in the minimum-error quantum state discrimination. We show that, remarkably, the guessing probability can be determined by the no-signaling principle. This is shown by proving that in the semidefinite programming for the discrimination, the optimality condition corresponds to the constraint that quantum theory cannot be used for a superluminal communication. Finally, a general bound to the guessing probability is presented in a closed form.
We propose upper and lower bounds on the maximum success probability for discriminating given quantum states. The proposed upper bound is obtained from a suboptimal solution to the dual problem of the corresponding optimal state discrimination problem. We also give a necessary and sufficient condition for the upper bound to achieve the maximum success probability; the proposed lower bound can be obtained from this condition. It is derived that a slightly modified version of the proposed upper bound is tighter than that proposed by Qiu et al. [Phys. Rev. A 81, 042329 (2010)]. Moreover, we propo…
We investigate the discrimination between photon polarizations when measured by moving detectors. Both unambiguous and minimum-error discriminations are considered, and we analyze the the optimal successful (correct) probability as a function of the apparatus' velocity. The Holevo bound for polarization discrimination is also discussed and explicit calculation shows that the Holevo bound and the optimal successful (correct) probability for unambiguous (minimum-error) discrimination simultaneously increase or decrease.
The minimum-error probability of ambiguous discrimination for two quantum states is the well-known {\it Helstrom limit} presented in 1976. Since then, it has been thought of as an intractable problem to obtain the minimum-error probability for ambiguously discriminating arbitrary $m$ quantum states. In this paper, we obtain a new lower bound on the minimum-error probability for ambiguous discrimination and compare this bound with six other bounds in the literature. Moreover, we show that the bound between ambiguous and unambiguous discrimination does not extend to ensembles of more than two st…
We solve the problem of quantum state discrimination with "general (symmetric) figures of merit" for an even number of symmetric quantum bits with use of the no-signaling principle. It turns out that conditional probability has the same form for any figure of merit. Optimal measurement and corresponding conditional probability are the same for any monotonous figure of merit.
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 optimal success probability of the discrimination between two unknown states is independent of the dimension $n$. We also give a scheme for a physical implementation of the programmable state discriminator that unambiguously discriminate between two unknown states with optimal probability of success.
In this paper, we introduce a mixed form of ambiguous and unambiguous quantum state discriminations, and show that the mixed form has higher success probability than the unambiguous quantum state discriminations.
We find the allowed complex numbers associated with the inner product of N equally separated pure quantum states. The allowed areas on the unitary complex plane have the form of petals. A point inside the petal-shape represents a set of N linearly independent (LI) pure states, and a point on the edge of that area represents a set of N linearly dependent (LD) pure states. For each one of those LI sets we study the complete discrimination of its N equi-separated states combining sequentially the two known strategies: first the unambiguous identification protocol for LI states, followed, if neces…
We investigate a discrimination scheme between unitary processes. By introducing a margin for the probability of erroneous guess, this scheme interpolates the two standard discrimination schemes: minimum-error and unambiguous discrimination. We present solutions for two cases. One is the case of two unitary processes with general prior probabilities. The other is the case with a group symmetry: the processes comprise a projective representation of a finite group. In the latter case, we found that unambiguous discrimination is a kind of "all or nothing": the maximum success probability is eithe…
We solve the problem of discriminating with minimum error probability two given Pauli channels. We show that, differently from the case of discrimination between unitary transformations, the use of entanglement with an ancillary system can strictly improve the discrimination, and any maximally entangled state allows to achieve the optimal discrimination. We also provide a simple necessary and sufficient condition in terms of the structure of the channels for which the ultimate minimum error probability can be achieved without entanglement assistance. When such a condition is satisfied, the opt…
We study the discrimination of N mixed quantum states in an optimal measurement that maximizes the probability of correct results while the probability of inconclusive results is fixed at a given value. After considering the discrimination of N states in a d-dimensional Hilbert space, we focus on the discrimination of qubit states. We develop a method to determine an optimal measurement for discriminating arbitrary qubit states, taking into account that often the optimal measurement is not unique and the maximum probability of correct results can be achieved by several different measurements. …
Understanding the fundamental sensitivity limit of an optical sensor requires a full quantum mechanical description of the sensing task. In this work, we calculate the fundamental (quantum) limit for discriminating between pure laser light and thermal noise in a photon-starved regime. The Helstrom bound for discrimination error probability for single mode measurement is computed along with error probability bounds for direct detection, coherent homodyne detection and the Kennedy receiver. A generalized Kennedy (GK) receiver is shown to closely approach the Helstrom limit. We present an experim…
Using the necessary and sufficient conditions, minimum error discrimination among two sets of similarity transformed equiprobable quantum qudit states is investigated. In the case that the unitary operators are generating sets of two irreducible representations, the optimal set of measurements and the corresponding maximum success probability of discrimination are determined in closed form. In the case of reducible representations, there exists no closed-form formula in general, but the procedure can be applied in each case accordingly. Finally, we give the maximum success probability of optim…
It is shown that generalized measurements, required for optimally discriminating between nonorthogonal joint polarization states of two indistinguishable photons, can be realized with the help of polarization-dependent two-photon absorption and by means of sum-frequency generation. Optimization schemes are investigated with respect to minimizing the error probability in inferring the states, as well as with respect to maximizing the probability of success for unambiguous discrimination. Moreover, an implementation of error-minimizing discrimination between N symmetric single-photon states is s…
Unambiguous discrimination and exact cloning reduce the square-overlap between quantum states, exemplifying the more general type of procedure we term state separation. We obtain the maximum probability with which two equiprobable quantum states can be separated by an arbitrary degree, and find that the established bounds on the success probabilities for discrimination and cloning are special cases of this general bound. The latter also gives the maximum probability of successfully producing N exact copies of a quantum system whose state is chosen secretly from a known pair, given M initial re…
We study an optimum measurement for quantum state discrimination, which maximizes the probability of correct results when the probability of inconclusive results is fixed at a given value. The measurement describes minimum-error discrimination if this value is zero, while under certain conditions it corresponds to optimized maximum-confidence discrimination, or to optimum unambiguous discrimination, respectively, when the fixed value reaches a definite minimum. Using operator conditions that determine the optimum measurement, we derive analytical solutions for the discrimination of two mixed q…
In this work we study the problem of single-shot discrimination of von Neumann measurements, which we associate with measure-and-prepare channels. There are two possible approaches to this problem. The first one is simple and does not utilize entanglement. We focus only on the discrimination of classical probability distributions, which are outputs of the channels. We find necessary and sufficient criterion for perfect discrimination in this case. A more advanced approach requires the usage of entanglement. We quantify the distance between two measurements in terms of the diamond norm (called …
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 by the optimum measurement strategy which achieves the maximum average success probability, and also give the detailed steps to obtain the optimum solution and the optimum measurement strategy. The general method and results we obtain are also illustrated both numerically and geometrically. We derive a simple analytical formula of the maximum average success…
This expository article gives an overview of the theory of hypothesis testing of quantum states in finite dimensional Hilbert spaces. Optimal measurement strategy for testing binary quantum hypotheses, which result in minimum error probability, is discussed. Collective and individual adaptive measurement strategies in testing hypotheses in the multiple copy scenario, with various upper and lower bounds on error probability, are outlined. A brief account on quantum channel discrimination and the role of entangled states in achieving enhanced precision in the task of channel discrimination is gi…
A photon detector combining the two avalanche photon diodes (APD) has been demonstrated for qubit discrimination in 1550 nm. Spikes accompanied with the signals in gated-mode were canceled by balanced output from the two APDs. The spike cancellation enabled one to reduce the threshold in the discriminators, and thus the gate pulse voltage. The dark count probability and afterpulse probability were reduced to 7x10^-7 and 10^-4, respectively, without affecting the detection efficiency (11 %) at 178 K.
Generalized quantum measurements identifying non-orthogonal states without ambiguity often play an indispensable role in various quantum applications. For such unambiguous state discrimination scenario, we have a finite probability of obtaining inconclusive results and minimizing the probability of inconclusive results is of particular importance. In this paper, we experimentally demonstrate an adaptive generalized measurement that can unambiguously discriminate the quaternary phase-shift-keying coherent states with a near-optimal performance. Our scheme is composed of displacement operations,…
We consider a state discrimination problem which deals with settings of minimum-error and unambiguous discrimination systematically by introducing a margin for the probability of an incorrect guess. We analyze discrimination of three symmetric pure states of a qubit. The measurements are classified into three types, and one of the three types is optimal depending on the value of the error margin. The problem is formulated as one of semidefinite programming. Starting with the dual problem derived from the primal one, we analytically obtain the optimal success probability and the optimal measure…
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 the inconclusive rate, the scheme optimally interpolates between Unambiguous and Minimum Error discrimination, the two standard approaches to quantum state discrimination. We introduce a very general method that enables us to obtain the solution in a wide range of cases and give a complete characterization of the minimum discrimination error as a function o…
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 registers and one data register. However, we find that we can use the idea of programmable discriminator to unambiguously discriminate mixed quantum states. The research shows that by using such an idea, when the success probability for discrimination reaches the upper bound, the success probability is better than what we do not use the idea to do, except f…
A method to compute the optimal success probability of discrimination of N arbitrary quantum states is presented, based on the decomposition of any N-outcome measurement into sequences of nested two-outcome ones. In this way the optimization of the measurement operators can be carried out in successive steps, optimizing first the binary measurements at the deepest nesting level and then moving on to those at higher levels. We obtain an analytical expression for the maximum success probability after the first optimization step and examine its form for the specific case of N=3,4 states of a qubi…
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 states. The first part will not contribute anything to the discrimination, the second part has support space linearly independent to each other. Then the problem we consider can be reduced to a problem in which the strategy of set discrimination can be used in designing measurements to discriminate mixed states unambiguously. We find a necessary and sufficient con…
We address the problem of non-orthogonal two-state discrimination when multiple copies of the unknown state are available. We give the optimal strategy when only fixed individual measurements are allowed and show that its error probability saturates the collective (lower) bound asymptotically. We also give the optimal strategy when adaptivity of individual von Neumann measurements is allowed (which requires classical communication), and show that the corresponding error probability is exactly equal to the collective one for any number of copies. We show that this strategy can be regarded as Ba…
Multiple-copy state discrimination is a fundamental task in quantum information processing. If there are two, pure, non-orthogonal states then both local and collective schemes are known to reach the Helstrom bound, the maximum probability of successful discrimination allowed by quantum theory. For mixed states, it is known that only collective schemes can perform optimally, so it might be expected that these schemes are more resilient to preparation noise. We calculate the probability of success for two schemes, one local and one collective, in the regime of imperfect preparation fidelity. We…
We study Fock state interferometry, consisting of a Mach-Zehnder Interferometer with two Fock state inputs and photon-number-resolved detection at the two outputs. We show that it allows discrimination of a discrete number of apriori-known optical phase shifts with an error probability lower than what is feasible with classical techniques under a mean photon number constraint. We compare its performance with the optimal quantum probe for M-ary phase discrimination, which unlike our probe, is difficult to prepare. Our technique further allows discriminating a null phase shift from an increasing…
We address the problem of discriminating with minimal error probability two given quantum operations. We show that the use of entangled input states generally improves the discrimination. For Pauli channels we provide a complete comparison of the optimal strategies where either entangled or unentangled input states are used.
Distinguishing different quantum states is a fundamental task having practical applications for information processing. Despite the efforts devoted so far, however, strategies for optimal discrimination are known only for specific examples. We here consider the problem of minimum-error quantum state discrimination where the average error is attempted to be minimized. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied…
Quantum hypothesis testing is an important tool for quantum information processing. Two main strategies have been widely adopted: in a minimum error discrimination strategy, the average error probability is minimized; while in an unambiguous discrimination strategy, an inconclusive decision (abstention) is allowed to vanish any possibility of errors when a conclusive result is obtained. In both scenarios, the testing between quantum states are relatively well-understood, for example, the ultimate limits of the performance are established decades ago; however, the testing between quantum channe…
The question of the discrimination of the Bell states of two qudits (i.e., d-dimensional quantum systems) by means of passive linear optical elements and conditional measurements is discussed. A qudit is supposed to be represented by d optical modes containing exactly one photon altogether. From recent results of Calsamiglia it follows that there is no way how to distinguish the Bell states of two qudits for d>2 - not even with the probability of success lower than one - without any auxiliary photons in ancillary modes. Following the results of Carollo and Palma it is proved that it is impossi…
We consider the unambiguous discrimination of multipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition to realize the upper bound. We further establish a necessary and sufficient condition for this upper bound to be saturated. Finally, we illustrate our results using examples in multidimensional multipartite quantum systems.
We derive general discrimination of quantum states chosen from a certain set, given initial $M$ copies of each state, and obtain the matrix inequality, which describe the bound between the maximum probability of correctly determining and that of error. The former works are special cases of our results.
We present a theoretical study of minimum error probability discrimination, using quantum- optical probe states, of M optical phase shifts situated symmetrically on the unit circle. We assume ideal lossless conditions and full freedom for implementing quantum measurements and for probe state selection, subject only to a constraint on the average energy, i.e., photon number. In particular, the probe state is allowed to have any number of signal and ancillary modes, and to be pure or mixed. Our results are based on a simple criterion that partitions the set of pure probe states into equivalence …
A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by a Quantum Stochastic Walk. In particular, the structure of the graph mimics those of neural networks, with the quantum states to discriminate encoded on input nodes and with the discrimination obtained on the output nodes. We optimize the parameters of the network to obtain the highest probability of correct discrimination. Numerical simulations show that af…
We consider the optimal discrimination of bipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition for a measurement to realize the upper bound. We further establish a necessary and sufficient condition for this upper bound to be saturated. Finally, we illustrate our results using an example.
We have investigated the problem of discriminating between nonorthogonal quantum states with least probability of error. We have determined that the best strategy for some sets of states is to make no measurement at all, and simply to always assign the most commonly occurring state. Conditions which describe such sets of states have been derived.
The problem of quantum state discrimination between two wave functions of a particle in a square well potential is considered. The optimal minimum-error probability for the state discrimination is known to be given by the Helstrom bound. A new strategy is introduced here whereby the square well is compressed isoenergetically, modifying the wave-functions. The new contracted chamber is then probed using the conventional optimal strategy, and the error probability is calculated. It is shown that in some cases the Helstrom bound can be violated, i.e. the state discrimination can be realized with …
Error probability is a popular and well-studied optimization criterion in discriminating non-orthogonal quantum states. It captures the threat from an adversary who can only query the actual state once. However, when the adversary is able to use a brute-force strategy to query the state, discrimination measurement with minimum error probability does not necessarily minimize the number of queries to get the actual state. In light of this, we take Massey's guesswork as the underlying optimization criterion and study the problem of minimum guesswork discrimination. We show that this problem can b…
This paper introduces coherent quantum channel discrimination as a coherent version of conventional quantum channel discrimination. Coherent channel discrimination is phrased here as a quantum interactive proof system between a verifier and a prover, wherein the goal of the prover is to distinguish two channels called in superposition in order to distill a Bell state at the end. The key measure considered here is the success probability of distilling a Bell state, and I prove that this success probability does not increase under the action of a quantum superchannel, thus establishing this meas…
We investigate generalized measurements, based on positive-operator-valued measures, and von Neumann measurements for the unambiguous discrimination of two mixed quantum states that occur with given prior probabilities. In particular, we derive the conditions under which the failure probability of the measurement can reach its absolute lower bound, proportional to the fidelity of the states. The optimum measurement strategy yielding the fidelity bound of the failure probability is explicitly determined for a number of cases. One example involves two density operators of rank d that jointly spa…