In quantum information processing, using a receiver device to differentiate between two nonorthogonal states leads to a quantum error probability. The minimum possible error is known as the Helstrom bound. In this work, we study statistical aspects and quantum limits for states that generalize the Glauber–Sudarshan coherent states, such as nonlinear, Perelomov, Barut–Girardello, and (modified) Susskind–Glogower coherent states. For some of these, we show that the Helstrom bound can be significantly lowered and even vanish in specific regimes.
Part of the difficulties in implementing communication in quantum information stems from the fragility of Schrödinger's cat-like superpositions. A recent experiment in quantum optics by Cook et al (2007 Nature 446 774) has proved the feasibility of a feedback-mediated quantum measurement for discriminating between optical coherent states under photodetection. Minimizing the error in receiver measurement over all possible POVMs leads to the so-called quantum error probability or 'Helstrom bound', and CMG measurements validate the theoretical prediction by Helstrom, Dolinar and Geremia concerning this bound. In this work, we present some preliminary theoretical and numerical explorations concerning the properties of the Helstrom bound in binary (or multibinary) communication involving non-Poissonian or nonlinear coherent states.
A core problem in communications is the optimal discrimination of binary-phase-shift-keyed (BPSK) signals. A longstanding goal has been to reach the fundamental quantum limit, known as the Helstrom bound, for BPSK signals encoded in coherent states. However, due to technical constraints, proposals for reaching the bound remain impractical. In this letter we take an alternative approach: using only Gaussian optics - displaced squeezed states and homodyne detection - we achieve discrimination of BPSK signals with error rates below what can be achieved using coherent states and any quantum measurement.
We investigate advantages and disadvantages of using Gazeau-Klauder coherent states for optical communication. In this short paper we show that using an alphabet consisting of coherent Gazeau-Klauder states related to a Kerr-type nonlinear oscillator instead of standard Perelomov coherent states results in lowering of the Helstrom bound for error probability in binary communication. We also discuss trace distance between Gazeau-Klauder coherent states and a standard coherent state as a quantifier of distinguishability of alphabets.
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.