Abstract
Existing optimal control methods of open quantum systems rely on extensive numerical simulations of the dynamics in the presence of a bath, or alternatively ignore the exact bath dynamics. If the bath effects are to be treated properly on both Markovian and non-Markovian timescales using numerical simulations, the number of bath modes cannot be large. This may affect the ability to simulate realistic scenarios. Even if realistic, such simulations are hard to interpret physically. An alternative approach advocated here is to resort to a perturbative analysis provided the system–bath coupling is weak. This analysis would allow for the effects of any given bath (finite or infinite, Markovian or non-Markovian) and any control at our disposal. This poses the challenge of constructing a method for the optimization of various operations requiring proper manipulation of the system, based on a general perturbative treatment to second order in the system–bath coupling. This proposed treatment yields a universal tool for optimizing the fidelity of a given operation. It involves a fidelity-control matrix: a construct that allows us to prioritize the use of available control resources so as to maximize the operation fidelity in any given bath. As an analytically solvable example of this general method, we analyse quantum state-transfer optimization, from a ‘noisy’ (write-in) qubit to its ‘quiet’ counterpart (storage qubit). Intriguing interplay is revealed between our ability to avoid bath-induced errors that profoundly depend on the bath-memory time and the limitations imposed by leakage out of the operational subspace. Counterintuitively, under no circumstances is the fastest transfer optimal (for a given transfer energy).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Physics B: Atomic, Molecular and Optical Physics
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.