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.
Tensor network states are capable of describing many-body systems with complex quantum entanglement, including systems with non-trivial topological order. In this paper, we study methods to calculate the topological properties of a tensor network state from the tensors that form the state. Motivated by the concepts of gauge group and projective symmetry group in the slave-particle/projective construction, and by the low-dimensional gauge-like symmetries of some exactly solvable Hamiltonians, we study the
d-dimensional gauge structure and the
d-dimensional symmetry structure of a tensor network state, where
d≤dspace with
dspace the dimension of space. The
d-dimensional gauge structure and
d-dimensional symmetry structure allow us to calculate the string operators and
d-brane operators of the tensor network state. This in turn allows us to calculate many topological properties of the tensor network state, such as ground state degeneracy and quasiparticle statistics.
We propose a generalized Lanczos method to generate the many-body basis states of quantum lattice models using tensor-network states (TNS). The ground-state wave function is represented as a linear superposition composed from a set of TNS generated by Lanczos iteration. This method improves significantly the accuracy of the tensor-network algorithm and provides an effective way to enlarge the maximal bond dimension of TNS. The ground state such obtained contains significantly more entanglement than each individual TNS, reproducing correctly the logarithmic size dependence of the entanglement entropy in a critical system. The method can be generalized to non-Hamiltonian systems and to the calculation of low-lying excited states, dynamical correlation functions, and other physical properties of strongly correlated systems.