Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:cond-mat/0612480

Least Action Principle for the Real-Time Density Matrix Renormalization Group

Kouji Ueda, Chenglong Jin, Naokazu Shibata, Yasuhiro Hieida, Tomotoshi Nishino

Published Dec 19, 2006• 12 citations
arXivHTMLPDF

Abstract

A kind of least action principle is introduced for the discrete time evolution of one-dimensional quantum lattice models. Based on this principle, we obtain an optimal condition for the matrix product states on succeeding time slices generated by the real-time density matrix renormalization group method. This optimization can also be applied to classical simulations of quantum circuits. We discuss the time reversal symmetry in the fully optimized MPS.

DOI
10.48550/arxiv.cond-mat/0612480

Related papers

Unifying time evolution and optimization with matrix product states

Jutho Haegeman, Christian Lubich, Ivan Valer'evich Oseledets +2 more

We show that the time-dependent variational principle provides a unifying framework for time-evolution methods and optimization methods in the context of matrix product states. In particular, we introduce a new integration scheme for studying time evolution, which can cope with arbitrary Hamiltonians, including those with long-range interactions. Rather than a Suzuki-Trotter splitting of the Hamiltonian, which is the idea behind the adaptive time-dependent density matrix renormalization group method or time-evolving block decimation, our method is based on splitting the projector onto the matrix product state tangent space as it appears in the Dirac-Frenkel time-dependent variational principle. We discuss how the resulting algorithm resembles the density matrix renormalization group (DMRG) algorithm for finding ground states so closely that it can be implemented by changing just a few lines of code and it inherits the same stability and efficiency. In particular, our method is compatible with any Hamiltonian for which ground-state DMRG can be implemented efficiently. In fact, DMRG is obtained as a special case of our scheme for imaginary time evolution with infinite time step.

arXiv:1408.5056•Physical review. B./Physical review. B•Oct 10, 2016•902 citations

The density-matrix renormalization group: a short introduction

B Y U Lrich S Chollwöck, A Sommerfeld

The density-matrix renormalization group (DMRG) method has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems. The DMRG is a method that shares features of a renormalization group procedure (which here generates a flow in the space of reduced density operators) and of a variational method that operates on a highly interesting class of quantum states, so-called matrix product states (MPSs). The DMRG method is presented here entirely in the MPS language. While the DMRG generally fails in larger two-dimensional systems, the MPS picture suggests a straightforward generalization to higher dimensions in the framework of tensor network states. The resulting algorithms, however, suffer from difficulties absent in one dimension, apart from a much more unfavourable efficiency, such that their ultimate success remains far from clear at the moment.

•Jan 1, 2015•1 citation

The density-matrix renormalization group: a short introduction

Ulrich Schollwöck

The density-matrix renormalization group (DMRG) method has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems. The DMRG is a method that shares features of a renormalization group procedure (which here generates a flow in the space of reduced density operators) and of a variational method that operates on a highly interesting class of quantum states, so-called matrix product states (MPSs). The DMRG method is presented here entirely in the MPS language. While the DMRG generally fails in larger two-dimensional systems, the MPS picture suggests a straightforward generalization to higher dimensions in the framework of tensor network states. The resulting algorithms, however, suffer from difficulties absent in one dimension, apart from a much more unfavourable efficiency, such that their ultimate success remains far from clear at the moment.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Jun 6, 2011•53 citations

Time-dependent Density-Matrix Renormalization-Group Methods

Ulrich Schollwöck

In this paper recent substantial progress in applying the density-matrix renormalization-group (DMRG) to the simulation of the time-evolution of strongly correlated quantum systems in one dimension is reviewed. Various approaches to generating a time-evolution numerically are considered. The key focus of this review is on current strategies to circumvent the limitations of the quite small subspace well approximated by DMRG, by either enlarging or changing it as time evolves. All these approaches can be extended to the simulation of mixed, i.e. finite-temperature states. While this paper is phrased almost entirely in standard DMRG language, I finish by considering the alternative formulation of time-evolutions in the language of matrix product states which is less well-known but conceptually more powerful.

