Reweighted Time-Evolving Block Decimation for Improved Quantum Dynamics Simulations
Sayak Guha Roy, Kevin Slagle

TL;DR
The paper proposes a reweighted TEBD algorithm that improves quantum dynamics simulations by prioritizing low-weight expectation values, leading to higher accuracy and better conservation of quantities.
Contribution
It introduces a reweighted TEBD method that enhances the accuracy of MPDO simulations by focusing on important low-weight expectation values during truncation.
Findings
rTEBD outperforms standard TEBD in accuracy for MPDO simulations.
rTEBD better preserves conserved quantities during evolution.
The method is sometimes superior to TEBD using MPS.
Abstract
We introduce a simple yet significant improvement to the time-evolving block decimation (TEBD) tensor network algorithm for simulating the time dynamics of strongly correlated one-dimensional (1D) mixed quantum states. The efficiency of 1D tensor network methods stems from using a product of matrices to express either: the coefficients of a wavefunction, yielding a matrix product state (MPS); or the expectation values of a density matrix, yielding a matrix product density operator (MPDO). To avoid exponential computational costs, TEBD truncates the matrix dimension while simulating the time evolution. However, when truncating an MPDO, TEBD does not favor the likely more important low-weight expectation values, such as , over the exponentially many high-weight expectation values, such as of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Reservoir Computing · Quantum chaos and dynamical systems · Blind Source Separation Techniques
