Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMarkov chains for tensor network states
239
0
0.0
(
0
)
Authors
S. Iblisdir
Ask ChatGPT about the research
No Arabic abstract
Markov chains for probability distributions related to matrix product states and 1D Hamiltonians are introduced. With appropriate inverse temperature schedules, these chains can be combined into a random approximation scheme for ground states of such Hamiltonians. Numerical experiments suggest that a linear, i.e. fast, schedule is possible in non-trivial cases. A natural extension of these chains to 2D settings is next presented and tested. The obtained results compare well with Euclidean evolution. The proposed Markov chains are easy to implement and are inherently sign problem free (even for fermionic degrees of freedom).
rate research
Read More
Tensor network states and methods have erupted in recent years. Originally developed in the context of condensed matter physics and based on renormalization group ideas, tensor networks lived a revival thanks to quantum information theory and the understanding of entanglement in quantum many-body systems. Moreover, it has been not-so-long realized that tensor network states play a key role in other scientific disciplines, such as quantum gravity and artificial intelligence. In this context, here we provide an overview of basic concepts and key developments in the field. In particular, we briefly discuss the most important tensor network structures and algorithms, together with a sketch on advances related to global and gauge symmetries, fermions, topological order, classification of phases, entanglement Hamiltonians, AdS/CFT, artificial intelligence, the 2d Hubbard model, 2d quantum antiferromagnets, conformal field theory, quantum chemistry, disordered systems, and many-body localization.
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 both the accuracy and the efficiency of the tensor-network algorithm and allows the ground state to be determined accurately using TNS with very small virtual bond dimensions. This state 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.
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 propose a second renormalization group method to handle the tensor-network states or models. This method reduces dramatically the truncation error of the tensor renormalization group. It allows physical quantities of classical tensor-network models or tensor-network ground states of quantum systems to be accurately and efficiently determined.
We analyze families of Markov chains that arise from decomposing tensor products of irreducible representations. This illuminates the Burnside-Brauer Theorem for building irreducible representations, the McKay Correspondence, and Pitmans 2M-X Theorem. The chains are explicitly diagonalizable, and we use the eigenvalues/eigenvectors to give sharp rates of convergence for the associated random walks. For modular representations, the chains are not reversible, and the analytical details are surprisingly intricate. In the quantum group case, the chains fail to be diagonalizable, but a novel analysis using generalized eigenvectors proves successful.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