Journal of the Physical Society of Japan•Jan 1, 2005•27 citations

Thouless theorem for matrix product states and subsequent post density matrix renormalization group methods

Sebastian Wouters, Naoki Nakatani, Dimitri Van Neck +1 more

The similarities between Hartree-Fock (HF) theory and the density matrix renormalization group (DMRG) are explored. Both methods can be formulated as the variational optimization of a wave-function Ansatz. Linearization of the time-dependent variational principle near a variational minimum allows to derive the random phase approximation (RPA). We show that the nonredundant parameterization of the matrix product state (MPS) tangent space [J. Haegeman, J. I. Cirac, T. J. Osborne, I. Pi\ifmmode \check{z}\else \v{z}\fi{}orn, H. Verschelde, and F. Verstraete, Phys. Rev. Lett. 107, 070601 (2011)] leads to the Thouless theorem for MPS, i.e., an explicit nonredundant parameterization of the entire MPS manifold, starting from a specific MPS reference. Excitation operators are identified, which extends the analogy between HF and DMRG to the Tamm-Dancoff approximation (TDA), the configuration interaction (CI) expansion, and coupled cluster theory. For a small one-dimensional Hubbard chain, we use a CI-MPS Ansatz with single and double excitations to improve on the ground state and to calculate low-lying excitation energies. For a symmetry-broken ground state of this model, we show that RPA-MPS allows to retrieve the Goldstone mode. We also discuss calculations of the RPA-MPS correlation energy. With the long-range quantum chemical Pariser-Parr-Pople Hamiltonian, low-lying TDA-MPS and RPA-MPS excitation energies for polyenes are obtained.

arXiv:1305.1761•Physical Review B•Aug 12, 2013•50 citations

Parallel time-dependent variational principle algorithm for matrix product states

Paul Secular, Nikita Gourianov, Michael Lubasch +3 more

Combining the time-dependent variational principle (TDVP) algorithm with the parallelization scheme introduced by Stoudenmire and White for the density matrix renormalization group (DMRG), we present the first parallel matrix product state (MPS) algorithm capable of time evolving one-dimensional (1D) quantum lattice systems with long-range interactions. We benchmark the accuracy and performance of the algorithm by simulating quenches in the long-range Ising and XY models. We show that our code scales well up to 32 processes, with parallel efficiencies as high as $86%$. Finally, we calculate the dynamical correlation function of a 201-site Heisenberg XXX spin chain with $1/{r}^{2}$ interactions, which is challenging to compute sequentially. These results pave the way for the application of tensor networks to increasingly complex many-body systems.

