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

Chinese Physics B

An optimized infinite time-evolving block decimation algorithm for lattice systems

Junjun Xu

Published Sep 19, 2022• 1 citation
Publisher

Abstract

The infinite time-evolving block decimation algorithm (iTEBD) provides an efficient way to determine the ground state and dynamics of the quantum lattice systems in the thermodynamic limit. In this paper we suggest an optimized way to take the iTEBD calculation, which takes advantage of additional reduced decompositions to speed up the calculation. The numerical calculations show that for a comparable computation time our method provides more accurate results than the traditional iTEBD, especially for lattice systems with large on-site degrees of freedom.

DOI
10.1088/1674-1056/ac92d4

Related papers

Hybrid infinite time-evolving block decimation algorithm for long-range multidimensional quantum many-body systems

Tomohiro Hashizume, Jad C. Halimeh, Ian P. McCulloch

In recent years, the infinite time-evolving block decimation (iTEBD) method has been demonstrated to be one of the most efficient and powerful numerical schemes for time evolution in one-dimensional quantum many-body systems. However, a major shortcoming of the method, along with other state-of-the-art algorithms for many-body dynamics, has been their restriction to one spatial dimension. We present an algorithm based on a hybrid extension of iTEBD where finite blocks of a chain are first locally time evolved before an iTEBD-like method combines these processes globally. This in turn permits simulating the dynamics of many-body systems in spatial dimensions $d\ensuremath{\ge}1$ where the thermodynamic limit is achieved along one spatial dimension and where long-range interactions can also be included. Our work paves the way for simulating the dynamics of many-body phenomena that occur exclusively in higher dimensions and whose numerical treatments have hitherto been limited to exact diagonalization of small systems, which fundamentally limits a proper investigation of dynamical criticality. We expect the algorithm presented here to be of significant importance to validating and guiding investigations in state-of-the-art ion-trap and ultracold-atom experiments.

arXiv:1910.10726•Physical review. B./Physical review. B•Jul 7, 2020•22 citations

Infinite time-evolving block decimation algorithm beyond unitary evolution

Román Orús, Guifré Vidal

The infinite time-evolving block decimation algorithm [G. Vidal, Phys. Rev. Lett. 98, 070201 (2007)] allows to simulate unitary evolution and to compute the ground state of one-dimensional (1D) quantum lattice systems in the thermodynamic limit. Here we extend the algorithm to tackle a much broader class of problems, namely, the simulation of arbitrary one-dimensional evolution operators that can be expressed as a (translationally invariant) tensor network. Relatedly, we also address the problem of finding the dominant eigenvalue and eigenvector of a one-dimensional transfer matrix that can be expressed in the same way. New applications include the simulation, in the thermodynamic limit, of open (i.e., master equation) dynamics and thermal states in 1D quantum systems, as well as calculations with partition functions in two-dimensional (2D) classical systems, on which we elaborate. The present extension of the algorithm also plays a prominent role in the infinite projected entangled-pair states approach to infinite 2D quantum lattice systems.

arXiv:0711.3960•Physical Review B•Oct 14, 2008•466 citations

Determination of ground states of one-dimensional quantum systems using the cluster iTEBD method

Tao Yang, Rui Wang, Z. Y. Xie +1 more

Within the framework of imaginary-time evolution for matrix product states, we introduce a cluster version of the infinite time-evolving block decimation algorithm for simulating quantum many-body systems, addressing the computational accuracy challenges in strongly correlated physics. By redefining the wave-function ansatz to incorporate multiple physical degrees of freedom, we enhance the representation of entanglement, thereby improving the accuracy of the ground states. Utilizing the Trotter-Suzuki decomposition and optimized truncation schemes, our method maintains roughly the same computational complexity while capturing more quantum correlations. We apply this approach to three nontrivial cases: the gapless spin-1/2 Heisenberg chain, the spin-1 anisotropic XXZD chain with a higher-order Gaussian-type phase transition, and a spin-1/2 twisted triangular prism hosting a magnetic plateau phase. Improved accuracy in physical quantities, such as magnetization, ground-state energy, and entanglement entropy, has been demonstrated. This method provides a scalable framework for studying complex quantum systems with high precision, making it suitable for situations where a pure increase in bond dimension alone cannot guarantee satisfactory results.

