Abstract
Tensor Network states form a powerful framework for both the analytical and numerical study of strongly correlated phases. Vital to their analytical utility is that they appear as the exact ground states of associated parent Hamiltonians, where canonical proof techniques guarantee a controlled ground space structure. Yet, while those Hamiltonians are local by construction, the known techniques often yield complex Hamiltonians which act on a rather large number of spins. In this paper, we present an algorithm to systematically simplify parent Hamiltonians, breaking them down into any given basis of elementary interaction terms. The underlying optimization problem is a semidefinite program, and thus the optimal solution can be found efficiently. Our method exploits a degree of freedom in the construction of parent Hamiltonians -- the excitation spectrum of the local terms -- over which it optimizes such as to obtain the best possible approximation. We benchmark our method on the AKLT model and the Toric Code model, where we show that the canonical parent Hamiltonians (acting on 3 or 4 and 12 sites, respectively) can be broken down to the known optimal 2-body and 4-body terms. We then apply our method to the paradigmatic Resonating Valence Bond (RVB) model on the kagome lattice. Here, the simplest previously known parent Hamiltonian acts on all the 12 spins on one kagome star. With our optimization algorithm, we obtain a vastly simpler Hamiltonian: We find that the RVB model is the exact ground state of a parent Hamiltonian whose terms are all products of at most four Heisenberg interactions, and whose range can be further constrained, providing a major improvement over the previously known 12-body Hamiltonian.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.