Paper
1 September 2015 Quasi-Bell entangled coherent states and its quantum discrimination problem in the presence of thermal noise
Author Affiliations +
Abstract
The so-called quasi-Bell entangled coherent states in a thermal environment are studied. In the analysis, we assume thermal noise affects only one of the two modes of each state. First the matrix representation of the density operators of the quasi-Bell entangled coherent states in a thermal environment is derived. Secondly we investigate the entanglement property of one of the quasi-Bell entangled coherent states with thermal noise. At that time a lower bound of the entanglement of formation for the state is computed. Thirdly the minimax discrimination problem for two cases of the binary set of the quasi-Bell entangled coherent states with thermal noise is considered, and the error probabilities of the minimax discrimination for the two cases are computed with the help of Helstrom's algorithm for finding the Bayes optimal error probability of binary states.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kentaro Kato "Quasi-Bell entangled coherent states and its quantum discrimination problem in the presence of thermal noise", Proc. SPIE 9615, Quantum Communications and Quantum Imaging XIII, 96150N (1 September 2015); https://doi.org/10.1117/12.2188103
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Thermal effects

Quantum communications

Phase shift keying

Entangled states

Quantum information

Computer simulations

RELATED CONTENT

Quantum search simulation with Wolfram Mathematica
Proceedings of SPIE (September 28 2016)
Two coupled Jaynes-Cummings cells
Proceedings of SPIE (September 06 2011)
Cavity-QED-based quantum computing
Proceedings of SPIE (August 04 2003)
Simulation of quantum cryptolographic key distribution
Proceedings of SPIE (September 13 2002)

Back to Top