In the out-of-equilibrium evolution induced by a quench, fast degrees of freedom generate long-range entanglement that is hard to encode with standard tensor networks. However, local observables only sense such long-range correlations through their contribution to the reduced local state as a mixture. We present a tensor network method that identifies such long-range entanglement and efficiently transforms it into mixture, much easier to represent. In this way, we obtain an effective description of the time-evolved state as a density matrix that captures the long-time behavior of local operators with finite computational resources.
In the out-of-equilibrium evolution induced by a quench, fast degrees of freedom generate long-range entanglement that is hard to encode with standard tensor networks. However, local observables only sense such long-range correlations through their contribution to the reduced local state as a mixture. We present a tensor network method that identifies such long-range entanglement and efficiently transforms it into mixture, much easier to represent. In this way, we obtain an effective description of the time-evolved state as a density matrix that captures the long-time behavior of local operators with finite computational resources.
[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.
One of the major ways in which quantum mechanics differs from classical mechanics is the existence of special quantum correlations - entanglement. Typical quantum states are highly entangled, making them complex and inefficient to represent. Physically interesting states are unusual, they are only weakly entangled. By restricting ourselves to weak entanglement, efficient representations of quantum states can be found. A tensor network is constructed by taking objects called tensors that encode spatially local information and gluing them together to create a large network that describes a complex quantum state. The manner in which the tensors are connected defines the entanglement structure of the quantum state. Tensors networks are therefore a natural framework for describing physical behaviour of complex quantum systems. In this thesis we utilize tensor networks to solve a number of interesting problems. Firstly, we study a Feynman path integral written over tensor network states. As a sum over classical trajectories, a Feynman path integral can struggle to capture entanglement. Combining the path integral with tensor networks overcomes this.We consider the effect of quadratic fluctuations on the tensor network path integral and calculate corrections to observables numerically and analytically. We also study the time evolution of complex quantum systems. By projecting quantum dynamics onto a classical phase space defined using tensor networks, we relate thermal behaviour of quantum systems to classical chaos. In doing so we demonstrate a relationship between entanglement growth and chaos. By studying the dynamics of coupled quantum chains we also gain insight into how quantum correlations spread over time. As noted, tensor networks are remarkably efficient. In the final section of this thesis we use tensor networks to create compressed machine learning algorithms. Their efficiency means that tensor networks can use 50 times fewer parameters with no significant decrease in performance.
We introduce the concept of concatenated tensor networks to efficiently describe quantum states. We show that the corresponding concatenated tensor network states can efficiently describe time evolution and possess arbitrary block-wise entanglement and long-ranged correlations. We illustrate the approach for the enhancement of matrix product states, i.e. one-dimensional (1D) tensor networks, where we replace each of the matrices of the original matrix product state with another 1D tensor network. This procedure yields a 2D tensor network, which includes—already for tensor dimension 2—all states that can be prepared by circuits of polynomially many (possibly non-unitary) two-qubit quantum operations, as well as states resulting from time evolution with respect to Hamiltonians with short-ranged interactions. We investigate the possibility of efficiently extracting information from these states, which serves as the basic step in a variational optimization procedure. To this aim, we utilize the known exact and approximate methods for 2D tensor networks and demonstrate some improvements thereof, which are also applicable e.g. in the context of 2D projected entangled pair states. We generalize the approach to higher dimensional and tree tensor networks.
It appears that the tensor network ansatz, while not quite complete, is an efficient coordinate system for the tiny subset of a many-body Hilbert space which can be realized as a low energy state of a local Hamiltonian.However, we don't fully understand precisely which phases are captured by the tensor network ansatz, how to compute their physical observables (even numerically), or how to compute a tensor network representation for a ground state given a microscopic Hamiltonian. These questions are algorithmic in nature, but their resolution is intimately related to understanding the nature of quantum entanglement in many-body systems.For this reason it is useful to compute the tensor network representation of various `model' wavefunctions representative of different phases of matter; this allows us to understand how the entanglement properties of each phase are expressed in the tensor network ansatz, and can serve as test cases for algorithm development.Condensed matter physics has many illuminating model wavefunctions, such as Laughlin's celebrated wave function for the fractional quantum Hall effect, the Bardeen-Cooper-Schrieffer wave function for superconductivity, and Anderson's resonating valence bond ansatz for spin liquids.This thesis presents some results on exact tensor network representations of these model wavefunctions. In addition, a tensor network representation is given for the time evolution operator of a long-range one-dimensional Hamiltonian, which allows one to numerically simulate the time evolution of power-law interacting spin chains as well as two-dimensional strips and cylinders.
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.
Efficient methods to access the entanglement of a quantum many-body state, where the complexity generally scales exponentially with the system size N, have long been a concern. Here we propose the Schmidt tensor network state (Schmidt TNS) that efficiently represents the Schmidt decomposition of finite- and even infinite-size quantum states with nontrivial bipartition boundary. The key idea is to represent the Schmidt coefficients (i.e., entanglement spectrum) and transformations in the decomposition to tensor networks (TNs) with linearly scaled complexity versus N. Specifically, the transformations are written as the TNs formed by local unitary tensors, and the Schmidt coefficients are encoded in a positive-definite matrix product state (MPS). Translational invariance can be imposed on the TNs and MPS for the infinite-size cases. The validity of Schmidt TNS is demonstrated by simulating the ground state of the quasi-one-dimensional spin model with geometrical frustration. Our results show that the MPS encoding the Schmidt coefficients is weakly entangled even when the entanglement entropy of the decomposed state is strong. This justifies the efficiency of using MPS to encode the Schmidt coefficients, and promises an exponential speedup on the full-state sampling tasks.