arXiv:1912.06127•Physical review. B./Physical review. B•Jun 5, 2020•43 citations
A kind of least action principle is introduced for the discrete time evolution of one-dimensional quantum lattice models. Based on this principle, we obtain an optimal condition for the matrix product states on succeeding time slices generated by the real-time density matrix renormalization group method. This optimization can also be applied to classical simulations of quantum circuits. We discuss the time reversal symmetry in the fully optimized MPS.
We show that the time-dependent variational principle provides a unifying framework for time-evolution methods and optimization methods in the context of matrix product states. In particular, we introduce a new integration scheme for studying time evolution, which can cope with arbitrary Hamiltonians, including those with long-range interactions. Rather than a Suzuki-Trotter splitting of the Hamiltonian, which is the idea behind the adaptive time-dependent density matrix renormalization group method or time-evolving block decimation, our method is based on splitting the projector onto the matrix product state tangent space as it appears in the Dirac-Frenkel time-dependent variational principle. We discuss how the resulting algorithm resembles the density matrix renormalization group (DMRG) algorithm for finding ground states so closely that it can be implemented by changing just a few lines of code and it inherits the same stability and efficiency. In particular, our method is compatible with any Hamiltonian for which ground-state DMRG can be implemented efficiently. In fact, DMRG is obtained as a special case of our scheme for imaginary time evolution with infinite time step.
The density-matrix renormalization group (DMRG) method has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems. The DMRG is a method that shares features of a renormalization group procedure (which here generates a flow in the space of reduced density operators) and of a variational method that operates on a highly interesting class of quantum states, so-called matrix product states (MPSs). The DMRG method is presented here entirely in the MPS language. While the DMRG generally fails in larger two-dimensional systems, the MPS picture suggests a straightforward generalization to higher dimensions in the framework of tensor network states. The resulting algorithms, however, suffer from difficulties absent in one dimension, apart from a much more unfavourable efficiency, such that their ultimate success remains far from clear at the moment.
The density-matrix renormalization group (DMRG) method has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems. The DMRG is a method that shares features of a renormalization group procedure (which here generates a flow in the space of reduced density operators) and of a variational method that operates on a highly interesting class of quantum states, so-called matrix product states (MPSs). The DMRG method is presented here entirely in the MPS language. While the DMRG generally fails in larger two-dimensional systems, the MPS picture suggests a straightforward generalization to higher dimensions in the framework of tensor network states. The resulting algorithms, however, suffer from difficulties absent in one dimension, apart from a much more unfavourable efficiency, such that their ultimate success remains far from clear at the moment.
In this paper recent substantial progress in applying the density-matrix renormalization-group (DMRG) to the simulation of the time-evolution of strongly correlated quantum systems in one dimension is reviewed. Various approaches to generating a time-evolution numerically are considered. The key focus of this review is on current strategies to circumvent the limitations of the quite small subspace well approximated by DMRG, by either enlarging or changing it as time evolves. All these approaches can be extended to the simulation of mixed, i.e. finite-temperature states. While this paper is phrased almost entirely in standard DMRG language, I finish by considering the alternative formulation of time-evolutions in the language of matrix product states which is less well-known but conceptually more powerful.
The similarities between Hartree-Fock (HF) theory and the density matrix renormalization group (DMRG) are explored. Both methods can be formulated as the variational optimization of a wave-function Ansatz. Linearization of the time-dependent variational principle near a variational minimum allows to derive the random phase approximation (RPA). We show that the nonredundant parameterization of the matrix product state (MPS) tangent space [J. Haegeman, J. I. Cirac, T. J. Osborne, I. Pi\ifmmode \check{z}\else \v{z}\fi{}orn, H. Verschelde, and F. Verstraete, Phys. Rev. Lett. 107, 070601 (2011)] leads to the Thouless theorem for MPS, i.e., an explicit nonredundant parameterization of the entire MPS manifold, starting from a specific MPS reference. Excitation operators are identified, which extends the analogy between HF and DMRG to the Tamm-Dancoff approximation (TDA), the configuration interaction (CI) expansion, and coupled cluster theory. For a small one-dimensional Hubbard chain, we use a CI-MPS Ansatz with single and double excitations to improve on the ground state and to calculate low-lying excitation energies. For a symmetry-broken ground state of this model, we show that RPA-MPS allows to retrieve the Goldstone mode. We also discuss calculations of the RPA-MPS correlation energy. With the long-range quantum chemical Pariser-Parr-Pople Hamiltonian, low-lying TDA-MPS and RPA-MPS excitation energies for polyenes are obtained.
Combining the time-dependent variational principle (TDVP) algorithm with the parallelization scheme introduced by Stoudenmire and White for the density matrix renormalization group (DMRG), we present the first parallel matrix product state (MPS) algorithm capable of time evolving one-dimensional (1D) quantum lattice systems with long-range interactions. We benchmark the accuracy and performance of the algorithm by simulating quenches in the long-range Ising and XY models. We show that our code scales well up to 32 processes, with parallel efficiencies as high as 8686%86. Finally, we calculate the dynamical correlation function of a 201-site Heisenberg XXX spin chain with 1/r21/{r}^{2}1/r2 interactions, which is challenging to compute sequentially. These results pave the way for the application of tensor networks to increasingly complex many-body systems.