The exact contraction of a generic two-dimensional (2D) tensor network state (TNS) is known to be exponentially hard, making simulation of 2D systems difficult. The recently introduced class of isometric TNS (isoTNS) represents a subset of TNS that allows for efficient simulation of such systems on finite square lattices. The isoTNS ansatz requires the identification of an ``orthogonality column'' of tensors, within which one-dimensional matrix product state (MPS) methods can be used for calculation of observables and optimization of tensors. Here we extend isoTNS to infinitely long strip geometries and introduce an infinite version of the Moses Move algorithm for moving the orthogonality column around the network. Using this algorithm, we iteratively transform an infinite MPS representation of a 2D quantum state into a strip isoTNS and investigate the entanglement properties of the resulting state. In addition, we demonstrate that the local observables can be evaluated efficiently. Finally, we introduce an infinite time-evolving block decimation algorithm (
iTEBD2) and use it to approximate the ground state of the 2D transverse field Ising model on lattices of infinite strip geometry.
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.