Answers are grounded in this paper and cite their sources.
Simulating quantum many-body systems (QMBS) is one of the long-standing, highly nontrivial challenges in condensed matter physics and quantum information due to the exponentially growing size of the system's Hilbert space. To date, tensor networks have been an essential tool for studying such quantum systems, owing to their ability to efficiently capture the entanglement properties of the systems they represent. One of the well-known tensor network architectures, namely, matrix product states (MPS), is the standard method for simulating one-dimensional QMBS. Here, we propose a simple, yet efficient, method to augment the already available MPS algorithms to simulate the dynamics of time-dependent Hamiltonians with better accuracy and a faster convergence rate, giving a second-order convergence compared to the first-order convergence of the Riemann method available in standard software packages. We apply our proposed method to simulate the dynamics of a chain of single spins associated with nitrogen-vacancy (NV) color centers in diamond, which has potential applications for practical and scalable quantum technologies, and find that our method improves the average error for a system of a few NV centers by a factor of about 1000 for moderate step sizes. Additionally, we compare our method to the midpoint rule, which has second-order convergence as well, and show some of the trade-offs between the two methods. Our work paves the way for efficient simulation of QMBS under the influence of time-dependent Hamiltonians.
No takes yet. Share an insight, caveat, or question.
Abouraya et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: