Hybrid Purification and Sampling Approach for Thermal Quantum Systems

Abstract

We propose an algorithm which combines the beneficial aspects of two different methods for studying finite-temperature quantum systems with tensor networks. One approach is the ancilla method, which gives high-precision results but scales poorly at low temperatures. The other method is the minimally entangled typical thermal state (METTS) sampling algorithm which scales better than the ancilla method at low temperatures and can be parallelized, but requires many samples to converge to a precise result. Our proposed hybrid of these two methods purifies physical sites in a small central spatial region with partner ancilla sites, sampling the remaining sites using the METTS algorithm. Observables measured within the purified cluster have much lower sample variance than in the METTS approach, while sampling the sites outside the cluster reduces their entanglement and the computational cost of the algorithm. The sampling steps of the algorithm remain straightforwardly parallelizable. The hybrid approach also solves an important technical issue with METTS that makes it difficult to benefit from quantum number conservation. By studying S=1 Heisenberg ladder systems, we find the hybrid method converges more quickly than both the ancilla and METTS algorithms at intermediate temperatures and for systems with higher entanglement.

arXiv comment9 pages, 12 figures

References in corpus (21)

• Efficient simulation of one-dimensional quantum many-body systems
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• Time-dependent variational principle for quantum lattices
• Unifying time evolution and optimization with matrix product states
• Time-evolution methods for matrix-product states
• Mixed-state dynamics in one-dimensional quantum lattice systems: a time-dependent superoperator renormalization algorithm
• Studying Two Dimensional Systems With the Density Matrix Renormalization Group
• Valence Bond Solids for Quantum Computation
• Time-evolving a matrix product state with long-ranged interactions
• Finite Temperature Density Matrix Renormalization using an enlarged Hilbert space
• Minimally Entangled Typical Thermal State Algorithms
• Minimally entangled typical quantum states at finite temperature
• Isometric Tensor Network States in Two Dimensions
• Projected Entangled Pair States at Finite Temperature: Imaginary Time Evolution with Ancillas
• Variational Approach to Projected Entangled Pair States at Finite Temperature
• Variational tensor network renormalization in imaginary time: benchmark results in the Hubbard model at finite temperature
• Finite correlation length scaling with infinite projected entangled pair states at finite temperature
• Conversion of projected entangled pair states into a canonical form
• Matrix product state techniques for two-dimensional systems at finite temperature
• Tensor network simulation of the Kitaev-Heisenberg model at finite temperature
• Symmetric minimally entangled typical thermal states for canonical and grand-canonical ensembles

Cited by in corpus (11)

• The ITensor Software Library for Tensor Network Calculations
• Stripes, Antiferromagnetism, and the Pseudogap in the Doped Hubbard Model at Finite Temperature
• Finite-temperature density-matrix renormalization group method for electron-phonon systems: Thermodynamics and Holstein-polaron spectral functions
• Continuous matrix product operator approach to finite temperature quantum states
• Thermodynamics of 3D Kitaev quantum spin liquids via tensor networks
• Matrix product state approach for a quantum system at finite temperatures using random phases and Trotter gates
• Minimally Entangled Typical Thermal States Algorithms for Finite Temperature Matsubara Green Functions
• Minimally entangled typical thermal states algorithm with Trotter gates
• Efficient Simulation of Quantum Many-body Thermodynamics by Tailoring Zero-temperature Tensor Network
• Finite Temperature Minimal Entangled Typical Thermal States Impurity Solver
• Sample complexity of matrix product states at finite temperature