Abstract
Quantum state discrimination of coherent states has been one of important problems in quantum information processing. Recently, R. Han et al. showed that minimum error discrimination of two coherent states can be nearly done by using Jaynes-Cummings Hamiltonian. In this paper, based on the result of R. Han et al., we propose the methods where minimum error discrimination of more than two weak coherent states can be nearly performed. Specially, we construct models which can do almost minimum error discrimination of three and four coherent states. Our result can be applied to quantum information processing of various coherent states.
Highlights
Quantum system comprising of non-orthogonal quantum states cannot be perfectly discriminated
We prove that by applying Tavis-Cummings Hamiltonian, which has an interaction between coherent states and two-level atoms, the Helstrom bound can be nearly obtained in minimum error discrimination of four phase shift keying (PSK) signals with identical prior probabilities[58,59]
It was shown that the minimum error discrimination could be performed by Neumark formalism, instead of projective measurement
Summary
Quantum system comprising of non-orthogonal quantum states cannot be perfectly discriminated. We show that by using three-level atom of ladder configuration, the error bound of minimum error discrimination for three-phase shift keying (PSK) signals or three amplitude shift keying (ASK) signals with identical prior probabilities can nearly reach the Helstrom bound. It is because the extracted information from the measurement strategy based on the ladder configuration reaches nearly one It implies that Bob can extract almost every information of Alice’s quantum state by measuring the atom. We prove that by applying Tavis-Cummings Hamiltonian, which has an interaction between coherent states and two-level atoms, the Helstrom bound can be nearly obtained in minimum error discrimination of four PSK signals with identical prior probabilities[58,59]
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
