Fast Time-Evolution of Matrix-Product States using the QR decomposition

Abstract

We propose and benchmark a modified time evolution block decimation (TEBD) algorithm that uses a truncation scheme based on the QR decomposition instead of the singular value decomposition (SVD). The modification reduces the scaling with the dimension of the physical Hilbert space $d$ from $d^3$ down to $d^2$. Moreover, the QR decomposition has a lower computational complexity than the SVD and allows for highly efficient implementations on GPU hardware. In a benchmark simulation of a global quench in a quantum clock model, we observe a speedup of up to three orders of magnitude comparing QR and SVD based updates on an A100 GPU.

arXiv comment6 pages, 4 figures

References in corpus (40)

• The density-matrix renormalization group in the age of matrix product states
• Entanglement in quantum critical phenomena
• Efficient simulation of one-dimensional quantum many-body systems
• Real time evolution using the density matrix renormalization group
• Time-dependent density-matrix renormalization-group using adaptive effective Hilbert spaces
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• Unbounded growth of entanglement in models of many-body localization
• Probing the relaxation towards equilibrium in an isolated strongly correlated 1D Bose gas
• Classical simulation of infinite-size quantum lattice systems in one spatial dimension
• Time-dependent variational principle for quantum lattices
• Unifying time evolution and optimization with matrix product states
• Time-evolution methods for matrix-product states
• Quench dynamics and non equilibrium phase diagram of the Bose-Hubbard model
• Finite-temperature transport in one-dimensional quantum lattice models
• Time-evolving a matrix product state with long-ranged interactions
• Tensor network states and algorithms in the presence of a global U(1) symmetry
• Tensor network decompositions in the presence of a global symmetry
• Density matrix renormalization group algorithms with a single center site
• Matrix product simulations of non-equilibrium steady states of quantum spin chains
• What limits the simulation of quantum computers?
• A Strictly Single-Site DMRG Algorithm with Subspace Expansion
• Dynamics of the Kitaev-Heisenberg Model
• Dualities and the phase diagram of the $p$-clock model
• Unifying Projected Entangled Pair States contractions
• Time dynamics with matrix product states: Many-body localization transition of large systems revisited
• Numerical Assessment for Accuracy and GPU Acceleration of TD-DMRG Time Evolution Schemes
• Transverse spin dynamics in the anisotropic Heisenberg model realized with ultracold atoms
• Light Cone Matrix Product
• Parallel time-dependent variational principle algorithm for matrix product states
• Energy transport in a disordered spin chain with broken U(1) symmetry: Diffusion, subdiffusion, and many-body localization
• Optimising Matrix Product State Simulations of Shor's Algorithm
• Density Matrix Renormalization Group with Tensor Processing Units
• Hole Spectral Function of a Chiral Spin Liquid in the Triangular Lattice Hubbard Model
• Probing transport and slow relaxation in the mass-imbalanced Fermi-Hubbard model
• Simulation of quantum many-body dynamics with Tensor Processing Units: Floquet prethermalization
• Many-body localization in large systems: Matrix-product-state approach
• Phase transitions in the ${\mathbb{Z}}_p$ and U(1) clock models
• Large Scale Distributed Linear Algebra With Tensor Processing Units
• Spin transport in disordered long-range interacting spin chain
• Projector formalism for kept and discarded spaces of matrix product states

Cited by in corpus (6)

• Beyond-classical computation in quantum simulation
• Correlation Functions From Tensor Network Influence Functionals: The Case of the Spin-Boson Model
• Diagonal Isometric Form for Tensor Network States in Two Dimensions
• Thermal Drude weight in an integrable chiral clock model
• Accelerating two-dimensional tensor network contractions using QR decompositions
• Tensor Network Lattice Boltzmann Method for Data-Compressed Fluid Simulations