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:2606.02930

Fast Tensor Network Imaginary Time Evolution by Implicit Stepping on Logarithmic Grids

John P. Zima, E. Miles Stoudenmire, Steven R. White, Olivier Parcollet, Jason Kaye

cond-mat.str-elmath.NAquant-phSubmitted Jun 1, 2026• Announced Jun 3, 2026• 3 citations
arXivHTMLPDF

Abstract

We present a new method for the efficient imaginary time evolution of quantum many-body wavefunctions represented by matrix product states (MPS). We first show that logarithmic time grids are sufficient to resolve long imaginary time dynamics, yielding an exponential reduction in the number of time steps compared with standard approaches. We then show that A-stable implicit time-stepping methods for ordinary differential equations allow stable propagation for any time step size. The resulting scheme requires only matrix-vector products and linear solves, standard operations in the MPS toolbox. We validate our approach with two examples: a Heisenberg spin chain, which we use to demonstrate a speedup of several orders of magnitude over the standard time-dependent variational principle method with uniform time steps, and a single-site Anderson impurity model with a metallic bath, for which propagation to large imaginary times allows one to observe the exponential dependence of the Kondo temperature on the interaction strength.

Related papers

Efficient time-evolution of matrix product states using average Hamiltonians

Belal Abouraya, Jirawat Saiphet, Fedor Jelezko +1 more

Simulating quantum many-body systems (QMBS) is one of the long-standing, highly non-trivial challenges in condensed matter physics and quantum information due to the exponentially growing size of the system's Hilbert space. To date, tensor networks have been an essential tool for studying such quantum systems, owing to their ability to efficiently capture the entanglement properties of the systems they represent. One of the well-known tensor network architectures, namely matrix product states (MPS), is the standard method for simulating one-dimensional QMBS. Here, we propose a simple, yet efficient, method to augment the already available MPS algorithms to simulate the dynamics of time-dependent Hamiltonians with better accuracy and a faster convergence rate, giving a second-order convergence compared to the first-order convergence of the standard method. We apply our proposed method to simulate the dynamics of a chain of single spins associated with nitrogen-vacancy color centers in diamonds, which has potential applications for practical and scalable quantum technologies, and find that our method improves the average error for a system of few NV centers by a factor of about 1000 for moderate step sizes. Our work paves the way for efficient simulation of QMBS under the influence of time-dependent Hamiltonians.

quant-pharXiv:2602.04955•Physical Review Research•Feb 6, 2026•0 citations

Exponential Thermal Tensor Network Approach for Quantum Lattice Models

Bin-Bin Chen, Lei Chen, Ziyu Chen +2 more

We speed up thermal simulations of quantum many-body systems in both one-(1D) and twodimensional (2D) models in an exponential way by iteratively projecting the thermal density matrix ρ ¼ e -β Ĥ onto itself.We refer to this scheme of doubling β in each step of the imaginary time evolution as the exponential tensor renormalization group (XTRG).This approach is in stark contrast to conventional Trotter-Suzuki-type methods which evolve ρ on a linear quasicontinuous grid in inverse temperature β ≡ 1=T.As an aside, the large steps in XTRG allow one to swiftly jump across finite-temperature phase transitions, i.e., without the need to resolve each singularly expensive phase-transition point right away, e.g., when interested in low-energy behavior.A fine temperature resolution can be obtained, nevertheless, by using interleaved temperature grids.In general, XTRG can reach low temperatures exponentially fast and, thus, not only saves computational time but also merits better accuracy due to significantly fewer truncation steps.For similar reasons, we also find that the series expansion thermal tensor network approach benefits in both efficiency and precision, from the logarithmic temperature scale setup.We work in an (effective) 1D setting exploiting matrix product operators (MPOs), which allows us to fully and uniquely implement non-Abelian and Abelian symmetries to greatly enhance numerical performance.We use our XTRG machinery to explore the thermal properties of Heisenberg models on 1D chains and 2D square and triangular lattices down to low temperatures approaching ground-state properties.The entanglement properties, as well as the renormalization-group flow of entanglement spectra in MPOs, are discussed, where logarithmic entropies (approximately ln β) are shown in both spin chains and squarelattice models with gapless towers of states.We also reveal that XTRG can be employed to accurately simulate the Heisenberg XXZ model on the square lattice which undergoes a thermal phase transition.We determine its critical temperature based on thermal physical observables, as well as entanglement measures.Overall, we demonstrate that XTRG provides an elegant, versatile, and highly competitive approach to explore thermal properties, including finite-temperature thermal phase transitions as well as the different ordering tendencies at various temperature scales for frustrated systems.

