Committee Feed
https://feeds.library.caltech.edu/people/White-S-R/committee.rss
A Caltech Library Repository Feedhttp://www.rssboard.org/rss-specificationpython-feedgenenMon, 15 Apr 2024 16:14:08 +0000Development of Tensor Network Algorithms for Studying Classical and Quantum Many-Body Systems
https://resolver.caltech.edu/CaltechTHESIS:05312018-184631141
Authors: {'items': [{'email': 'matthew@fishman.me', 'id': 'Fishman-Matthew-Theodore', 'name': {'family': 'Fishman', 'given': 'Matthew Theodore'}, 'show_email': 'NO'}]}
Year: 2018
DOI: 10.7907/44s6-0q68
<p>The field of tensor networks, kicked off in 1992 by Steve White's invention of the spectacularly successful density matrix renormalization group (DMRG) algorithm, has exploded in popularity in recent years. Tensor networks are poised to play a role in helping us solve some of the greatest open physics problems of our time, such as understanding the nature of high-temperature superconductivity and illuminating a theory of quantum gravity. DMRG and extensions based on a class of variational states known as tensor network states have been indispensable tools in helping us understand both numerically and theoretically the properties of complicated classical and quantum many-body systems. However, practical challenges to these techniques still remain, and algorithmic developments are needed before tensor network algorithms can be applied to more physics problems. In this thesis we present a variety of recent advancements to tensor network algorithms.</p>
<p>First we describe a DMRG-like algorithm for noninteracting fermions. Noninteracting fermions, naturally being gapless and therefore having high levels of entanglement, are actually a challenging setting for standard DMRG algorithms, and we believe this new algorithm can help with tensor network calculations in that setting.</p>
<p>Next we explain a new algorithm called the variational uniform matrix product state (VUMPS) algorithm that is a DMRG-like algorithm that works directly in the thermodynamic limit, improving upon currently available MPS-based methods for studying infinite 1D and quasi-1D quantum many-body systems.</p>
<p>Finally, we describe a variety of improvements to algorithms for contracting 2D tensor networks, a common problem in tensor network algorithms, for example for studying 2D classical statistical mechanics problems and 2D quantum many-body problems with projected entangled pair states (PEPS). One is a new variant of the corner transfer matrix renormalization group (CTMRG) algorithm of Nishino and Okunishi that improves the numerical stability for contracting asymmetric two-dimensional tensor networks compared to the most commonly used method. Another is the application of the VUMPS algorithm to contracting 2D tensor networks. The last is a new alternative to CTMRG, where the tensors are solved for with eigenvalue equations instead of a power method, which we call the fixed point corner method (FPCM). We present results showing the transfer matrix VUMPS algorithm and FPCM significantly improve upon the convergence time of CTMRG. We expect these algorithms will play an important role in expanding the set of 2D classical and 2D quantum many-body problems that can be addressed with tensor networks.</p>https://thesis.library.caltech.edu/id/eprint/10992