Abstract

Laser light is widely used for communication and sensing applications, so the optimal discrimination of coherent states--the quantum states of light emitted by a laser--has immense practical importance. However, quantum mechanics imposes a fundamental limit on how well different coher- ent states can be distinguished, even with perfect detectors, and limits such discrimination to have a finite minimum probability of error. While conventional optical receivers lead to error rates well above this fundamental limit, Dolinar found an explicit receiver design involving optical feedback and photon counting that can achieve the minimum probability of error for discriminating any two given coherent states. The generalization of this construction to larger sets of coherent states has proven to be challenging, evidencing that there may be a limitation inherent to a linear-optics-based adaptive measurement strategy. In this Letter, we show how to achieve optimal discrimination of any set of coherent states using a resource-efficient quantum computer. Our construction leverages a recent result on discriminating multi-copy quantum hypotheses (arXiv:1201.6625) and properties of coherent states. Furthermore, our construction is reusable, composable, and applicable to designing quantum-limited processing of coherent-state signals to optimize any metric of choice. As illustrative examples, we analyze the performance of discriminating a ternary alphabet, and show how the quantum circuit of a receiver designed to discriminate a binary alphabet can be reused in discriminating multimode hypotheses. Finally, we show our result can be used to achieve the quantum limit on the rate of classical information transmission on a lossy optical channel, which is known to exceed the Shannon rate of all conventional optical receivers.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.