Algorithms for the Markov Entropy Decomposition
arXiv:1212.1442 · doi:10.1103/PhysRevB.87.205126
Abstract
The Markov entropy decomposition (MED) is a recently-proposed, cluster-based simulation method for finite temperature quantum systems with arbitrary geometry. In this paper, we detail numerical algorithms for performing the required steps of the MED, principally solving a minimization problem with a preconditioned Newton's algorithm, as well as how to extract global susceptibilities and thermal responses. We demonstrate the power of the method with the spin-1/2 XXZ model on the 2D square lattice, including the extraction of critical points and details of each phase. Although the method shares some qualitative similarities with exact-diagonalization, we show the MED is both more accurate and significantly more flexible.
arXiv comment12 pages, 9 figures
References in corpus (11)
- Density matrix embedding: A simple alternative to dynamical mean-field theory
- Finite-Size Scaling of the Ground State Parameters of the Two-Dimensional Heisenberg Model
- Studying Two Dimensional Systems With the Density Matrix Renormalization Group
- N-representability is QMA-complete
- Entanglement renormalization in two spatial dimensions
- Quantum Graphical Models and Belief Propagation
- Multi-scale Entanglement Renormalization Ansatz in Two Dimensions: Quantum Ising Model
- Quantum Belief Propagation
- Ground state parameters, finite-size scaling, and low-temperature properties of the two-dimensional S=1/2 XY model
- Markov entropy decomposition: a variational dual for quantum belief propagation
- Lower Bounds for Ground States of Condensed Matter Systems
Cited by in corpus (4)
- Sample-efficient learning of quantum many-body systems
- Projected Entangled Pair States at Finite Temperature: Iterative Self-Consistent Bond Renormalization for Exact Imaginary Time Evolution
- Fermionic Projected Entangled Pair States at Finite Temperature
- Long-range entanglement is necessary for a topological storage of quantum information