arXiv:2508.21405•Physical review. B./Physical review. B•Aug 12, 2025•1 citation

Improved scaling of time-evolving block-decimation algorithm through reduced-rank randomized singular value decomposition

Dario Tamascelli, R. Rosenbach, Martin Bodo Plenio

When the amount of entanglement in a quantum system is limited, the relevant dynamics of the system is restricted to a very small part of the state space. When restricted to this subspace the description of the system becomes efficient in the system size. A class of algorithms, exemplified by the time-evolving block-decimation (TEBD) algorithm, make use of this observation by selecting the relevant subspace through a decimation technique relying on the singular value decomposition (SVD). In these algorithms, the complexity of each time-evolution step is dominated by the SVD. Here we show that, by applying a randomized version of the SVD routine (RRSVD), the power law governing the computational complexity of TEBD is lowered by one degree, resulting in a considerable speed-up. We exemplify the potential gains in efficiency at the hand of some real world examples to which TEBD can be successfully applied and demonstrate that for those systems RRSVD delivers results as accurate as state-of-the-art deterministic SVD routines.

arXiv:1504.00992•Physical Review E•Jun 15, 2015•28 citations

Classical Simulation of Infinite-Size Quantum Lattice Systems in Two Spatial Dimensions

Jacob Jordan, Román Orús, Guifré Vidal +2 more

We present an algorithm to simulate two-dimensional quantum lattice systems in the thermodynamic limit. Our approach builds on the projected entangled-pair state algorithm for finite lattice systems [F. Verstraete and J. I. Cirac, arxiv:cond-mat/0407066] and the infinite time-evolving block decimation algorithm for infinite one-dimensional lattice systems [G. Vidal, Phys. Rev. Lett. 98, 070201 (2007)10.1103/PhysRevLett.98.070201]. The present algorithm allows for the computation of the ground state and the simulation of time evolution in infinite two-dimensional systems that are invariant under translations. We demonstrate its performance by obtaining the ground state of the quantum Ising model and analyzing its second order quantum phase transition.

arXiv:cond-mat/0703788•Physical Review Letters•Dec 18, 2008•708 citations

Variational optimization algorithms for uniform matrix product states

Valentin Zauner-Stauber, Laurens Vanderstraeten, Matthew Fishman +2 more

We combine the density matrix renormalization group (DMRG) with matrix product state tangent space concepts to construct a variational algorithm for finding ground states of one-dimensional quantum lattices in the thermodynamic limit. A careful comparison of this variational uniform matrix product state algorithm (VUMPS) with infinite density matrix renormalization group (IDMRG) and with infinite time evolving block decimation (ITEBD) reveals substantial gains in convergence speed and precision. We also demonstrate that VUMPS works very efficiently for Hamiltonians with long-range interactions and also for the simulation of two-dimensional models on infinite cylinders. The new algorithm can be conveniently implemented as an extension of an already existing DMRG implementation.

