Optimal transfer of entanglement in oscillator chains in non-Markovian open systems
Da-Wei Luo, Edward Yu, Ting Yu
TL;DR
The paper addresses transferring continuous-variable entanglement in chains of coupled oscillators subject to non-Markovian environments. It employs Krotov's gradient-based optimization to design control fields that tune oscillator frequencies, and extends the method to non-Markovian dynamics via a time-dependent O-operator derived from the quantum state diffusion framework. Demonstrations on linear and X-shaped chains show high-fidelity entanglement transfer with smooth, experimentally feasible controls, and reveal that memory effects can enhance transfer performance compared to memoryless cases. Importantly, the approach can target a range of initial states and entanglement levels, making it robust to unknown parameters, with practical implications for implementations in superconducting circuits, SQUID arrays, and LC-circuit chains.
Abstract
We considered the transfer of continuous-variable entangled states in coupled oscillator chains embedded in a generic environment. We demonstrate high-fidelity transfer via optimal control in two configurations - a linear chain and an X-shaped chain. More specifically, we use the Krotov optimization algorithm to design control fields that achieve the desired state transfer. Under the environmental memory effects, the Krotov algorithm needs to be modified, since the dissipative terms in non-Markovian dynamics are generally governed by the time-dependent system Hamiltonian. Remarkably, we can achieve high-fidelity transfer by simply tuning the frequencies of the oscillators while keeping the coupling strength constant, even in the presence of open-system effects. For the system under consideration, we find that quantum memory effects can aid in the transfer of entanglement and show improvement over the memoryless case. In addition, it is possible to target a range of entangled states, making it unnecessary to know the parameters of the initial state beforehand.
