2000 character limit reached
The Helstrom Bound (1603.04774v6)
Published 15 Mar 2016 in quant-ph
Abstract: Quantum state discrimination between two wave functions on a ring is considered. The optimal minimum-error probability is known to be given by the Helstrom bound. A new strategy is introduced by inserting instantaneously two impenetrable barriers dividing the ring into two chambers. In the process, the candidate wave functions, as the insertion points become nodes, get entangled with the barriers and can, if judiciously chosen, be distinguished with smaller error probability. As a consequence, the Helstrom bound under idealised conditions can be violated.
Sponsor
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.