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.08402 · Physical review. B./Physical review. B

Light cone tensor network and time evolution

Miguel Frías-Pérez, Mari Carmen Bañuls

Published Sep 12, 2022• 41 citations
arXivHTMLPDF

Abstract

The transverse folding algorithm [M. C. Ba\~nuls et al., Phys. Rev. Lett. 102, 240603 (2009)] is a tensor network method to compute time-dependent local observables in out-of-equilibrium quantum spin chains that can overcome the limitations of matrix product states when entanglement grows slower in the time than in the space direction. We present a contraction strategy that makes use of the exact light cone structure of the tensor network representing the observables. The strategy can be combined with the hybrid truncation proposed for global quenches by Hastings and Mahajan Phys. Rev. A 91, 032306 (2015), which significantly improves the efficiency of the method. We demonstrate the performance of this transverse light cone contraction also for transport coefficients, and discuss how it can be extended to other dynamical quantities.

DOI
10.1103/physrevb.106.115117

Related papers

Tensor network techniques for the computation of dynamical observables in one-dimensional quantum spin systems

Alexander Müller‐Hermes, J. I. Cirac, Mari Carmen Bañuls

We analyze the recently developed folding algorithm (Bañuls et al 2009 Phys. Rev. Lett. 102 240603) for simulating the dynamics of infinite quantum spin chains and we relate its performance to the kind of entanglement produced under the evolution of product states. We benchmark the accomplishments of this technique with respect to alternative strategies using Ising Hamiltonians with transverse and parallel fields, as well as XY models. Also, we evaluate its capability of finding ground and thermal equilibrium states.

arXiv:1204.5080•New Journal of Physics•Jul 3, 2012•88 citations

Connecting entanglement in time and space: Improving the folding algorithm

M. B. Hastings, Raghu Mahajan

The ``folding algorithm'' [M. C. Ba\~nuls, M. B. Hastings, F. Verstraete, and J. I. Cirac, Phys. Rev. Lett. 102, 240603 (2009)] is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the temporal entanglement. We show that this temporal entanglement is, in many cases, equal to the spatial entanglement of a modified Hamiltonian. This inspires a modification to the folding algorithm, which we call the ``hybrid algorithm.'' We find that this leads to improved accuracy for the same numerical effort. We then use these algorithms to study relaxation in a transverse plus parallel field Ising model, finding persistent quasiperiodic oscillations for certain choices of initial conditions.

arXiv:1411.7950•Physical Review A•Mar 12, 2015•69 citations

Matrix Product States for Dynamical Simulation of Infinite Chains

Mari Carmen Bañuls, M. B. Hastings, Frank Verstraete +1 more

We propose a new method for computing the ground state properties and the time evolution of infinite chains based on a transverse contraction of the tensor network. The method does not require finite size extrapolation and avoids explicit truncation of the bond dimension along the evolution. By folding the network in the time direction prior to contraction, time-dependent expectation values and dynamic correlation functions can be computed after much longer evolution time than with any previous method. Moreover, the algorithm we propose can be used for the study of some noninvariant infinite chains, including impurity models.

arXiv:0904.1926•Physical Review Letters•Jun 18, 2009•198 citations

On the out-of-equilibrium dynamics with tensor networks

Ramos Marimón, Carlos

[eng] Quantum many-body dynamics is a vast field of physics at the intersection of statistical mechanics, condensed matter, quantum information, and computational physics. Understanding the time evolution of observable correlations—such as those involved in material responses—is both a milestone for technological advancement and a corner-stone for generating fundamental knowledge. At the intersection of emergent collective behavior in many-body systems, quantum physics, and information theory lies the classical simulation of out-of-equilibrium phenomena. Without numerical tools, progress in disciplines that require heavy computations with high-dimensional vectors and matrices would be limited to purely analytical predictions and constrained by the available expertise and resources needed to build benchmarking experiments. The goal of this thesis is to advance the classical simulation of quantum many-body systems using Tensor Networks. This technique has proven fruitful for predicting equilibrium ground states and thermal properties of one-dimensional systems, yet it still faces challenges when applied to out-of-equilibrium scenarios. In brief, the dynamics of experimentally accessible expectation values can be represented as a 2D Tensor Network, which must be contracted using iterative methods such as Time-Evolving Block Decimation. However, the memory and computational time required for these calculations—which reflect the methods’ complexity—are known to grow exponentially with the simulated physical time in generic systems. This limitation is often referred to in the literature as the entanglement barrier. This manuscript tackles the problem through the three inequivalent ways in which the 2D Tensor Network can be contracted. In Chapter 3, we study how Schrödinger-picture contraction from the state edge of the network can be modified to improve the convergence of iterative contraction and reduce truncation errors in small systems. To this end, we explore physical decoherence in optimized bases and artificial generalized decoherence, finding that both alternatives show promise for new protocols that overcome the entanglement barrier. In Chapter 4, we explore Heisenberg-picture contraction from the observable edge, combining the concept of generalized decoherence with Pauli Weight truncation. By thoroughly characterizing the Pauli weight requirements to accurately describe the time evolution of local expectation values from initial product states, we conclude that truncating off-diagonal Pauli Weights is an effective scheme for simulating long-time dynamics—and we successfully implement it. We conclude with a spatial characterization of Pauli Weight spreading, bridging Tensor Network simulations and the field of operator hydrodynamics. Finally, in Chapter 5, we focus on the transverse contraction of the 2D Tensor Net-work using the light-cone algorithm, analyzing its variants in terms of truncation strategies and convergence across different models. This leads to a systematic characterization of the method based on the integrability of the underlying Hamiltonians and single-spin noise models.

