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:2201.04107 · The Journal of Chemical Physics

Computing time-periodic steady-state currents via the time evolution of tensor network states

Nils E. Strand, Hadrien Vroylandt, Todd R. Gingrich

Published Jul 5, 2022• 10 citations
arXivHTMLPDF

Abstract

We present an approach based upon binary tree tensor network (BTTN) states for computing steady-state current statistics for a many-particle 1D ratchet subject to volume exclusion interactions. The ratcheted particles, which move on a lattice with periodic boundary conditions subject to a time-periodic drive, can be stochastically evolved in time to sample representative trajectories via a Gillespie method. In lieu of generating realizations of trajectories, a BTTN state can variationally approximate a distribution over the vast number of many-body configurations. We apply the density matrix renormalization group algorithm to initialize BTTN states, which are then propagated in time via the time-dependent variational principle (TDVP) algorithm to yield the steady-state behavior, including the effects of both typical and rare trajectories. The application of the methods to ratchet currents is highlighted, but the approach extends naturally to other interacting lattice models with time-dependent driving. Although trajectory sampling is conceptually and computationally simpler, we discuss situations for which the BTTN TDVP strategy can be beneficial.

DOI
10.1063/5.0099741

Related papers

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

Studying dynamics in two-dimensional quantum lattices using tree tensor network states

Benedikt Kloss, David R. Reichman, Yevgeny Bar Lev

We analyze and discuss convergence properties of a numerically exact algorithm tailored to study the dynamics of interacting two-dimensional lattice systems. The method is based on the application of the time-dependent variational principle in a manifold of binary and quaternary Tree Tensor Network States. The approach is found to be competitive with existing matrix product state approaches. We discuss issues related to the convergence of the method, which could be relevant to a broader set of numerical techniques used for the study of two-dimensional systems.

arXiv:2003.08944•SciPost Physics•Nov 11, 2020•42 citations

Time dependent variational principle for tree Tensor Networks

Daniel Bauernfeind, Markus Aichhorn

We present a generalization of the Time Dependent Variational Principle (TDVP) to any finite sized loop-free tensor network. The major advantage of TDVP is that it can be employed as long as a representation of the Hamiltonian in the same tensor network structure that encodes the state is available. Often, such a representation can be found also for long-range terms in the Hamiltonian. As an application we use TDVP for the Fork Tensor Product States tensor network for multi-orbital Anderson impurity models. We demonstrate that TDVP allows to account for off-diagonal hybridizations in the bath which are relevant when spin-orbit coupling effects are important, or when distortions of the crystal lattice are present.

arXiv:1908.03090•SciPost Physics•Feb 7, 2020•73 citations

Tensor-network approaches to counting statistics for the current in a boundary-driven diffusive system

Jiayin Gu, Fan Zhang

Abstract We apply tensor networks to counting statistics for the stochastic particle transport in an out-of-equilibrium diffusive system. This system is composed of a one-dimensional channel in contact with two particle reservoirs at the ends. Two tensor-network algorithms, namely, density matrix renormalization group and time evolving block decimation, are respectively implemented. The cumulant generating function for the current is numerically calculated and then compared with the analytical solution. Excellent agreement is found, manifesting the validity of these approaches in such an application. Moreover, the fluctuation theorem for the current is shown to hold.

arXiv:2206.05322•New Journal of Physics•Nov 1, 2022•6 citations

Efficient MPO Construction for Long-Range Hamiltonians with Periodic Boundary Conditions: Application to Many-Body Dynamics

Xin Wang, Bo Xiong

Matrix product operator (MPO) serves as a fundamental component in tensor network simulations of quantum many-body dynamics. We employ an MPO construction that introduces additional propagation channels to embed both periodic boundary conditions and finite-range couplings directly into an open boundary MPO. We apply this construction within the time-dependent variational principle (TDVP) framework to simulate quench dynamics in a spin-1/2 chain with finite-range interactions, and benchmark the results numerically against the fourth-order Runge-Kutta method, finding excellent agreement for both single-body and two-body observables. The approach offers a practical route for tensor network simulations of many-body dynamics in periodic finite-range systems.

arXiv:2609.21290•Sep 18, 2026•0 citations

Unconstrained tree tensor network: An adaptive gauge picture for enhanced performance

Matthias Gerster, Pietro Silvi, Matteo Rizzi +3 more

