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.
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.
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.
Tensor networks were developed in the context of many-body physics as compressed representations of multiparticle quantum states. These representations mitigate the exponential complexity of many-body systems by capturing only the most relevant dependencies. Due to the formal similarity between quantum entanglement and statistical correlations, tensor networks have recently been integrated in machine learning, operating both as alternative learning architectures and as decompositions of components of neural networks. The expectation is that the theoretical understanding of tensor networks developed within quantum many-body physics leads to novel methods that offer advantages in terms of computational efficiency, explainability, or privacy. Here we review the use of tensor networks in the context of machine learning, providing a critical assessment of the state of the art, the potential advantages, and the challenges that must be overcome.
Tensor network states are ubiquitous in the investigation of quantum many-body (QMB) physics. Their advantage over other state representations is evident from their reduction in the computational complexity required to obtain various quantities of interest, namely observables. Additionally, they provide a natural platform for investigating entanglement properties within a system. In this dissertation, we develop various novel algorithms and optimizations to tensor networks for the investigation of QMB systems, including classical and quantum circuits. Specifically, we study optimizations for the two-dimensional Ising model in a transverse field, we create an algorithm for the k-SAT problem, and we study the entanglement properties of random unitary circuits. In addition to these applications, we reinterpret renormalization group principles from QMB physics in the context of machine learning to develop a novel algorithm for the tasks of classification and regression, and then utilize machine learning architectures for the time evolution of operators in QMB systems.
Tensor networks have historically proven to be of great utility in providing compressed representations of wave functions that can be used for the calculation of eigenstates. Recently, it has been shown that a variety of these networks can be leveraged to make real time non-equilibrium simulations of dynamics involving the Feynman-Vernon influence functional more efficient. In this work, a tensor network is developed for non-perturbatively calculating the equilibrium correlation function for open quantum systems using the path integral methodology. These correlation functions are of fundamental importance in calculations of rates of reactions, simulations of response functions and susceptibilities, spectra of systems, etc. The influence of the solvent on the quantum system is incorporated through an influence functional, whose unconventional structure motivates the design of a new optimal matrix product-like operator that can be applied to the so-called path amplitude matrix product state. This complex-time tensor network path integral approach provides an exceptionally efficient representation of the path integral, enabling simulations for larger systems strongly interacting with baths and at lower temperatures out to longer time. The derivation, design, and implementation of this method are discussed along with a wide range of illustrations ranging from rate theory and symmetrized spin correlation functions to simulation of response of the Fenna-Matthews-Olson complex to light.
Strongly correlated systems exhibit phenomena -- such as high-T_c superconductivity or the fractional quantum Hall effect -- that are not explicable by classical and semi-classical methods. Moreover, due to the exponential scaling of the associated Hilbert space, solving the proposed model Hamiltonians by brute-force numerical methods is bound to fail. Thus, it is important to develop novel numerical and analytical methods that can explain the physics in this regime. Tensor Network states are quantum many-body states that help to overcome some of these difficulties by defining a family of states that depend only on a small number of parameters. Their use is twofold: they are used as variational ansatzes in numerical algorithms as well as providing a framework to represent a large class of exactly solvable models that are believed to represent all possible phases of matter. The present thesis investigates mathematical properties of these states thus deepening the understanding of how and why Tensor Networks are suitable for the description of quantum many-body systems. It is believed that tensor networks can represent ground states of local Hamiltonians, but how good is this representation? This question is of fundamental importance as variational algorithms based on tensor networks can only perform well if any ground state can be approximated efficiently in such a way. While any state can be written as a tensor network state, the number of parameters needed for the description might be too large. This is not the case for one-dimensional systems: only a few parameters are required to have a good approximation of their ground states; that, in turn, allows for numerical algorithms based on tensor networks performing well. The situation in two dimensions is somewhat more complicated, but it is known that ground states of local Hamiltonians can be expressed as tensor networks with sub-exponentially many parameters. In the present thesis, we improve on these existing bounds strengthening the claim that the language of tensor networks is suitable to describe many-body systems. Another central question is how symmetries of the system such as translational invariance, time-reversal symmetry or local unitary symmetry can be reflected in tensor networks. This question is important as systems appearing in nature might intrinsically possess certain symmetries; on one hand, understanding these symmetries simplifies the description of these systems. On the other hand, the presence of symmetries leads to the appearance of novel phases -- symmetry-protected topological (SPT) order, -- and tensor networks provide the right language to classify these phases. In one dimension and for certain classes of two-dimensional tensor networks (states generated by so-called injective tensors) it is well understood how symmetries of the state can be described. A general framework, however, has yet to be developed. In the present thesis, we contribute to the development of the theory in two ways. We first investigate the question for injective tensors, and generalize the existing proof for any geometry including the hyperbolic geometry used in the AdS/CFT correspondence. Second, we introduce a class of tensor network states that include previously known examples of states exhibiting SPT order. We show how symmetries are reflected in these states thus deepening the understanding of SPT order in two dimensions.
The study of the ground states of local Hamiltonians in quantum many-body and quantum field theoretic systems is a source of many research problems of great complexity. Almost in its entirety, this thesis deals with constructions related to the field of tensor networks, which are efficient parametrizations of mathematical objects from quantum many-body theory (such as quantum states and operators) that exploit our knowledge of their entanglement structures in order to obtain improvements in our computational abilities. In the past decade, the new research program of continuous tensor networks has arisen with the goal of reproducing, in the setting of quantum field theory, the success that tensor network techniques have enjoyed on the lattice. First, we present a number of results from research performed on non-interacting examples of the continuous Multiscale Entanglement Renormalization Ansatz, or cMERA, a continuous tensor network that provides a variational wavefunctional for a quantum field theoretic ground state. Initially, we study the correlations and entanglement structure of cMERA states, providing evidence that such states can be interpreted as UV regularized versions of the physical states they approximate. After that, we study what modifications of the formalism are necessary in order to consider systems with gauge symmetry, or in the presence of boundaries and defects. We obtain prescriptions for the treatment of these cases which, we expect, may also hold in the interacting setting. We then abandon briefly the area of continuous tensor networks to present a piece of research within a different though related research program: that of the study of manifestations of universal emergent behaviour in critical lattice systems. In particular we bring attention to the existence of an approximate representation of the Virasoro algebra supported on the eigenvectors of the reduced density matrices of critical lattice systems. We call this the entanglement algebra, and study its accuracy in the particular case of the Ising model. Lastly, we present a proposal for a continuous version of the Tensor Network Renormalization (TNR) algorithm, which we dub continuous TNR, or cTNR. cTNR operates on UV regularized classical partition functions or quantum Euclidean path integrals, and generates a real-space renormalization group flow via continuous coarse-graining and rescaling operations. We show that a UV regularized version of the free boson path integral can be made a fixed point of such a renormalization flow, in a way that allows for recovery of the conformal data associated to the free boson conformal field theory.