Tensor networks provide a powerful and elegant approach to quantum manybody simulation. The simplest example is the density matrix renormalisation group (DMRG), which is based on the variational update of a matrix product state (MPS). It has proved to be the most accurate approach for the numerical study of strongly correlated one dimensional systems. We use DMRG to study the one dimensional disordered Bose-Hubbard model at fillings N=L = 1=2, 1 and 2 and show that the whole phase diagram for each can be successfully obtained by analysing entanglement properties alone. We �nd that the average entanglement is insufficient to accurately locate all of the phases, however using the standard error on the mean we are able to construct a phase diagram that is consistent with previous studies. It has recently been shown that there is a connection between the geometry of tensor networks and the entanglement and correlation properties that it can encode, which is a generalisation of the so called area law for entanglement entropy. This suggests that whilst gapped quantum systems can be accurately modeled using an MPS, a tensor network with a holographic geometry is natural to capture the logarithmic entanglement scaling and power law decaying correlation functions of critical systems. We create an algorithm for the disordered Heisenberg Hamiltonian that self assembles a tensor network based on the disorder in the couplings. The geometry created is that of a disordered tree tensor network (TTN) that when averaged has the holographic properties characteristic of critical systems. We continue the analysis of holographic tensor network geometry by considering the average length of leaf-to-leaf paths in various tree graphs, which is related to two-point correlation functions in tensor networks. For regular, complete trees we analytically calculate the average path length and all statistical moments, and generalise it for any splitting number. We then turn to the Catalan trees, which is the set of unique binary trees with n vertices, as it has a similar geometry to the disordered TTNs. We calculate the average depth of a leaf and show that it is equal to the average path length. We compare these analytic results with the structures found in the TTN and randomly constructed trees to show that the renormalisation involved in the TTN algorithm is crucial in the selection of the tree structure.
In recent years, tensor network states have emerged as a very useful conceptual and simulation framework to study quantum many-body systems at low energies. In this paper, we describe a particular way in which any given tensor network can be viewed as a representation of two different quantum many-body states. The two quantum many-body states are said to correspond to each other by means of the tensor network. We apply this ``tensor network state correspondence''---a correspondence between quantum many-body states mediated by tensor networks as we describe---to the multi-scale entanglement renormalization ansatz (MERA) representation of ground states of one dimensional (1D) quantum many-body systems. Since the MERA is a 2D hyperbolic tensor network (the extra dimension is identified as the length scale of the 1D system), the two quantum many-body states obtained from the MERA, via tensor network state correspondence, are seen to live in the bulk and on the boundary of a discrete hyperbolic geometry. The bulk state so obtained from a MERA exhibits interesting features, some of which caricature known features of the holographic correspondence of String theory. We show how (i) the bulk state admits a description in terms of ``holographic screens'', (ii) the conformal field theory data associated with a critical ground state can be obtained from the corresponding bulk state, in particular, how pointlike boundary operators are identified with extended bulk operators. (iii) We also present numerical results to illustrate that bulk states, dual to ground states of several critical spin chains, have exponentially decaying correlations, and that the bulk correlation length generally decreases with increase in central charge for these spin chains.
Tensor networks (TNs) are one of the best available tools to study many-body quantum systems. TNs are particularly suitable for one-dimensional local Hamiltonians, while their performance for generic geometries is mainly limited by two aspects: the limitation in expressive power and the approximate extraction of information. Here we investigate the performance of superposition-of-product-states (SPS) ansatz, a variational framework structurally related to canonical polyadic tensor decomposition. The ansatz does not compress information as effectively as tensor networks, but it has the advantages (i) of allowing accurate extraction of information, (ii) of being structurally independent of the geometry of the system, (iii) of being readily parallelizable, and (iv) of allowing analytical shortcuts. We first study the typical properties of the SPS ansatz for spin-
1/2 systems, including its entanglement entropy, and its trainability. We then use this ansatz for ground state search in tilted Ising models -- including one-dimensional and three-dimensional with short- and long-range interaction, and a random network -- demonstrating that SPS can attain high accuracy.