Preparation And Manipulation Of Quantum States Via The Jaynes-Cummings Model

Quantum information as a newly emerging subject didn't rise in the world until 1994. Though the time is short, a series of important breakthroughs have been gained. Quantum information mainly includes quantum computation and quantum communication. In 1994, Shor presented "quantum parellel algorithm" and proved that once quantum computer was built successfully, it could effectively reveal RSA public secret key system. In 1997, Grover presented "quantum-search algorithm", which could decrypt DES code system. On the other hand, quantum cryptography can in principle offer unwiretapping, undecrypting cryptographic communication system. Furthermore, quantum information can develop a lot of new information functions that classical information doesn't have, such as quantum teleportation, quantum dense coding, etc. Therefore, quantum information will inaugurate a new way for the development of information science. Carriers of quantum information are quantum states, so disposal of quantum information virtually is preparation and manipulation of diversified quantum states. In this thesis, we give a systematic discussion on the problem of preparing and manipulating quantum states via the Jaynes-Cummings model. We propose the schemes, based on the interaction of atoms and cavity fields, for preparing following quantum states: pure Fock state, Schr?dinger cat state, two-mode Schr?dinger cat state, multi-atom entangled states and so on. At the same time, we propose the schemes for teleporting a Fock superposition state, Schr?dinger cat state, single-qubit unknown atomic state, and two-qubit unknown atomic state.