2000 character limit reached
Lowering Helstrom Bound with non-standard coherent states
Published 1 Oct 2020 in quant-ph | (2010.00171v1)
Abstract: 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 and compare quantum limits for states which generalize the Glauber-Sudarshan coherent states, like non-linear, 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.