We introduce a variational algorithm to simulate quantum many-body states based on a tree tensor network ansatz which releases the isometry constraint usually imposed by the real-space renormalization coarse graining. This additional numerical freedom, combined with the loop-free topology of the tree network, allows one to maximally exploit the internal gauge invariance of tensor networks, ultimately leading to a computationally flexible and efficient algorithm able to treat open and periodic boundary conditions on the same footing. We benchmark the novel approach against the 1D Ising model in transverse field with periodic boundary conditions and discuss the strategy to cope with the broken translational invariance generated by the network structure. We then perform investigations on a state-of-the-art problem, namely, the bilinear-biquadratic model in the transition between dimer and ferromagnetic phases. Our results clearly display an exponentially diverging correlation length and thus support the most recent guesses on the peculiarity of the transition.

arXiv:1406.2666•Physical Review B•Sep 29, 2014•85 citations
We present an approach based upon binary tree tensor network (BTTN) states for computing steady-state current statistics for a many-particle 1D ratchet subject to volume exclusion interactions. The ratcheted particles, which move on a lattice with periodic boundary conditions subject to a time-periodic drive, can be stochastically evolved in time to sample representative trajectories via a Gillespie method. In lieu of generating realizations of trajectories, a BTTN state can variationally approximate a distribution over the vast number of many-body configurations. We apply the density matrix renormalization group algorithm to initialize BTTN states, which are then propagated in time via the time-dependent variational principle (TDVP) algorithm to yield the steady-state behavior, including the effects of both typical and rare trajectories. The application of the methods to ratchet currents is highlighted, but the approach extends naturally to other interacting lattice models with time-dependent driving. Although trajectory sampling is conceptually and computationally simpler, we discuss situations for which the BTTN TDVP strategy can be beneficial.
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.
We analyze and discuss convergence properties of a numerically exact algorithm tailored to study the dynamics of interacting two-dimensional lattice systems. The method is based on the application of the time-dependent variational principle in a manifold of binary and quaternary Tree Tensor Network States. The approach is found to be competitive with existing matrix product state approaches. We discuss issues related to the convergence of the method, which could be relevant to a broader set of numerical techniques used for the study of two-dimensional systems.
We present a generalization of the Time Dependent Variational Principle (TDVP) to any finite sized loop-free tensor network. The major advantage of TDVP is that it can be employed as long as a representation of the Hamiltonian in the same tensor network structure that encodes the state is available. Often, such a representation can be found also for long-range terms in the Hamiltonian. As an application we use TDVP for the Fork Tensor Product States tensor network for multi-orbital Anderson impurity models. We demonstrate that TDVP allows to account for off-diagonal hybridizations in the bath which are relevant when spin-orbit coupling effects are important, or when distortions of the crystal lattice are present.
Abstract We apply tensor networks to counting statistics for the stochastic particle transport in an out-of-equilibrium diffusive system. This system is composed of a one-dimensional channel in contact with two particle reservoirs at the ends. Two tensor-network algorithms, namely, density matrix renormalization group and time evolving block decimation, are respectively implemented. The cumulant generating function for the current is numerically calculated and then compared with the analytical solution. Excellent agreement is found, manifesting the validity of these approaches in such an application. Moreover, the fluctuation theorem for the current is shown to hold.
Matrix product operator (MPO) serves as a fundamental component in tensor network simulations of quantum many-body dynamics. We employ an MPO construction that introduces additional propagation channels to embed both periodic boundary conditions and finite-range couplings directly into an open boundary MPO. We apply this construction within the time-dependent variational principle (TDVP) framework to simulate quench dynamics in a spin-1/2 chain with finite-range interactions, and benchmark the results numerically against the fourth-order Runge-Kutta method, finding excellent agreement for both single-body and two-body observables. The approach offers a practical route for tensor network simulations of many-body dynamics in periodic finite-range systems.
We introduce a variational algorithm to simulate quantum many-body states based on a tree tensor network ansatz which releases the isometry constraint usually imposed by the real-space renormalization coarse graining. This additional numerical freedom, combined with the loop-free topology of the tree network, allows one to maximally exploit the internal gauge invariance of tensor networks, ultimately leading to a computationally flexible and efficient algorithm able to treat open and periodic boundary conditions on the same footing. We benchmark the novel approach against the 1D Ising model in transverse field with periodic boundary conditions and discuss the strategy to cope with the broken translational invariance generated by the network structure. We then perform investigations on a state-of-the-art problem, namely, the bilinear-biquadratic model in the transition between dimer and ferromagnetic phases. Our results clearly display an exponentially diverging correlation length and thus support the most recent guesses on the peculiarity of the transition.