Geometric Bloch vector solution to minimum-error discriminations of mixed qubit states

From MaRDI portal



Abstract: We study the problem of Minimum-Error (ME) discrimination for qubit states in detail using a geometric approach. As all POVM answers of the ME problem define a unique operator, the Lagrange Gamma, we start with finding it. For a general problem of N qubit states with arbitrary a priori probabilities pi,hoii=1N, a structured instruction with at most four steps can be employed to find Gamma. So, the optimal solutions of two, three, and four mixed qubit states are necessary. We restate the problem for these cases using our method, including a completely new result of the ME problem of four qubit states. Moreover, we introduce some classes of POVM answers (involving the geometric of the polytope of qubit states inside the Bloch sphere), and the notion of non-decomposable POVM subsets of a given problem which provides us all we need for constructing all optimal answers.











This page was built for publication: Geometric Bloch vector solution to minimum-error discriminations of mixed qubit states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6073992)