Issue |
EPL
Volume 116, Number 6, December 2016
|
|
---|---|---|
Article Number | 60014 | |
Number of page(s) | 6 | |
Section | General | |
DOI | https://doi.org/10.1209/0295-5075/116/60014 | |
Published online | 16 February 2017 |
High-fidelity superadiabatic population transfer of a two-level system with a linearly chirped Gaussian pulse
1 Laboratory of Computational Physics, Institute of Applied Physics and Computational Mathematics Beijing 100088, China
2 College of Physics and Electronic Engineering, Northwest Normal University - Lanzhou 730070, China
3 HEDPS, CAPT, and CICIFSA MoE, Peking University - Beijing 100871, China
(a) lbfu@iapcm.ac.cn
Received: 11 December 2016
Accepted: 23 January 2017
We investigate high-fidelity superadiabatic quantum driving in a chirped Gaussian two-level model with a Gaussian temporal envelope and a linear detuning. We show that the nonadiabatic losses can be canceled to any desired order by constructing and adjusting an auxiliary Hamiltonian (counter-diabatic field) and a symmetry in the fidelity arises on the counter-diabatic field ratio. A high-fidelity, robust, and accelerated (in a shorter time) transitionless superadiabatic population transfer is achieved that ensures a perfect following of the instantaneous adiabatic ground state even in the nonadiabatic regime. The features make the superadiabatic protocol a potentially important tool for quantum information.
PACS: 03.65.Xp – Tunneling, traversal time, quantum Zeno dynamics / 32.80.Qk – Coherent control of atomic interactions with photons / 42.50.Dv – Quantum state engineering and measurements
© EPLA, 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.