arXiv:1801.00142•Physical Review X•Sep 26, 2018•108 citations

Comparative study of matrix product state/quantized tensor-train algorithms for solving time-independent partial differential equations

Paula García-Molina, Luca Tagliacozzo, Juan José García‐Ripoll

This work presents a comparative study of new and existing optimization and diagonalization methods for solving time-independent partial differential equations (PDEs) using matrix product states (MPS) in the quantized tensor-train formalism (QTT). This study focuses on Hamiltonian equations, for which five algorithms are introduced: explicit imaginary-time evolution methods, steepest gradient descent in conventional and optimized forms, a power method, and an explicitly restarted Arnoldi method. The first five methods are engineered using a framework of limited-precision linear algebra, in which operators -- i.e., the equation itself -- and vectors are represented using matrix product operator (MPO) and matrix product state (MPS) formalisms, and where operator-vector multiplication and vector addition are approximated with limited resources. All methods are benchmarked using an exactly solvable PDE for a quantum harmonic oscillator in one and two dimensions over a regular grid with up to $2^{30}$ points and compared with the density matrix renormalization group (DMRG) method. Our study reveals that all MPS-based techniques exponentially outperform exact diagonalization techniques based on vectors regarding memory usage. Imaginary-time algorithms are shown to underperform any gradient descent in terms of calibration needs and costs. Finally, MPS DMRG and interpolated Arnoldi-like asymptotically outperform all other methods, including state-of-the-art vector-based exact diagonalization, with significant advantages in time and memory use.

arXiv:2303.09430•Mar 16, 2023•13 citations

Bang-bang algorithms for quantum many-body ground states: A tensor network exploration

Ruoshui Wang, Timothy H. Hsieh, Guifré Vidal

We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian $H={H}_{A}+{H}_{B}$ in infinite systems. The first algorithm is a generalization of the quantum approximate optimization algorithm and uses a quantum computer to evolve an initial product state into an approximation of the ground state of $H$ by alternating between ${H}_{A}$ and ${H}_{B}$. We show for the one-dimensional (1D) quantum Ising model that the accuracy in representing a gapped ground state improves exponentially with the number of alternations. The second algorithm is the variational imaginary time ansatz, which uses a classical computer to simulate the ground state via alternating imaginary time steps with ${H}_{A}$ and ${H}_{B}$. We find for the 1D quantum Ising model that an accurate approximation to the ground state is obtained with a total imaginary time $\ensuremath{\tau}$ that grows only logarithmically with the inverse energy gap $1/\mathrm{\ensuremath{\Delta}}$ of $H$. This is much faster than imaginary time evolution by $H$, which would require $\ensuremath{\tau}\ensuremath{\sim}1/\mathrm{\ensuremath{\Delta}}$.

arXiv:2208.00271•Physical review. B./Physical review. B•Nov 17, 2022•5 citations

Grassmann time-evolving matrix product operators for equilibrium quantum impurity problems

Ruofan Chen, Xiansong Xu, Chu Guo

Abstract Tensor-network-based methods are promising candidates to solve quantum impurity problems (QIP). They are free of sampling noises and the sign problem compared to state-of-the-art continuous-time quantum Monte Carlo methods. Recent progress made in tensor-network-based impurity solvers is to use the Feynman–Vernon influence functional to integrate out the bath analytically, retaining only the impurity dynamics and representing it compactly as a matrix product state. The recently proposed Grassmann time-evolving matrix product operator (GTEMPO) method is one of the representative methods in this direction. In this work, we systematically study the performance of GTEMPO in solving equilibrium QIPs at a finite temperature with a semicircular spectrum density of the bath. Our results show that its computational cost would generally increase as the temperature goes down and scale exponentially with the number of orbitals. In particular, the single-orbital Anderson impurity model can be efficiently solved with this method, for two orbitals we estimate that one could possibly reach inverse temperature β ≈ 20 if high-performance computing techniques are utilized, while beyond that only very high-temperature regimes can be reached in the current formalism. Our work paves the way to apply GTEMPO as an imaginary-time impurity solver.

arXiv:2310.09842•New Journal of Physics•Jan 1, 2024•13 citations

Tensor network influence functionals for open quantum systems with general Gaussian bosonic baths

Valentin Link

