We review the basic theory of matrix product states (MPS) as a numerical variational ansatz for time evolution, and present two methods to simulate finite temperature systems with MPS: the ancilla method and the minimally entangled typical thermal state method. A sample calculation with the Bose-Hubbard model is provided.
We review the basic theory of matrix product states (MPS) as a nu-merical variational ansatz for time evolution, and present two methods to simulate finite temperature systems with MPS: the ancilla method and the minimally entangled typical thermal state method. A sample calculation with the Bose-Hubbard model is provided. The dimension of the Hilbert space for a general many-body system in-creases exponentially with the system size, severely restricting the sizes which are amenable to straightforward numerical study. Several techniques have been developed to deal with this fact, such as the stochastic sam-
Numerical methods based on matrix product states (MPSs) are currently the standard for calculating the ground-state properties of (quasi-)one-dimensional quantum many-body systems. While the properties of the low-lying excitations in such systems are often studied in this MPS framework through by means of time-evolution simulations, we can also look at their by directly calculating eigenstates corresponding to these excitations. The so-called MPS excitation ansatz is a powerful method for finding such eigenstates with a single-particle character in the thermodynamic limit. Although this excitation ansatz has been used quite extensively, a general method for calculating expectation values for these states is lacking in the literature: We aim to fill this gap by presenting a recursive algorithm to calculate arbitrary observables expressed as matrix product operators. This method concisely encapsulates existing methods for—as well as extensions to—the excitation ansatz, such as excitations with a larger spatial support and multiparticle excitations, and is robust enough to handle further innovations. We demonstrate the versatility of our method by studying the low-lying excitations in the spin-1 Heisenberg chain and the one-dimensional Hubbard model, looking at how the excitations converge in the former, while in the latter, we present a refined method of targeting single-particle excitations inside a continuum by minimizing the energy rather than the energy itself. We hope that this technique will foster further advancements with the excitation ansatz.
We discuss a method based on sampling minimally entangled typical thermal states (METTS) that can simulate finite temperature quantum systems with a computational cost comparable to ground state DMRG. Detailed implementations of each step of the method are presented, along with efficient algorithms for working with matrix product states and matrix product operators. We furthermore explore how properties of METTS can reveal characteristic order and excitations of systems and discuss why METTS form an efficient basis for sampling. Finally, we explore the extent to which the average entanglement of a METTS ensemble is minimal.
Abstract We present several features of a thermal pure quantum matrix product state (TPQ-MPS). TPQ-MPS can simulate finite temperature quantum many-body systems with a numerical cost comparable to the matrix product algorithm for the ground state in one-dimensional systems. Starting from a random matrix product state with auxiliary sites attached to the edges of the system, we successively operate the Hamiltonian with a shift-constant and obtain a series of TPQ-MPS that represents the microcanonical pure state at the highest temperature to the one at the lowest available temperature. How the parameters of the TPQ-MPS protocol influence the effective bond dimension χ of the matrix and the temperature distribution of these microcanonical states is examined.
In this work, we develop a stochastic matrix product state (stoMPS) approach that combines the MPS technique and Monte Carlo samplings and can be applied to simulate quantum lattice models down to low temperature. In particular, we exploit a procedure to unbiasedly sample the local tensors in the matrix product states, which has one physical index of dimension d and two geometric indices of dimension D, and find the results can be continuously improved by enlarging D. We benchmark the methods on small system sizes and then compare the results to those obtained with minimally entangled typical thermal states, finding that stoMPS has overall better performance with finite D. We further exploit the MPS sampling to simulate long spin chains, as well as the triangular and square lattices with cylinder circumference W up to 4. Our results showcase the accuracy and effectiveness of stochastic tensor networks in finite-temperature simulations.