Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSpectral gaps of AKLT Hamiltonians using Tensor Network methods
116
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
We develop a strategy for tensor network algorithms that allows to deal very efficiently with lattices of high connectivity. The basic idea is to fine-grain the physical degrees of freedom, i.e., decompose them into more fundamental units which, after a suitable coarse-graining, provide the original ones. Thanks to this procedure, the original lattice with high connectivity is transformed by an isometry into a simpler structure, which is easier to simulate via usual tensor network methods. In particular this enables the use of standard schemes to contract infinite 2d tensor networks - such as Corner Transfer Matrix Renormalization schemes - which are more involved on complex lattice structures. We prove the validity of our approach by numerically computing the ground-state properties of the ferromagnetic spin-1 transverse-field Ising model on the 2d triangular and 3d stacked triangular lattice, as well as of the hard-core and soft-core Bose-Hubbard models on the triangular lattice. Our results are benchmarked against those obtained with other techniques, such as perturbative continuous unitary transformations and graph projected entangled pair states, showing excellent agreement and also improved performance in several regimes.
We analyze and discuss convergence properties of a numerically exact algorithm tailored to study the dynamics of interacting two-dimensional lattice systems. The method is based on the application of the time-dependent variational principle in a manifold of binary and quaternary Tree Tensor Network States. The approach is found to be competitive with existing matrix product state approaches. We discuss issues related to the convergence of the method, which could be relevant to a broader set of numerical techniques used for the study of two-dimensional systems.
We discuss in detail algorithms for implementing tensor network renormalization (TNR) for the study of classical statistical and quantum many-body systems. Firstly, we recall established techniques for how the partition function of a 2D classical many-body system or the Euclidean path integral of a 1D quantum system can be represented as a network of tensors, before describing how TNR can be implemented to efficiently contract the network via a sequence of coarse-graining transformations. The efficacy of the TNR approach is then benchmarked for the 2D classical statistical and 1D quantum Ising models; in particular the ability of TNR to maintain a high level of accuracy over sustained coarse-graining transformations, even at a critical point, is demonstrated.
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.
We present several results relating to the contraction of generic tensor networks and discuss their application to the simulation of quantum many-body systems using variational approaches based upon tensor network states. Given a closed tensor network $mathcal{T}$, we prove that if the environment of a single tensor from the network can be evaluated with computational cost $kappa$, then the environment of any other tensor from $mathcal{T}$ can be evaluated with identical cost $kappa$. Moreover, we describe how the set of all single tensor environments from $mathcal{T}$ can be simultaneously evaluated with fixed cost $3kappa$. The usefulness of these results, which are applicable to a variety of tensor network methods, is demonstrated for the optimization of a Multi-scale Entanglement Renormalization Ansatz (MERA) for the ground state of a 1D quantum system, where they are shown to substantially reduce the computation time.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
