arXiv:0904.1926 · Physical Review Letters

Matrix Product States for Dynamical Simulation of Infinite Chains

Mari Carmen Bañuls, M. B. Hastings, Frank Verstraete, J. I. Cirac

Published Jun 18, 2009• 185 citations

Abstract

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.

DOI: 10.1103/physrevlett.102.240603

Related papers

Light cone tensor network and time evolution

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

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.

arXiv:2201.08402Physical review. B./Physical review. BSep 12, 202232 citations

Tensor network approaches: Ground states and dynamics in quantum many-body systems

Ho N. Phien

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.

Jan 1, 20130 citations

Tangent-space methods for truncating uniform MPS

Bram Vanhecke, Maarten Van Damme, Jutho Haegeman +2 more

An essential primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one of a smaller bond dimension. This problem forms the central bottleneck in algorithms for time evolution and for contracting projected entangled pair states. We formulate a tangent-space based variational algorithm to achieve this goal for uniform (infinite) matrix product states. The algorithm exhibits a favourable scaling of the computational cost, and we demonstrate its usefulness by several examples involving the multiplication of a matrix product state with a matrix product operator.

arXiv:2001.11882SciPost Physics CoreFeb 19, 20212 citations

Matrix Product Evolution: A Method for Simulating Quantum Circuits Using Tensor Networks

Haruyuki Kawabe, Minoru Nagai, Tsuyoshi Okubo +1 more

Classical simulation of quantum circuits is an essential tool in quantum information science, but its applicability is constrained by the exponential growth of the Hilbert space and the entanglement structure of quantum states. In this work, we introduce Matrix Product Evolution (MPE), a tensor-train representation of quantum circuits constructed along the circuit depth rather than along the qubit index. Within this formulation, the simulation of a quantum circuit is modeled as the contraction of multiple MPE tensors. We develop an efficient contraction strategy based on a zip-up procedure to carry out this contraction in practice. We investigate the numerical behavior of this MPE-based contraction framework through simulations of random quantum circuits and the time evolution of a quantum many-body state. Our results characterize the growth of temporal bond dimensions, clarify how post-selection modifies the contraction cost and approximation accuracy, and identify regimes in which depth-oriented tensor-network contractions provide a useful complement to standard MPS-based simulation approaches.

quant-pharXiv:2608.03472Aug 5, 20260 citations

Three-dimensional isometric tensor networks

Maurits S. J. Tepaske, David J. Luitz

Tensor network states are expected to be good representations of a large class of interesting quantum many-body wave functions.In higher dimensions, their utility is however severely limited by the difficulty of contracting the tensor network, an operation needed to calculate quantum expectation values.Here we introduce a method for the time evolution of three-dimensional isometric tensor networks which respects the isometric structure and therefore renders contraction simple through a special canonical form.Our method involves a tetrahedral site splitting which allows one to move the orthogonality center of an embedded tree tensor network in a simple cubic lattice to any position.Using imaginary time evolution to find an isometric tensor network representation of the ground state of the three-dimensional transverse field Ising model across the entire phase diagram, we perform a systematic benchmark study of this method in comparison with exact Lanczos and quantum Monte Carlo results.We show that the obtained energy matches the exact ground-state result accurately deep in the ferromagnetic and polarized phases, while the regime close to the critical point requires larger bond dimensions.This behavior is in close analogy with the two-dimensional case, which we also discuss for comparison.

arXiv:2005.13592Physical Review ResearchJun 22, 202130 citations

Tangent-space methods for truncating uniform MPS

Bram Vanhecke

A central primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one of a lower bond dimension. This problem forms the central bottleneck in algorithms for time evolution and for contracting projected entangled pair states. We formulate a tangent-space based variational algorithm to achieve this for uniform (infinite) matrix product states. The algorithm exhibits a favourable scaling of the computational cost, and we demonstrate its usefulness by several examples involving the multiplication of a matrix product state with a matrix product operator.

Feb 1, 202119 citations