We show how one can solve the problem of discriminating between qubit states. We use the quantum state discrimination duality theorem and the Bloch sphere representation of qubits, which allows for an easy geometric and analytical representation of the optimal guessing strategies.
Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. 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 to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.
We show a geometric formulation for minimum-error discrimination of qubit states that can be applied to arbitrary sets of qubit states given with arbitrary a priori probabilities. In particular, when qubit states are given with equal a priori probabilities, we provide a systematic way of finding optimal discrimination and the complete solution in a closed form. This generally gives a bound to cases when prior probabilities are unequal. Then it is shown that the guessing probability does not depend on detailed relations among the given states, such as the angles between them, but on a property that can be assigned by the set of given states itself. This also shows how a set of quantum states can be modified such that the guessing probability remains the same. Optimal measurements are also characterized accordingly, and a general method of finding them is provided.
We study the problem of discriminating between non‐orthogonal quantum states with least probability of error. We demonstrate that this problem can be simplified if we solve for the error itself rather than solving directly for the optimal measurement. This method enables us to derive solutions directly and thus make definite statements about the uniqueness of an optimal strategy. This approach immediately leads us to a state‐discrimination analogue of Davies Theorem.In the course of this, a complete solution for distinguishing equally likely pure qubit states is presented.
We consider discrimination of geometrically uniform states, and analytically solve this problem for qubits. For qutrits, we obtain the exact solution to the optimal measurement when the defining unitary matrix for the geometrically uniform states is degenerate. We also show that if the unitary is nondegenerate then the optimal measurement for discriminating geometrically uniform qubits or qutrits can always be expressed as a rank-1 operator, which converts the original discrimination problem into an optimization of a sum of trigonometric functions with two real variables in the case of qutrits. Additionally, a geometrical interpretation of the optimal measurement for discriminating geometrically uniform qubits is given via the Bloch sphere representation.
There are fundamental limits to the accuracy with which one can determine the state of a quantum system. I give an overview of the main approaches to quantum state discrimination. Several strategies exist. In quantum hypothesis testing, a quantum system is prepared in a member of a known, finite set of states, and the aim is to guess which one with the minimum probability of error. Error free discrimination is also sometimes possible, if we allow for the possibility of obtaining inconclusive results. If no prior information about the state is provided, then it is impractical to try to determine it exactly, and it must be estimated instead. In addition to reviewing these various strategies, I describe connections between state discrimination, the manipulation of quantum entanglement and quantum cloning. Recent experimental work is also discussed.
The necessary and sufficient conditions for minimization of the generalized rate error for discriminating among N pure qubit states are reformulated in terms of Bloch vectors representing the states. For the direct optimization problem, an algorithmic solution to these conditions is indicated. A solution to the inverse optimization problem is given. General results are widely illustrated by particular cases of equiprobable states and N=2,3,4 pure qubit states given with different prior probabilities.