•Sep 10, 2025•0 citations

Light-cone matrix product

M. B. Hastings

We show how to combine the light-cone and matrix product algorithms to simulate quantum systems far from equilibrium for long times. For the case of the XXZ spin chain at Δ=0.5, we simulate to a time of ≈22.5. While part of the long simulation time is due to the use of the light-cone method, we also describe a modification of the infinite time-evolving bond decimation algorithm with improved numerical stability, and we describe how to incorporate symmetry into this algorithm. While statistical sampling error means that we are not yet able to make a definite statement, the behavior of the simulation at long times indicates the appearance of either “revivals” in the order parameter as predicted by Hastings and Levitov (e-print arXiv:0806.4283) or of a distinct shoulder in the decay of the order parameter.

arXiv:0903.3253•Journal of Mathematical Physics•Jun 11, 2009•55 citations

Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm

Tobias V. Bauer, Richard M. Milbradt, Christian B. Mendl

We develop a novel time-evolution algorithm for matrix product states based on the recently introduced hybrid tensor network (hTN) framework. We retain the tensors close to the boundary on the classical computer and offload the highly entangled inner ones to the quantum computer. In our variant, we employ the Basis Update and Galerkin (BUG) integrator to time-evolve the classical tensors, and we develop a coupling scheme between the classical and quantum parts. Our framework admits modular combination with any quantum time-evolution method, such as (classically pre-optimized) Trotterization. The ratio of classical and quantum tensor degrees of freedom can be dynamically adjusted during the time evolution, which can be advantageous when the classical memory requirements become prohibitive. The quantum and classical components can run in parallel during a single time step and are not constrained by synchronization barriers or mid-circuit measurements. We describe the detailed steps and pseudocode for our algorithm specialized for tensor networks originating from the matrix product state Ansatz.

