Emergent phenomena of interacting quantum many-body systems arguably pose some of the greatest challenges to modern theoretical physics. Many of these systems are characterized by drastic changes in their properties as they are driven into a regime where quantum effects and interactions become relevant. Examples are the fractional quantum Hall effect and high-temperature superconductors, to name just two. New theoretical tools are necessary to study such systems, as even simple model Hamiltonians are not fully understood after decades of intense research. Numerical simulations are emerging as an indispensable tool alongside more traditional analytic approaches and have seen immense progress in recent years. In this thesis, we study tensor network states, a new class of numerical methods that have been developed in recent years drawing on insights from quantum information theory. Combining renormalization group methods with knowledge about the entanglement structure of ground states of quantum systems, tensor network states aim to efficiently describe ground states of strongly correlated quantum systems. Center stage is taken by the projected entangled-pair states. This ansatz for two-dimensional systems is discussed in detail and its capabilities are assessed by comparison to established methods and by exploring a frustrated system. We then develop a general formalism to exploit Abelian symmetries in a tensor network algorithm and demonstrate its application to projected entangled-pair states. A large part of this thesis is devoted to the discussion of a class of supersymmetric models for interacting lattice fermions. After introducing the concept of supersymmetry in quantum mechanics and an extensive overview of conformal field theory and its relation to numerical simulations, we study the critical theory of the supersymmetric model on the square ladder. We use two tensor network state algorithms, the density-matrix renormalization group and multi-scale entanglement renormalization along with exact diagonalization to explore this challenging system. In the final two chapters, we discuss two applications of tensor network states, namely simulations of the SU(3) Heisenberg model in two dimensions using two different tensor network state algorithms with the goal of illuminating the nature of its ground state, and the indistinguishability, a measure to detect phase transitions and classify wave functions which is particularly suitable for calculations based on tensor network states.
Emergent phenomena of interacting quantum many-body systems arguably pose some of the greatest challenges to modern theoretical physics. Many of these systems are characterized by drastic changes in their properties as they are driven into a regime where quantum effects and interactions become relevant. Examples are the fractional quantum Hall effect and high-temperature superconductors, to name just two. New theoretical tools are necessary to study such systems, as even simple model Hamiltonians are not fully understood after decades of intense research. Numerical simulations are emerging as an indispensable tool alongside more traditional analytic approaches and have seen immense progress in recent years. In this thesis, we study tensor network states, a new class of numerical methods that have been developed in recent years drawing on insights from quantum information theory. Combining renormalization group methods with knowledge about the entanglement structure of ground states of quantum systems, tensor network states aim to efficiently describe ground states of strongly correlated quantum systems. Center stage is taken by the projected entangled-pair states. This ansatz for two-dimensional systems is discussed in detail and its capabilities are assessed by comparison to established methods and by exploring a frustrated system. We then develop a general formalism to exploit Abelian symmetries in a tensor network algorithm and demonstrate its application to projected entangled-pair states. A large part of this thesis is devoted to the discussion of a class of supersymmetric models for interacting lattice fermions. After introducing the concept of supersymmetry in quantum mechanics and an extensive overview of conformal field theory and its relation to numerical simulations, we study the critical theory of the supersymmetric model on the square ladder. We use two tensor network state algorithms, the density-matrix renormalization group and multi-scale entanglement renormalization along with exact diagonalization to explore this challenging system. In the final two chapters, we discuss two applications of tensor network states, namely simulations of the SU(3) Heisenberg model in two dimensions using two different tensor network state algorithms with the goal of illuminating the nature of its ground state, and the indistinguishability, a measure to detect phase transitions and classify wave functions which is particularly suitable for calculations based on tensor network states.
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.
Determining the properties of quantum many-body systems is a central challenge in modern physics. Being able to determine the macroscopic properties of a system from its microscopic description would hasten progress in many fields of science and technology. However, we currently lack the tools to solve such problems generally, or even to develop a theoretical intuition about how many systems might behave. From a simple Hamiltonian description of the system, one may obtain complex, highly correlated collective behaviour. Computational techniques have played a major part in the effort to determine properties of quantum many-body systems. However, as the total degrees of freedom in the system scales exponentially in the system size, numerical diagonalization of the Hamiltonian quickly becomes computationally intractable and one must develop more efficient approximate techniques to explore the system. Present numerical methods such as quantum Monte Carlo and series expansion have provided insight into many systems of interest, but are also held back by fundamental difficulties. In this thesis, we focus on tensor networks, a relatively new ansatz for representing quantum many-body states. Tensor networks are motivated by two ideas from quantum information: firstly, that quantum entanglement is the source of the immense difficulty of simulating quantum systems classically, and secondly that the ground states of certain Hamiltonians exist in a low-entanglement region of the entire Hilbert space. The strength of tensor networks is that they provide a systematic way of representing this class of low-entanglement quantum states. In particular, this thesis describes the iPEPS algorithm for computing the ground states of infinite, two-dimensional quantum lattice systems based on the Projected Entangled Pair States (PEPS) ansatz. We then benchmark the algorithm by computing the phase diagrams of several systems that have been studied with other techniques. Lastly, we apply our algorithm to problems that are not well solved by current approaches, such as frustrated spin systems.
In this thesis, we use the new numerical method multiscale entanglement
renormalization ansatz (MERA) to study the one dimensional spin system. This
method, MERA, utilizes a network of tensors to represent quantum many-body
systems on a lattice. Other examples of tensor network state are matrix product
states (MPSs) for 1D systems, tree tensor networks (TTNs) for systems with a
tree shape, and projected entangled-pair states (PEPSs) for 2D systems and be-
yond. The three structures dier in the graph that denes how the tensors are
interconnected into a network: The graphs for MPSs, TTNs, and 2D PEPSs are,
respectively, a chain, a tree, and a 2D lattice. Importantly, from these tensor
networks the expectation value of local observables can be computed eciently.
Developing algorithms to simulate quantum many-body systems is important
for understanding and studying the physical principles. And these may become
powerful tools for the analysis of quantum computation and quantum information
theory. But in general ecient simulation is dicult, due to the fundamental
quantum physical laws.
The main method we have studied and worked on is multiscale entangle-
ment renormalization ansatz (MERA) which is a variational ansatz for many-
body states. MERA is a tree tensor network for 1D, 2D systems and beyond.
We have developed code of ternary-MERA to compute the ground state energy,
expected values of local observables, and correlators for 1D lattice systems. In
a nutshell, MERA is an algorithm for entanglement renormalization which is a
numerical technique based on locally reorganizing the Hilbert space of a quantum
many-body system with the aim to reduce the amount of entanglement in its wave
function. We use this method to study 1D Ising model, XXZ model, and J1 - J2
model, and then comparing the numerical results with exact diagonalization (ED)
and density matrix renormalization group (DMRG).
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.
Strongly correlated quantum systems are one of the most interesting and challenging phenomena in modern condensed matter physics. Unfortunately, the theoretical access even to their low energy properties is limited by the exponential growth of the Hilbert space in a many-body setting. To mitigate this computational barrier, tensor network methods are one of the most competitive approaches to classically simulate complex quantum systems. In this thesis we will discuss recent developments in the field of tensor networks to efficiently and accurately simulate two-dimensional quantum many-body states in the thermodynamic limit. Hereby, we introduce the variational update globally optimizing the wave-function, encoded as tensor network in the form of an infinite projected entangled pair state (iPEPS), in order to obtain ground states of many-body Hamiltonian models. We focus in the discussion on the well-established method to approximately contract this two-dimensional structure, the corner transfer matrix renormalization group (CTMRG), and discuss its native application on square lattice and triangular lattice based models. Furthermore, we report the development of a refined numerical algorithm, the split-CTMRG, to significantly reduce its computational complexity, pushing the limits of feasible simulations within modern hardware capabilities. Finally, the method advancements are applied to a currently widely studied model of frustrated magnetism, the Heisenberg maple-leaf antiferromagnet. We are able to find a large phase of vanishing magnetization in contradiction to previous works and, to the best of our knowledge, the lowest reported variational ground state energy at the isotropic point of the model. As an outlook, we describe a potential adaption of the previously developed methods to variationally simulate two-dimensional many-body thermal states.
Tensor networks are a class of methods for studying many-body systems. They give a geometrical description of the internal structure of many-body states, operators, and partition functions, that can be used to implement efficient algorithms to simulate them numerically. In this thesis, after providing a very brief overview of the field, we present new tensor network methods for three different use cases. \n \nFirst, we present a new real-space renormalization group algorithm for tensor networks. Compared to existing methods, its advantages are its low computational cost, simplicity of implementation, and applicability to any network. We benchmark it on the 2D classical Ising model and find accuracy comparable with the best existing tensor network methods. Due to its simplicity and generalizability, we consider our algorithm to be an excellent candidate for implementation of real-space renormalization in higher dimensions, and discuss some of the details and the remaining challenges in 3D. \n \nSecond, we show how certain topological conformal defects of critical lattice theories can be represented as tensor networks, using the 2D classical Ising model as an example. Furthermore, we show how such tensor network descriptions, combined with a renormalization group algorithm, can be used to obtain accurate estimates of the universal properties of these defects. We also show how coarse-graining of defects can be applied to any conformal defect (i.e. not just topological ones), and yields a set of associated scaling dimensions. \n \nFinally, we leave behind the focus on renormalization group methods, and present a method for spatially resolving the overlap between two tensor network states, to obtain localized information about the similarities and differences between them. For a given region, the similarity of two states in this region can be quantified by the Uhlmann fidelity of their reduced density matrices, and we show how such fidelities can be efficiently computed in many cases when the two states are represented as tensor networks. We demonstrate the usefulness of evaluating such subsystem fidelities with three example applications: studying local quenches, comparing critical and non-critical states, and quantifying convergence in tensor network simulations.