arXiv:2609.18806
Fast Evaluation of the Sixth-Order Time-Convolutionless (TCL6) Master-Equation Generator
Jiahao Chen, Sirui Chen, Dragomir Davidovic
Abstract
Higher-order time-convolutionless (TCL) master equations provide systematic corrections for non-Markovian dynamics in open quantum systems, but their time-ordered integrals become increasingly costly to evaluate. Direct quadrature of the Hadamard-reduced sixth-order (TCL6) generator at all $N_t$ sampled times requires $O(N_t^3)$ operations at fixed system dimension. We derive an exact reduction for a finite-dimensional system coupled through one Hermitian operator to a stationary centered Gaussian bath. By separating operator coefficients from scalar time-dependent spectral densities, the complete TCL6 time series is reduced to cumulative sums and first-order recurrences, one-dimensional causal convolutions, and an exact dyadic recursion for interlocked sums. With the algorithm, evaluating the complete TCL6 time series requires $O(N_t\log^2N_t)$ operations. These reductions enable fast, practical simulations of non-Markovian dynamics involving multiphonon and multiphoton processes in open quantum systems.
AI Summary
The paper addresses the cost of evaluating sixth-order time-convolutionless (TCL6) master-equation generators over long time grids. It considers finite-dimensional systems coupled through one Hermitian operator to a stationary, centered Gaussian bath, with factorized initial states. Starting from an existing Hadamard-reduced expression with two ordered integrals, it separates system coefficients from scalar time sums. Cumulative sums, first-order recurrences, and FFT convolutions evaluate most terms. An exact dyadic recursion handles the remaining “interlocked” sums with overlapping time arguments. At fixed system dimension, the complete $N_t$-sample TCL6 generator requires $O(N_t\log^2N_t)$ operations and $O(N_t)$ working storage, versus $O(N_t^3)$ for direct quadrature. The rearrangement preserves the discretized trapezoidal quadrature. TCL4 evaluation requires $O(N_t\log N_t)$ work. An implementation is released as FastTCL. Numerical checks reproduce direct quadrature to floating-point precision. For a two-level benchmark with $N_t=1024$, complete-generator evaluation takes about $0.6$ seconds versus $2230$ seconds directly. Spin–boson examples reduce RMS discrepancies from finite-resolution TEMPO trajectories by factors of approximately $4.7$ and $3.0$ relative to TCL4. In a structured bath suppressing lower-order on-shell relaxation, the late-time TCL6 three-boson decay rate agrees with an independent transition-matrix calculation to relative difference $2.85\times10^{-6}$. The complexity bounds hold at fixed system dimension; scalar-path counts grow with dimension. Faster evaluation does not remove perturbative truncation limitations: some long-time regimes require resummation. Reductions and complexity bounds beyond sixth order remain unresolved.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.