We revisit the corner transfer matrix renormalization group (CTMRG) method of Nishino and Okunishi for contracting two-dimensional (2D) tensor networks and demonstrate that its performance can be substantially improved by determining the tensors using an eigenvalue solver as opposed to the power method used in CTMRG. We also generalize the variational uniform matrix product state (VUMPS) ansatz for diagonalizing 1D quantum Hamiltonians to the case of 2D transfer matrices and discuss similarities with the corner methods. These two new algorithms will be crucial to improving the performance of variational infinite projected entangled pair state (PEPS) methods.
Using exact diagonalization and tensor network techniques we compute the gap for the AKLT Hamiltonian in 1D and 2D spatial dimensions. Tensor Network methods are used to extract physical properties directly in the thermodynamic limit, and we support these results using finite-size scalings from exact diagonalization. Studying the AKLT Hamiltonian perturbed by an external field, we show how to obtain an accurate value of the gap of the original AKLT Hamiltonian from the field value at which the ground state verifies e_0<0, which is a quantum critical point. With the Tensor Network Renormalization Group methods we provide evidence of a finite gap in the thermodynamic limit for the AKLT models in the 1D chain and 2D hexagonal and square lattices. This method can be applied generally to Hamiltonians with rotational symmetry, and we also show results beyond the AKLT model.
We show that Projected Entangled-Pair States (PEPS) are able to describe critical, fermionic systems exhibiting both 1d and 0d Fermi surfaces on a 2d lattice. In the thermodynamic limit, the energy precision as a function of the bond dimension improves as a power law, illustrating that an arbitrary precision can be obtained by increasing the bond dimension in a controlled manner. We also identify a non-trivial obstruction in the Gaussian and fermionic variant of PEPS, rooted in its topology and restricting its efficient applicability to models with a matching parity configuration.
This paper is a manual with tips and tricks for programming tensor network algorithms with global $SU(2)$ symmetry. We focus on practical details that are many times overlooked when it comes to implementing the basic building blocks of codes, such as useful data structures to store the tensors, practical ways of manipulating them, and so forth. Here we do not restrict ourselves to any specific tensor network method, but keep always in mind that the implementation should scale well for simulations of higher-dimensional systems using, e.g., Projected Entangled Pair States, where tensors with many indices may show up. To this end, the structural tensors (or intertwiners) that arise in the usual decomposition of $SU(2)$-symmetric tensors are never explicitly stored throughout the simulation. Instead, we store and manipulate the corresponding fusion trees - an algebraic specification of the symmetry constraints on the tensor - in order to implement basic $SU(2)$-symmetric tensor operations.
We present a tree-tensor-network-based method to study strongly correlated systems with nonlocal interactions in higher dimensions. Although the momentum-space and quantum-chemist
We present a new strategy for contracting tensor networks in arbitrary geometries. This method is designed to follow as strictly as possible the renormalization group philosophy, by first contracting tensors in an exact way and, then, performing a controlled truncation of the resulting tensor. We benchmark this approximation procedure in two dimensions against an exact contraction. We then apply the same idea to a three dimensional system. The underlying rational for emphasizing the exact coarse graining renormalization group step prior to truncation is related to monogamy of entanglement.