Minimum error discrimination problem for pure qubit states

Abstract

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.

English is corrected thanks to PRA editor

References in corpus (1)

• On the conditions for discrimination between quantum states with minimum error

Cited by in corpus (14)

• Quantum state discrimination and its applications
• Complete analysis for three-qubit mixed-state discrimination
• Qubit State Discrimination
• Optimal measurements for the discrimination of quantum states with a fixed rate of inconclusive results
• Optimal discrimination of single-qubit mixed states
• An optimal discrimination of two mixed qubit states with a fixed rate of inconclusive results
• The minimum-error discrimination via Helstrom family of ensembles and Convex Optimization
• Discrimination with an error margin among three symmetric states of a qubit
• Geometric Bloch Vector Solution to Minimum Error Discriminations of Mixed Qubit States
• Distinguishability times and asymmetry monotone-based quantum speed limits in the Bloch ball
• Qubit State Discrimination using Post-measurement Information
• $\mathcal{P}\mathcal{T}$-symmetric mapping of three states and its implementation on a cloud quantum processor
• Complete analysis to minimum-error discrimination of mixed four qubit states with arbitrary prior probabilities
• Minimum-error discrimination between two sets of similarity-transformed quantum states