We review different tensor network approaches to study the spreading of operators in generic nonintegrable quantum systems. As a common ground to all methods, we quantify this spreading by means of the Frobenius norm of the commutator of a spreading operator with a local operator, which is usually referred to as the out of time order correlation (OTOC) function. We compare two approaches based on matrix-product states in the Schrodinger picture: the time dependent block decimation (TEBD) and the time dependent variational principle (TDVP), as well as TEBD based on matrix-product operators directly in the Heisenberg picture. The results of all methods are compared to numerically exact results using Krylov space exact time evolution. We find that for the Schrodinger picture the TDVP algorithm performs better than the TEBD algorithm. Moreover the tails of the OTOC are accurately obtained both by TDVP MPS and TEBD MPO. They are in very good agreement with exact results at short times, and appear to be converged in bond dimension even at longer times. However the growth and saturation regimes are not well captured by both methods.
We review different tensor network approaches to study the spreading of operators in generic nonintegrable quantum systems. As a common ground to all methods, we quantify this spreading by means of the Frobenius norm of the commutator of a spreading operator with a local operator, which is usually referred to as the out of time order correlation (OTOC) function. We compare two approaches based on matrix-product states in the Schrodinger picture: the time dependent block decimation (TEBD) and the time dependent variational principle (TDVP), as well as TEBD based on matrix-product operators directly in the Heisenberg picture. The results of all methods are compared to numerically exact results using Krylov space exact time evolution. We find that for the Schrodinger picture the TDVP algorithm performs better than the TEBD algorithm. Moreover the tails of the OTOC are accurately obtained both by TDVP MPS and TEBD MPO. They are in very good agreement with exact results at short times, and appear to be converged in bond dimension even at longer times. However the growth and saturation regimes are not well captured by both methods.
We review different matrix-product-state (MPS) approaches to study the spreading of operators in generic nonintegrable quantum systems. As a common ground to all methods, we quantify this spreading by means of the Frobenius norm of the commutator of a spreading operator with a local operator, which is usually referred to as the out-of-time-order correlation (OTOC) function. We compare two approaches based on matrix-product states in the Schr\"odinger picture: the time-dependent block decimation (TEBD) and the time-dependent variational principle (TDVP), as well as TEBD based on matrix-product operators directly in the Heisenberg picture. The results of all methods are compared to numerically exact results using Krylov space exact time evolution. We find that for the Schr\"odinger picture, the TDVP algorithm performs better than the TEBD algorithm.Moreover, the tails of the OTOC are accurately obtained both by TDVP MPS and TEBD MPO. They are in very good agreement with exact results at short times, and appear to be converged in bond dimensions even at longer times. However, the growth and saturation regimes are not well captured by either of the methods.
Operator spreading under unitary time evolution has attracted a lot of attention recently as a way to probe many-body quantum chaos. While quantities such as out-of-time-ordered correlators (OTOCs) do distinguish interacting from noninteracting systems, it has remained unclear to what extent they can truly diagnose chaotic vs integrable dynamics in many-body quantum systems. Here, we analyze operator spreading in generic one-dimensional many-body quantum systems using a combination of matrix product operator (MPO) and analytical techniques, focusing on the operator right weight. First, we show that while small bond dimension MPOs allow one to capture the exponentially decaying tail of the operator front, in agreement with earlier results, they lead to significant quantitative and qualitative errors for the actual front---defined by the maximum of the right weight. We find that while the operator front broadens diffusively in both integrable and chaotic interacting spin chains, the precise shape and scaling of the height of the front in integrable systems is anomalous for all accessible times. We interpret these results using a quasiparticle picture. This provides a sharp, although rather subtle, signature of many-body quantum chaos in the operator front.
Matrix-product states have become the de facto standard for the representation of one-dimensional quantum many body states. During the last few years, numerous new methods have been introduced to evaluate the time evolution of a matrix-product state. Here, we will review and summarize the recent work on this topic as applied to finite quantum systems. We will explain and compare the different methods available to construct a time-evolved matrix-product state, namely the time-evolving block decimation, the MPO WI,II method, the global Krylov method, the local Krylov method and the one- and two-site time-dependent variational principle. We will also apply these methods to four different representative examples of current problem settings in condensed matter physics.
Abstract Classical simulations of quantum circuits are vital for assessing potential quantum advantage and benchmarking devices, yet they require sophisticated methods to avoid the exponential growth of resources. Tensor network approaches, in particular matrix product states (MPS) combined with the time-evolving block decimation (TEBD) algorithm, currently dominate large-scale circuit simulations. These methods scale efficiently when entanglement is limited but suffer rapid bond dimension growth with increasing entanglement and handle long-range gates via costly SWAP insertions. Motivated by the success of the time-dependent variational principle (TDVP) in many-body physics, we reinterpret quantum circuits as series of discrete time evolutions, using gate generators to construct an MPS-based circuit simulation via a local TDVP formulation. This addresses TEBD's key limitations by (1) naturally accommodating long-range gates and (2) optimally representing states on the MPS manifold. By diffusing entanglement more globally, the method suppresses local bond growth and reduces memory and runtime costs. We benchmark the approach on five 49-qubit circuits: three Hamiltonian circuits (1D open and periodic Heisenberg, 2D 7x7 Ising) and two algorithmic ones (quantum approximate optimization, hardware-efficient ansatz). Across all cases, our method yields substantial resource reductions over standard tools, establishing a new state-of-the-art for circuit simulation and enabling advances across quantum computing, condensed matter, and beyond.
Measuring out-of-time-ordered correlators (OTOCs) is experimentally challenging, often requiring effective reversal of many-body dynamics. Here, we propose an alternative approach to probing operator spreading through local quantum fluctuations, using only forward evolution and local measurements. Motivated by the Heisenberg uncertainty relation, we introduce a differential local variance and establish a rigorous bound connecting it to operator noncommutativity. For a ferromagnetic Heisenberg chain in the single-magnon regime, we derive an exact relation between the local variance and a squared-commutator OTOC. In integrable and nonintegrable Ising chains, the differential variance and OTOCs reveal qualitatively consistent propagation fronts. Our results establish local quantum fluctuations as an experimentally accessible, state-dependent, and complementary diagnostic of operator spreading.
The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.