We develop an exact mapping between the one-step replica symmetry breaking cavity method and tensor networks. The two schemes come with complementary mathematical and numerical toolboxes that could be leveraged to improve the respective states of the art. As an example, we construct a tensor-network representation of Survey Propagation, one of the best deterministic k-SAT solvers. The resulting algorithm outperforms any existent tensor-network solver by several orders of magnitude. We comment on the generality of these ideas, and we show how to extend them to the context of quantum tensor networks.
We develop an exact mapping between the one-step replica symmetry breaking cavity method and tensor networks. The two schemes come with complementary mathematical and numerical toolboxes that could be leveraged to improve the respective states of the art. As an example, we construct a tensor-network representation of Survey Propagation, one of the best deterministic k-SAT solvers. The resulting algorithm outperforms any existent tensor-network solver by several orders of magnitude. We comment on the generality of these ideas, and we show how to extend them to the context of quantum tensor networks.
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.
We describe a numerical many-body technique that is based on both tensor networks and quantum Monte Carlo. The variational ansatz is a tensor network that can harvest volume-law entanglement. It is constructed from a tensor train to which one applies a set of non-local operators that force several indices of the tensor train to represent the same physical index, hence its name -- replica tensor train (RTT). From the tensor network toolbox, it inherits the possibility to make linear combinations of these states and apply a certain class of operators. We can therefore find the ground-state of a local Hamiltonian in a purely algebraic way as in standard tensor network algorithms -- i.e. without using gradient descent methods. On the other hand, the volume-law structure forbids calculating physical observables directly. In much the same way as on a quantum computer where one can prepare a state but can only sample it at the end, here we have to use Markov Chain Monte Carlo to compute the observables. We further show that the approach can be extended to build Krylov-subspace ground-state methods within the variational manifold. We illustrate the different algorithms on a two-dimensional spin model with a transverse magnetic field, which can be solved by this approach at low computational cost.
Tensor networks provide extremely powerful tools for the study of complex classical and quantum many-body problems. Over the past two decades, the increment in the number of techniques and applications has been relentless, and especially the last ten years have seen an explosion of new ideas and results that may be overwhelming for the newcomer. This short review introduces the basic ideas, the best established methods, and some of the most significant algorithmic developments that are expanding the boundaries of the tensor network potential. The goal of this review is to help the reader not only appreciate the many possibilities offered by tensor networks but also find their way through state-of-the-art codes, their applicability, and some avenues of ongoing progress.
The classical simulation of many-body quantum systems is an essential tool in understanding many fundamental aspects of condensed matter physics. But a major obstacle arises from the number of degrees of freedom involved in describing such systems, which is exponential in the system size. Recently, however, a class of numerical techniques based on structures called "tensor networks" has emerged, which allows many "typical" quantum states (such as the ground states of gapped, local Hamiltonians) to be represented much more efficiently. In this work we extend and apply these techniques to consider several central topics in quantum many-body physics. After reviewing the relevant background material from the field of tensor networks and tensor network states, we demonstrate a method for computing high order moments and cumulants of operators with respect to such states, including the so-called "Binder cumulant," a powerful tool for detecting phase transitions. Next, we employ tensor network algorithms to characterize the ground state phase diagram of a quantum spin model, including both symmetry-breaking phases and symmetry protected topological order, and find a signicant variety of phases and phase transitions. Finally, we consider the entanglement properties of quantum states exhibiting many-body localization, using a combination of exact diagonalization and tensor network techniques. | 231 pages
Understanding many-body quantum systems is one of the most challenging problems in contemporary condensed-matter physics. Tensor network representation of quantum states and operators are taking central stage in this pursuit and beyond. They prove to be a powerful numerical and conceptual tool, and indeed a new language altogether. This thesis investigates various aspects of these representations by focusing on two specific problems: the first half of the thesis is devoted to examining how 'stable' a tensor network representation is for two-dimensional quantum states with topological order, and the second half explores the representability of various unitary loop operators with tensor networks. In the numerical usage of the tensor networks, the tensor is varied as to find the representation of the ground states of the given Hamiltonian. In chapter two and three of this thesis we show that such a numerical program for topological phases can be 'ill-posed'. We show that tensor network can be an unstable representation for a topological phase: even an infinitesimal variation in the representation results in the loss of topological order, completely or partially. We diagnose this problem by identifying the exact causes of this instability, and find that it is only tensor variations in certain directions that result in instability, because they result in the condensation of bosonic quasi-particles of the phase. Such unstable variations are characterized by two properties: (1) they can replace a tensor in the tensor network without making the network collapse, and (2) their presence in the network represents the presence of a non-trivial topological charge. We prove that the general tensor representation of all string-net models suffer with such instabilities. We propose an exact mathematical operator to project out all such unstable variations and show its efficacy for a few models by direct calculations. Such an operator can be useful in numerical programs involving such tensor representations. We also point out that such variations play a crucial role in simulating topological phase transitions and their presence can be vital in an accurate simulation. In chapter four and five of this thesis we focus on the representability of unitary loop operators by tensor networks. Such operators not only provide an important tool in the study of dynamical process in one-dimensional systems, but also in understanding and classification of symmetry protected topological phases in two dimensions. To characterize all such operators, we find a necessary and sufficient condition for any loop tensor network operator of a given length to represent a unitary operator. In particular, it is shown that all unitary operators that map local operators to local operators (locality-preserving) can always be represented by a tensor network. Locality-preserving unitary loop operators are classified by a rational index called the GNVW index defined in Ref. [1] which measures how much information 'flows' along the loop. We define Rank-Ratio index for tensor network operators and show that it is completely equivalent to the GNVW index. Therefore, GNVW index of a unitary operator can be easily extracted from its tensor network representation. We find that, other than representing locality-preserving unitary maps, tensor networks can also represent unitary operators that map local operators to global (non-local) operators. These tensor network operators are found to have a long-ranged order similar to tensors that represent topological tensor network states in two dimensions.
In many applications that deal with high dimensional data, it is important to not store the high dimensional object itself, but its representation in a data sparse way. This aims to reduce the storage and computational complexity. There is a general scheme for representing tensors with the help of sums of elementary tensors, where the summation structure is defined by a graph/network. This scheme allows to generalize commonly used approaches in representing a large amount of numerical data (that can be interpreted as a high dimensional object) using sums of elementary tensors. The classification does not only distinguish between elementary tensors and non-elementary tensors, but also describes the number of terms that is needed to represent an object of the tensor space. This classification is referred to as tensor network (format). This work uses the tensor network based approach and describes non-linear block Gauss-Seidel methods (ALS and DMRG) in the context of the general tensor network framework. Another contribution of the thesis is the general conversion of different tensor formats. We are able to efficiently change the underlying graph topology of a given tensor representation while using the similarities (if present) of both the original and the desired structure. This is an important feature in case only minor structural changes are required. In all approximation cases involving iterative methods, it is crucial to find and use a proper initial guess. For linear iteration schemes, a good initial guess helps to decrease the number of iteration steps that are needed to reach a certain accuracy, but it does not change the approximation result. For non-linear iteration schemes, the approximation result may depend on the initial guess. This work introduces a method to successively create an initial guess that improves some approximation results. This algorithm is based on successive rank 1 increments for the r-term format. There are still open questions about how to find the optimal tensor format for a given general problem (e.g. storage, operations, etc.). For instance in the case where a physical background is given, it might be efficient to use this knowledge to create a good network structure. There is however, no guarantee that a better (with respect to the problem) representation structure does not exist.