Coarse-graining master equation for periodically driven systems

TL;DR

This paper investigates how different temporal coarse-graining methods affect the derivation of Lindblad generators in periodically driven open quantum systems, highlighting the trade-off between accuracy and computational complexity.

Contribution

It introduces and compares various coarse-graining schemes, demonstrating that dynamically adapted coarse-graining improves the approximation of non-Markovian dynamics.

Findings

Dynamically adapted coarse-graining yields the most accurate results.

Non-Markovian dynamics can be effectively approximated by interpolating Markovian solutions.

Trade-off identified between accuracy and computational cost.

Abstract

We analyze Lindblad-Gorini-Kossakowski-Sudarshan-type generators for selected periodically driven open quantum systems. All these generators can be obtained by temporal coarse-graining procedures, and we compare different coarse-graining schemes. Similar as for undriven systems, we find that a dynamically adapted coarse-graining time, effectively yielding non-Markovian dynamics by interpolating through a series of different but invididually Markovian solutions, gives the best results among the different coarse-graining schemes, albeit at highest computational cost.