arXiv:1701.07035•Physical review. B./Physical review. B•Jan 25, 2018•267 citations
The infinite time-evolving block decimation algorithm (iTEBD) provides an efficient way to determine the ground state and dynamics of the quantum lattice systems in the thermodynamic limit. In this paper we suggest an optimized way to take the iTEBD calculation, which takes advantage of additional reduced decompositions to speed up the calculation. The numerical calculations show that for a comparable computation time our method provides more accurate results than the traditional iTEBD, especially for lattice systems with large on-site degrees of freedom.
In recent years, the infinite time-evolving block decimation (iTEBD) method has been demonstrated to be one of the most efficient and powerful numerical schemes for time evolution in one-dimensional quantum many-body systems. However, a major shortcoming of the method, along with other state-of-the-art algorithms for many-body dynamics, has been their restriction to one spatial dimension. We present an algorithm based on a hybrid extension of iTEBD where finite blocks of a chain are first locally time evolved before an iTEBD-like method combines these processes globally. This in turn permits simulating the dynamics of many-body systems in spatial dimensions $d\ensuremath{\ge}1$ where the thermodynamic limit is achieved along one spatial dimension and where long-range interactions can also be included. Our work paves the way for simulating the dynamics of many-body phenomena that occur exclusively in higher dimensions and whose numerical treatments have hitherto been limited to exact diagonalization of small systems, which fundamentally limits a proper investigation of dynamical criticality. We expect the algorithm presented here to be of significant importance to validating and guiding investigations in state-of-the-art ion-trap and ultracold-atom experiments.
The infinite time-evolving block decimation algorithm [G. Vidal, Phys. Rev. Lett. 98, 070201 (2007)] allows to simulate unitary evolution and to compute the ground state of one-dimensional (1D) quantum lattice systems in the thermodynamic limit. Here we extend the algorithm to tackle a much broader class of problems, namely, the simulation of arbitrary one-dimensional evolution operators that can be expressed as a (translationally invariant) tensor network. Relatedly, we also address the problem of finding the dominant eigenvalue and eigenvector of a one-dimensional transfer matrix that can be expressed in the same way. New applications include the simulation, in the thermodynamic limit, of open (i.e., master equation) dynamics and thermal states in 1D quantum systems, as well as calculations with partition functions in two-dimensional (2D) classical systems, on which we elaborate. The present extension of the algorithm also plays a prominent role in the infinite projected entangled-pair states approach to infinite 2D quantum lattice systems.
Within the framework of imaginary-time evolution for matrix product states, we introduce a cluster version of the infinite time-evolving block decimation algorithm for simulating quantum many-body systems, addressing the computational accuracy challenges in strongly correlated physics. By redefining the wave-function ansatz to incorporate multiple physical degrees of freedom, we enhance the representation of entanglement, thereby improving the accuracy of the ground states. Utilizing the Trotter-Suzuki decomposition and optimized truncation schemes, our method maintains roughly the same computational complexity while capturing more quantum correlations. We apply this approach to three nontrivial cases: the gapless spin-1/2 Heisenberg chain, the spin-1 anisotropic XXZD chain with a higher-order Gaussian-type phase transition, and a spin-1/2 twisted triangular prism hosting a magnetic plateau phase. Improved accuracy in physical quantities, such as magnetization, ground-state energy, and entanglement entropy, has been demonstrated. This method provides a scalable framework for studying complex quantum systems with high precision, making it suitable for situations where a pure increase in bond dimension alone cannot guarantee satisfactory results.
When the amount of entanglement in a quantum system is limited, the relevant dynamics of the system is restricted to a very small part of the state space. When restricted to this subspace the description of the system becomes efficient in the system size. A class of algorithms, exemplified by the time-evolving block-decimation (TEBD) algorithm, make use of this observation by selecting the relevant subspace through a decimation technique relying on the singular value decomposition (SVD). In these algorithms, the complexity of each time-evolution step is dominated by the SVD. Here we show that, by applying a randomized version of the SVD routine (RRSVD), the power law governing the computational complexity of TEBD is lowered by one degree, resulting in a considerable speed-up. We exemplify the potential gains in efficiency at the hand of some real world examples to which TEBD can be successfully applied and demonstrate that for those systems RRSVD delivers results as accurate as state-of-the-art deterministic SVD routines.
We present an algorithm to simulate two-dimensional quantum lattice systems in the thermodynamic limit. Our approach builds on the projected entangled-pair state algorithm for finite lattice systems [F. Verstraete and J. I. Cirac, arxiv:cond-mat/0407066] and the infinite time-evolving block decimation algorithm for infinite one-dimensional lattice systems [G. Vidal, Phys. Rev. Lett. 98, 070201 (2007)10.1103/PhysRevLett.98.070201]. The present algorithm allows for the computation of the ground state and the simulation of time evolution in infinite two-dimensional systems that are invariant under translations. We demonstrate its performance by obtaining the ground state of the quantum Ising model and analyzing its second order quantum phase transition.
We combine the density matrix renormalization group (DMRG) with matrix product state tangent space concepts to construct a variational algorithm for finding ground states of one-dimensional quantum lattices in the thermodynamic limit. A careful comparison of this variational uniform matrix product state algorithm (VUMPS) with infinite density matrix renormalization group (IDMRG) and with infinite time evolving block decimation (ITEBD) reveals substantial gains in convergence speed and precision. We also demonstrate that VUMPS works very efficiently for Hamiltonians with long-range interactions and also for the simulation of two-dimensional models on infinite cylinders. The new algorithm can be conveniently implemented as an extension of an already existing DMRG implementation.