ﻻ يوجد ملخص باللغة العربية
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.
Strategies to optimally discriminate between quantum states are critical in quantum technologies. We present an experimental demonstration of minimum error discrimination between entangled states, encoded in the polarization of pairs of photons. Alth
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 s
We introduce a set of Bell inequalities for a three-qubit system. Each inequality within this set is violated by all generalized GHZ states. More entangled a generalized GHZ state is, more will be the violation. This establishes a relation between no
We introduce an inductive $n$-qubit pure-state estimation method. This is based on projective measurements on states of $2n+1$ separable bases or $2$ entangled bases plus the computational basis. Thus, the total number of measurement bases scales as
For the optimal success probability under minimum-error discrimination between $rgeq2$ arbitrary quantum states prepared with any a priori probabilities, we find new general analytical lower and upper bounds and specify the relations between these ne