quant-pharXiv:2606.28169•Jun 29, 2026•2 citations
The transverse folding algorithm [M. C. Ba~nuls et al., Phys. Rev. Lett. 102, 240603 (2009)] is a tensor network method to compute time-dependent local observables in out-of-equilibrium quantum spin chains that can overcome the limitations of matrix product states when entanglement grows slower in the time than in the space direction. We present a contraction strategy that makes use of the exact light cone structure of the tensor network representing the observables. The strategy can be combined with the hybrid truncation proposed for global quenches by Hastings and Mahajan Phys. Rev. A 91, 032306 (2015), which significantly improves the efficiency of the method. We demonstrate the performance of this transverse light cone contraction also for transport coefficients, and discuss how it can be extended to other dynamical quantities.
We analyze the recently developed folding algorithm (Bañuls et al 2009 Phys. Rev. Lett. 102 240603) for simulating the dynamics of infinite quantum spin chains and we relate its performance to the kind of entanglement produced under the evolution of product states. We benchmark the accomplishments of this technique with respect to alternative strategies using Ising Hamiltonians with transverse and parallel fields, as well as XY models. Also, we evaluate its capability of finding ground and thermal equilibrium states.
The ``folding algorithm'' [M. C. Ba\~nuls, M. B. Hastings, F. Verstraete, and J. I. Cirac, Phys. Rev. Lett. 102, 240603 (2009)] is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the temporal entanglement. We show that this temporal entanglement is, in many cases, equal to the spatial entanglement of a modified Hamiltonian. This inspires a modification to the folding algorithm, which we call the ``hybrid algorithm.'' We find that this leads to improved accuracy for the same numerical effort. We then use these algorithms to study relaxation in a transverse plus parallel field Ising model, finding persistent quasiperiodic oscillations for certain choices of initial conditions.
We propose a new method for computing the ground state properties and the time evolution of infinite chains based on a transverse contraction of the tensor network. The method does not require finite size extrapolation and avoids explicit truncation of the bond dimension along the evolution. By folding the network in the time direction prior to contraction, time-dependent expectation values and dynamic correlation functions can be computed after much longer evolution time than with any previous method. Moreover, the algorithm we propose can be used for the study of some noninvariant infinite chains, including impurity models.
[eng] Quantum many-body dynamics is a vast field of physics at the intersection of statistical mechanics, condensed matter, quantum information, and computational physics. Understanding the time evolution of observable correlations—such as those involved in material responses—is both a milestone for technological advancement and a corner-stone for generating fundamental knowledge. At the intersection of emergent collective behavior in many-body systems, quantum physics, and information theory lies the classical simulation of out-of-equilibrium phenomena. Without numerical tools, progress in disciplines that require heavy computations with high-dimensional vectors and matrices would be limited to purely analytical predictions and constrained by the available expertise and resources needed to build benchmarking experiments. The goal of this thesis is to advance the classical simulation of quantum many-body systems using Tensor Networks. This technique has proven fruitful for predicting equilibrium ground states and thermal properties of one-dimensional systems, yet it still faces challenges when applied to out-of-equilibrium scenarios. In brief, the dynamics of experimentally accessible expectation values can be represented as a 2D Tensor Network, which must be contracted using iterative methods such as Time-Evolving Block Decimation. However, the memory and computational time required for these calculations—which reflect the methods’ complexity—are known to grow exponentially with the simulated physical time in generic systems. This limitation is often referred to in the literature as the entanglement barrier. This manuscript tackles the problem through the three inequivalent ways in which the 2D Tensor Network can be contracted. In Chapter 3, we study how Schrödinger-picture contraction from the state edge of the network can be modified to improve the convergence of iterative contraction and reduce truncation errors in small systems. To this end, we explore physical decoherence in optimized bases and artificial generalized decoherence, finding that both alternatives show promise for new protocols that overcome the entanglement barrier. In Chapter 4, we explore Heisenberg-picture contraction from the observable edge, combining the concept of generalized decoherence with Pauli Weight truncation. By thoroughly characterizing the Pauli weight requirements to accurately describe the time evolution of local expectation values from initial product states, we conclude that truncating off-diagonal Pauli Weights is an effective scheme for simulating long-time dynamics—and we successfully implement it. We conclude with a spatial characterization of Pauli Weight spreading, bridging Tensor Network simulations and the field of operator hydrodynamics. Finally, in Chapter 5, we focus on the transverse contraction of the 2D Tensor Net-work using the light-cone algorithm, analyzing its variants in terms of truncation strategies and convergence across different models. This leads to a systematic characterization of the method based on the integrability of the underlying Hamiltonians and single-spin noise models.
We show how to combine the light-cone and matrix product algorithms to simulate quantum systems far from equilibrium for long times. For the case of the XXZ spin chain at Δ=0.5, we simulate to a time of ≈22.5. While part of the long simulation time is due to the use of the light-cone method, we also describe a modification of the infinite time-evolving bond decimation algorithm with improved numerical stability, and we describe how to incorporate symmetry into this algorithm. While statistical sampling error means that we are not yet able to make a definite statement, the behavior of the simulation at long times indicates the appearance of either “revivals” in the order parameter as predicted by Hastings and Levitov (e-print arXiv:0806.4283) or of a distinct shoulder in the decay of the order parameter.
We develop a novel time-evolution algorithm for matrix product states based on the recently introduced hybrid tensor network (hTN) framework. We retain the tensors close to the boundary on the classical computer and offload the highly entangled inner ones to the quantum computer. In our variant, we employ the Basis Update and Galerkin (BUG) integrator to time-evolve the classical tensors, and we develop a coupling scheme between the classical and quantum parts. Our framework admits modular combination with any quantum time-evolution method, such as (classically pre-optimized) Trotterization. The ratio of classical and quantum tensor degrees of freedom can be dynamically adjusted during the time evolution, which can be advantageous when the classical memory requirements become prohibitive. The quantum and classical components can run in parallel during a single time step and are not constrained by synchronization barriers or mid-circuit measurements. We describe the detailed steps and pseudocode for our algorithm specialized for tensor networks originating from the matrix product state Ansatz.