Dynamics of open quantum systems with structured reservoirs can often be simulated efficiently with tensor network influence functionals. The standard variants of the time-evolving matrix product operator (TEMPO) method are applicable when the systems is coupled to Gaussian bosonic baths via hermitian coupling operators that mutually commute. In this work we introduce a generalization to cases where the system is coupled to a single reservoir through multiple non-commuting operators, representing the most general form of linear system-bath coupling. We construct a Gaussian influence functional that properly handles Trotter errors arising from a finite evolution time step, thus ensuring convergence for long evolution times. Based on this result, the uniform TEMPO scheme can be employed to obtain a matrix product operator form of the influence functional, enabling efficient simulations of the real-time dynamics of the open system. As a demonstration, we simulate the time evolution of driven two-level emitters coupled to a bosonic lattice at different lattice sites.

quant-pharXiv:2603.23432•Mar 25, 2026•5 citations
We present a new method for the efficient imaginary time evolution of quantum many-body wavefunctions represented by matrix product states (MPS). We first show that logarithmic time grids are sufficient to resolve long imaginary time dynamics, yielding an exponential reduction in the number of time steps compared with standard approaches. We then show that A-stable implicit time-stepping methods for ordinary differential equations allow stable propagation for any time step size. The resulting scheme requires only matrix-vector products and linear solves, standard operations in the MPS toolbox. We validate our approach with two examples: a Heisenberg spin chain, which we use to demonstrate a speedup of several orders of magnitude over the standard time-dependent variational principle method with uniform time steps, and a single-site Anderson impurity model with a metallic bath, for which propagation to large imaginary times allows one to observe the exponential dependence of the Kondo temperature on the interaction strength.
Simulating quantum many-body systems (QMBS) is one of the long-standing, highly non-trivial challenges in condensed matter physics and quantum information due to the exponentially growing size of the system's Hilbert space. To date, tensor networks have been an essential tool for studying such quantum systems, owing to their ability to efficiently capture the entanglement properties of the systems they represent. One of the well-known tensor network architectures, namely matrix product states (MPS), is the standard method for simulating one-dimensional QMBS. Here, we propose a simple, yet efficient, method to augment the already available MPS algorithms to simulate the dynamics of time-dependent Hamiltonians with better accuracy and a faster convergence rate, giving a second-order convergence compared to the first-order convergence of the standard method. We apply our proposed method to simulate the dynamics of a chain of single spins associated with nitrogen-vacancy color centers in diamonds, which has potential applications for practical and scalable quantum technologies, and find that our method improves the average error for a system of few NV centers by a factor of about 1000 for moderate step sizes. Our work paves the way for efficient simulation of QMBS under the influence of time-dependent Hamiltonians.
We speed up thermal simulations of quantum many-body systems in both one-(1D) and twodimensional (2D) models in an exponential way by iteratively projecting the thermal density matrix ρ ¼ e -β Ĥ onto itself.We refer to this scheme of doubling β in each step of the imaginary time evolution as the exponential tensor renormalization group (XTRG).This approach is in stark contrast to conventional Trotter-Suzuki-type methods which evolve ρ on a linear quasicontinuous grid in inverse temperature β ≡ 1=T.As an aside, the large steps in XTRG allow one to swiftly jump across finite-temperature phase transitions, i.e., without the need to resolve each singularly expensive phase-transition point right away, e.g., when interested in low-energy behavior.A fine temperature resolution can be obtained, nevertheless, by using interleaved temperature grids.In general, XTRG can reach low temperatures exponentially fast and, thus, not only saves computational time but also merits better accuracy due to significantly fewer truncation steps.For similar reasons, we also find that the series expansion thermal tensor network approach benefits in both efficiency and precision, from the logarithmic temperature scale setup.We work in an (effective) 1D setting exploiting matrix product operators (MPOs), which allows us to fully and uniquely implement non-Abelian and Abelian symmetries to greatly enhance numerical performance.We use our XTRG machinery to explore the thermal properties of Heisenberg models on 1D chains and 2D square and triangular lattices down to low temperatures approaching ground-state properties.The entanglement properties, as well as the renormalization-group flow of entanglement spectra in MPOs, are discussed, where logarithmic entropies (approximately ln β) are shown in both spin chains and squarelattice models with gapless towers of states.We also reveal that XTRG can be employed to accurately simulate the Heisenberg XXZ model on the square lattice which undergoes a thermal phase transition.We determine its critical temperature based on thermal physical observables, as well as entanglement measures.Overall, we demonstrate that XTRG provides an elegant, versatile, and highly competitive approach to explore thermal properties, including finite-temperature thermal phase transitions as well as the different ordering tendencies at various temperature scales for frustrated systems.
This work presents a comparative study of new and existing optimization and diagonalization methods for solving time-independent partial differential equations (PDEs) using matrix product states (MPS) in the quantized tensor-train formalism (QTT). This study focuses on Hamiltonian equations, for which five algorithms are introduced: explicit imaginary-time evolution methods, steepest gradient descent in conventional and optimized forms, a power method, and an explicitly restarted Arnoldi method. The first five methods are engineered using a framework of limited-precision linear algebra, in which operators -- i.e., the equation itself -- and vectors are represented using matrix product operator (MPO) and matrix product state (MPS) formalisms, and where operator-vector multiplication and vector addition are approximated with limited resources. All methods are benchmarked using an exactly solvable PDE for a quantum harmonic oscillator in one and two dimensions over a regular grid with up to 2302^{30}230 points and compared with the density matrix renormalization group (DMRG) method. Our study reveals that all MPS-based techniques exponentially outperform exact diagonalization techniques based on vectors regarding memory usage. Imaginary-time algorithms are shown to underperform any gradient descent in terms of calibration needs and costs. Finally, MPS DMRG and interpolated Arnoldi-like asymptotically outperform all other methods, including state-of-the-art vector-based exact diagonalization, with significant advantages in time and memory use.
We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian H=HA+HBH={H}_{A}+{H}_{B}H=HA​+HB​ in infinite systems. The first algorithm is a generalization of the quantum approximate optimization algorithm and uses a quantum computer to evolve an initial product state into an approximation of the ground state of HHH by alternating between HA{H}_{A}HA​ and HB{H}_{B}HB​. We show for the one-dimensional (1D) quantum Ising model that the accuracy in representing a gapped ground state improves exponentially with the number of alternations. The second algorithm is the variational imaginary time ansatz, which uses a classical computer to simulate the ground state via alternating imaginary time steps with HA{H}_{A}HA​ and HB{H}_{B}HB​. We find for the 1D quantum Ising model that an accurate approximation to the ground state is obtained with a total imaginary time $\ensuremath{\tau}$ that grows only logarithmically with the inverse energy gap $1/\mathrm{\ensuremath{\Delta}}$ of HHH. This is much faster than imaginary time evolution by HHH, which would require $\ensuremath{\tau}\ensuremath{\sim}1/\mathrm{\ensuremath{\Delta}}$.
Abstract Tensor-network-based methods are promising candidates to solve quantum impurity problems (QIP). They are free of sampling noises and the sign problem compared to state-of-the-art continuous-time quantum Monte Carlo methods. Recent progress made in tensor-network-based impurity solvers is to use the Feynman–Vernon influence functional to integrate out the bath analytically, retaining only the impurity dynamics and representing it compactly as a matrix product state. The recently proposed Grassmann time-evolving matrix product operator (GTEMPO) method is one of the representative methods in this direction. In this work, we systematically study the performance of GTEMPO in solving equilibrium QIPs at a finite temperature with a semicircular spectrum density of the bath. Our results show that its computational cost would generally increase as the temperature goes down and scale exponentially with the number of orbitals. In particular, the single-orbital Anderson impurity model can be efficiently solved with this method, for two orbitals we estimate that one could possibly reach inverse temperature β ≈ 20 if high-performance computing techniques are utilized, while beyond that only very high-temperature regimes can be reached in the current formalism. Our work paves the way to apply GTEMPO as an imaginary-time impurity solver.
Dynamics of open quantum systems with structured reservoirs can often be simulated efficiently with tensor network influence functionals. The standard variants of the time-evolving matrix product operator (TEMPO) method are applicable when the systems is coupled to Gaussian bosonic baths via hermitian coupling operators that mutually commute. In this work we introduce a generalization to cases where the system is coupled to a single reservoir through multiple non-commuting operators, representing the most general form of linear system-bath coupling. We construct a Gaussian influence functional that properly handles Trotter errors arising from a finite evolution time step, thus ensuring convergence for long evolution times. Based on this result, the uniform TEMPO scheme can be employed to obtain a matrix product operator form of the influence functional, enabling efficient simulations of the real-time dynamics of the open system. As a demonstration, we simulate the time evolution of driven two-level emitters coupled to a bosonic lattice at different lattice sites.