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.
Numerical methods for obtaining exact dynamics of non-Markovian open quantum systems are mostly limited to either small systems or to short-time evolution only. Here, we propose a new algorithm for computing process tensors--matrix product operator (MPO) representations that capture the environment influence--which achieves greatly enhanced computational scalings with system size, while maintaining linear scaling with simulation length. We build on recent developments in the field which allow for long-time evolutions through process tensors which have a time-translational invariance. These can be built for general Gaussian environments and generic coupling operators with the system using infinite time-evolving block decimation (iTEBD). We introduce a modified iTEBD algorithm using intermediate compression steps which bring down the computation time scaling with system size d from O(d8) to O(d4), as well as significantly lowering the required memory. To illustrate the power of this method, we apply it to the problem of dispersive qubit readout in circuit QED, which was previously out-of-reach numerically. The full treatment of the measurement resonator, which requires a large system space, combined with the long simulation times precipitated by the separation of timescales between the measurement drive and the environment dissipation, is now possible. The algorithm we introduce not only allows for capturing non-Markovian dynamics in large open quantum systems, but also further extends all the existing capabilities of process tensors, for example in quantum optimal control, or in computation of multi-time correlations or of steady states, to more complex systems with tens of levels.