We obtain a tight bound on the measurement which discriminates without error between two nonorthogonal states. The derivation is based on the no-signaling condition, without any reference to generalized measurements.
The minimum error probability for distinguishing between two quantum states is bounded by the Helstrom limit, derived under the assumption that measurement strategies are restricted to positive operator-valued measurements. We explore scenarios in which the error probability for discriminating two quantum states can be reduced below the Helstrom bound under some constrained access of resources, indicating the use of measurement operations that go beyond the standard positive operator-valued measurements framework. We refer to such measurements as non-positive operator-valued measurements. While existing literature often associates these measurements with initial entanglement between the system and an auxiliary, followed by joint projective measurement and discarding the auxiliary, we demonstrate that initial entanglement between system and auxiliary is not necessary for the emergence of such measurements in the context of state discrimination. Interestingly, even initial product states can give rise to effective non-positive measurements on the subsystem, and achieve sub-Helstrom discrimination error when discriminating quantum states of the subsystem.
Research in nonorthogonal-state discrimination has given rise to two conventional optimal strategies: unambiguous discrimination (UD) and minimum error discrimination. We explore the experimentally relevant range of measurement strategies between the two, where the rate of inconclusive results is minimized for a bounded-error rate. We first provide some constraints on the problem that apply to generalized measurements [positive-operator-valued measurements (POVMs)]. We then provide the theory for the optimal projective measurement in this range. Through analytical and numerical results we investigate this family of projective, bounded-error strategies and compare it to the POVM family as well as to experimental implementation of UD using POVMs. We also discuss a possible application of these bounded-error strategies to quantum key distribution.