{'fraction_non_alphanumeric': 0.03813155386081983, 'fraction_numerical': 0.002859866539561487, 'mean_word_length': 4.769230769230769, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Numerical assessment for accuracy and GPU acceleration of TD-DMRG time evolution schemes.

The time dependent density matrix renormalization group (TD-DMRG) has become one of the cutting edge methods of quantum dynamics for complex systems. In this paper, we comparatively study the accuracy of three time evolution schemes in the TD-DMRG, the global propagation and compression method with the Runge-Kutta algorithm (P&C-RK), the time dependent variational principle based methods with the matrix unfolding algorithm (TDVP-MU), and with the projector-splitting algorithm (TDVP-PS), by performing benchmarks on the exciton dynamics of the Fenna-Matthews-Olson complex. We show that TDVP-MU and TDVP-PS yield the same result when the time step size is converged and they are more accurate than P&C-RK4, while TDVP-PS tolerates a larger time step size than TDVP-MU. We further adopt the graphical processing units to accelerate the heavy tensor contractions in the TD-DMRG, and it is able to speed up the TDVP-MU and TDVP-PS schemes by up to 73 times.