Abstract We introduce a general algebraic approach for qubit state discrimination. The primary challenge in such problems lies in determining the nonzero elements of an optimal positive operator-valued measure (POVM). Our work establishes an explicit algebraic criterion to verify whether an optimal POVM for discriminating arbitrary qubit states contains zero elements. Based on this condition, we propose an exhaustive algorithm to obtain analytical solutions for discriminating any number of mixed qubit states with arbitrary prior probabilities.
Abstract We investigate minimum-error (ME) discrimination for mixed qubit states using a geometric approach. By analyzing positive operator-valued measure (POVM) solutions and introducing Lagrange operator
Γ Γ , we develop a four-step structured instruction to find
Γ Γ for N mixed qubit states. Our method covers optimal solutions for two, three, and four mixed qubit states, including a novel result for four qubit states. We introduce geometric-based POVM classes and non-decomposable subsets for constructing optimal solutions, enabling us to find all possible answers for the general problem of minimum-error discrimination for N mixed qubit states with arbitrary a priori probabilities.
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 states. Specifically, the main technical contributions are described as follows: (1) We derive a new lower bound on the minimum-error probability for ambiguous discrimination among arbitrary
m mixed quantum states with given prior probabilities, and we present a necessary and sufficient condition to show that this lower bound is attainable. (2) We compare this new lower bound with six other bounds in the literature in detail, and, in some cases, this bound is optimal. (3) It is known that if
m=2, the optimal inconclusive probability of unambiguous discrimination
QU and the minimum-error probability of ambiguous discrimination
QE between arbitrary given
m mixed quantum states have the relationship
QU≥2QE. In this paper, we show that, however, if
m>2, the relationship
QU≥2QE may not hold again in general, and there may be no supremum of
QU/QE for more than two states, which may also reflect an essential difference between discrimination for two-states and multi-states. (4) A number of examples are constructed.
We derive a general lower bound on the minimum-error probability for 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 an upper bound on the minimum-error probability for ambiguous discrimination of mixed quantum states. Therefore, some sufficient conditions are obtained for the minimum-error probability attaining this bound. Finally, under the condition of the minimum-error probability attaining this bound, we compare the minimum-error probability for ambiguously discriminating arbitrary
m mixed quantum states with the optimal failure probability for unambiguously discriminating the same states.
In this article, by treating minimum error state discrimination as a complementarity problem, we obtain the geometric optimality conditions. These can be used as the necessary and sufficient conditions to determine whether every optimal measurement operator can be nonzero. Using these conditions and an inductive approach, we demonstrate a geometric method and the intrinsic polytope for
N-qubit mixed-state discrimination. When the intrinsic polytope becomes a point, a line segment, or a triangle, the guessing probability, the necessary and sufficient condition for the exact solution, and the optimal measurement are analytically obtained. We apply this result to the problem of discrimination to arbitrary three-qubit mixed states with given a priori probabilities and obtain the complete analytic solution to the guessing probability and optimal measurement.
Quantum state discrimination is a fundamental task in the field of quantum communication and quantum information theory. Unless the states to be discriminated are mutually orthogonal, there will be some error in any attempt to determine which state was sent. Several strategies to optimally discriminate between quantum states exist, each maximising some figure of merit. In this thesis we mainly investigate the minimum-error strategy, in which the probability of correctly guessing the signal state is maximised. We introduce a method for constructing the optimal Positive-Operator Valued Measure (POVM) for this figure of merit, which is applicable for arbitrary states and arbitrary prior probabilities. We then use this method to solve minimum-error state discrimination for the so-called trine states with arbitrary prior probabilities - the first such general solution for a set of quantum states since the two-state case was solved when the problem of state discrimination was first introduced. We also investigate the difference between local and global measurements for a bipartite ensemble of states, and find that in certain circumstances the local measurement is superior. We conclude by finding a bipartite analogue to the Helstrom conditions, which indicate when a POVM satisfies the minimum-error criteria.