We identify a large class of quantum many-body systems that can be solved exactly: natural frustration-free spin-1/2 nearest-neighbor Hamiltonians on arbitrary lattices. We show that the entire ground-state manifold of such models can be found exactly by a tensor network of isometries acting on a space locally isomorphic to the symmetric subspace. Thus, for this wide class of models, real-space renormalization can be made exact. Our findings also imply that every such frustration-free spin model satisfies an area law for the entanglement entropy of the ground state, establishing a novel large class of models for which an area law is known. Finally, we show that our approach gives rise to an ansatz class useful for the simulation of almost frustration-free models in a simple fashion, outperforming mean-field theory.
We identify a large class of quantum many-body systems that can be solved exactly: natural frustration-free spin-1/2 nearest-neighbor Hamiltonians on arbitrary lattices. We show that the entire ground-state manifold of such models can be found exactly by a tensor network of isometries acting on a space locally isomorphic to the symmetric subspace. Thus, for this wide class of models, real-space renormalization can be made exact. Our findings also imply that every such frustration-free spin model satisfies an area law for the entanglement entropy of the ground state, establishing a novel large class of models for which an area law is known. Finally, we show that our approach gives rise to an ansatz class useful for the simulation of almost frustration-free models in a simple fashion, outperforming mean-field theory.
We show that ground states of unfrustrated quantum spin-1/2 systems on general lattices satisfy an entanglement area law, provided that the Hamiltonian can be decomposed into nearest-neighbor interaction terms that have entangled excited states. The ground state manifold can be efficiently described as the image of a low-dimensional subspace of low Schmidt measure, under an efficiently contractible tree-tensor network. This structure gives rise to the possibility of efficiently simulating the complete ground space (which is in general degenerate). We briefly discuss 'non-generic' cases, including highly degenerate interactions with product eigenbases, using a relationship to percolation theory. We finally assess the possibility of using such tree tensor networks to simulate almost frustration-free spin models.
We prove that the entanglement entropy of the ground state of a locally gapped frustration-free 2D lattice spin system satisfies an area law with respect to a vertical bipartition of the lattice into left and right regions. We first establish that the ground state projector of any locally gapped frustration-free 1D spin system can be approximated to within error є by a degree O(√nlog(є−1)) multivariate polynomial in the interaction terms of the Hamiltonian. This generalizes the optimal bound on the approximate degree of the boolean AND function, which corresponds to the special case of commuting Hamiltonian terms. For 2D spin systems we then construct an approximate ground state projector (AGSP) that employs the optimal 1D approximation in the vicinity of the boundary of the bipartition of interest. This AGSP has sufficiently low entanglement and error to establish the area law using a known technique.
Classical simulation of quantum many-body systems is in general a challenging problem for the simple reason that the dimension of the Hilbert space grows exponentially with the system size. In particular, merely encoding a generic quantum many-body state requires an exponential number of bits. However, condensed matter physicists are mostly interested in local Hamiltonians and especially their ground states, which are highly non-generic. Thus, we might hope that at least some physical systems allow efficient classical simulation.Starting with one-dimensional (1D) quantum systems (i.e., the simplest nontrivial case), the first basic question is: Which classes of states have efficient classical representations? It turns out that this question is quantitatively related to the amount of entanglement in the state, for states with ``little entanglement'' are well approximated by matrix product states (a data structure that can be manipulated efficiently on a classical computer). At a technical level, the mathematical notion for ``little entanglement'' is area law, which has been proved for unique ground states in 1D gapped systems. We establish an area law for constant-fold degenerate ground states in 1D gapped systems and thus explain the effectiveness of matrix-product-state methods in (e.g.) symmetry breaking phases. This result might not be intuitively trivial as degenerate ground states in gapped systems can be long-range correlated.Suppose an efficient classical representation exists. How can one find it efficiently? The density matrix renormalization group is the leading numerical method for computing ground states in 1D quantum systems. However, it is a heuristic algorithm and the possibility that it may fail in some cases cannot be completely ruled out. Recently, a provably efficient variant of the density matrix renormalization group has been developed for frustration-free 1D gapped systems. We generalize this algorithm to all (i.e., possibly frustrated) 1D gapped systems. Note that the ground-state energy of 1D gapless Hamiltonians is computationally intractable even in the presence of translational invariance.It is tempting to extend methods and tools in 1D to two and higher dimensions (2+D), e.g., matrix product states are generalized to tensor network states. Since an area law for entanglement (if formulated properly) implies efficient matrix product state representations in 1D, an interesting question is whether a similar implication holds in 2+D. Roughly speaking, we show that an area law for entanglement (in any reasonable formulation) does not always imply efficient tensor network representations of the ground states of 2+D local Hamiltonians even in the presence of translational invariance. It should be emphasized that this result does not contradict with the common sense that in practice quantum states with more entanglement usually require more space to be stored classically; rather, it demonstrates that the relationship between entanglement and efficient classical representations is still far from being well understood.Excited eigenstates participate in the dynamics of quantum systems and are particularly relevant to the phenomenon of many-body localization (absence of transport at finite temperature in strongly correlated systems). We study the entanglement of excited eigenstates in random spin chains and expect that its singularities coincide with dynamical quantum phase transitions. This expectation is confirmed in the disordered quantum Ising chain using both analytical and numerical methods.Finally, we study the problem of generating ground states (possibly with topological order) in 1D gapped systems using quantum circuits. This is an interesting problem both in theory and in practice. It not only characterizes the essential difference between the entanglement patterns that give rise to trivial and nontrivial topological order, but also quantifies the difficulty of preparing quantum states with a quantum computer (in experiments).
We present a numerical method based on real-space renormalization that outputs the exact ground space of ``frustration-free'' Hamiltonians. The complexity of our method is polynomial in the degeneracy of the ground spaces of the Hamiltonians involved in the renormalization steps. We apply the method to obtain the full ground spaces of two spin systems. The first system is a spin-1/2 Heisenberg model with four-spin cyclic-exchange interactions defined on a square lattice. In this case, we study finite lattices of up to 160 spins and find a triplet ground state that differs from the singlet ground states obtained by Batista and Trugman, [Phys. Rev. Lett. 93, 217202 (2004)]. We characterize such a triplet state as consisting of a triplon that propagates in a background of fluctuating singlet dimers. The second system is a family of spin-1/2 Heisenberg chains with uniaxial exchange anisotropy and next-nearest-neighbor interactions. In this case, the method finds a ground-space degeneracy that scales quadratically with the system size and outputs the full ground space efficiently. Our method can substantially outperform methods based on exact diagonalization and is more efficient than other renormalization methods when the ground-space degeneracy is large.
In spin systems, geometrical frustration describes the impossibility of minimizing simultaneously all the interactions in a Hamiltonian, often giving rise to macroscopic ground-state degeneracies and emergent low-temperature physics. In this thesis, combining tensor network (TN) methods to Monte Carlo (MC) methods and ground-state energy lower bound approaches, we study two-dimensional frustrated classical Ising models. In particular, we focus on the determination of the residual entropy in the presence of farther-neighbor interactions in kagome lattice Ising antiferromagnets (KIAFM). In general, using MC to determine the residual entropy is a significant challenge requiring ad-hoc updates, a precise evaluation of the energy at all temperatures to allow for thermodynamic integration, and a good control of the finite-size scaling behavior. As an alternative, we turn to TNs; however, we argue that, in the presence of frustration and macroscopic ground-state degeneracy, standard algorithms fail to converge at low temperatures on the usual TN formulation of partition functions. Inspired by methods for constructing ground-state energy lower bounds, we propose a systematic way to find the ground-state local rule using linear programming. Characterizing the rules as tiles that can be tessellated to form ground states of the model gives rise to a natural contractible TN formulation of the partition function. This method provides a direct access to the ground-state properties of frustrated models and, in particular, allows an extremely precise determination of their residual entropy. We then study two models inspired by artificial spin systems on the kagome lattice with out-of-plane (OOP) anisotropy. The first model is motivated by experiments on an array of chirally coupled nanomagnets. We argue that the farther-neighbor to nearest-neighbor couplings ratios in this system are much smaller than in the dipolar case, J2/J1 being of the order of 2%. A comparison of the experimental correlations with the results of extensive TN and MC simulations shows that (1) the experimental second- and third-neighbor correlations are inverted as compared to those of a pure nearest-neighbor model at equilibrium (even with a magnetic field), and (2) second-neighbor couplings as small as 1% of the nearest-neighbor couplings will affect the spin-spin correlations even at fairly high temperatures. Motivated by dipolar coupled artificial spin systems, we turn to the progressive lifting of the ground-state degeneracy of the KIAFM. We provide a detailed study of the ground-state phases of this model with up to third neighbor interactions, for arbitrary J2, J3 such that J1 >> J2, J3, obtaining exact results for the ground-state energies. When all couplings are antiferromagnetic, we exhibit three macroscopically degenerate ground-state phases and establish their residual entropy using our TN approach. Furthermore, in the phase corresponding to the dipolar KIAFM truncated to third neighbors, we use the ground-state tiles to establish the existence of a mapping to the ground-state manifold of the triangular Ising antiferromagnet.
Frustration is a ubiquitous phenomenon in many-body physics that influences the nature of the system in a profound way with exotic emergent behavior. Despite its long research history, the analytical or numerical investigations on frustrated spin models remain a formidable challenge due to their extensive ground-state degeneracy. In this paper, we propose a unified tensor network theory to numerically solve the frustrated classical spin models on various two-dimensional (2D) lattice geometry with high efficiency. We show that the appropriate encoding of emergent degrees of freedom in each local tensor is of crucial importance in the construction of the infinite tensor network representation of the partition function. The frustrations are thus relieved through the effective interactions between emergent local degrees of freedom. Then the partition function is written as a product of a one-dimensional (1D) transfer operator, whose eigenequation can be solved by the standard algorithm of matrix product states rigorously, and various phase transitions can be accurately determined from the singularities of the entanglement entropy of the 1D quantum correspondence. We demonstrated the power of our general theory by numerically solving 2D fully frustrated XY spin models on the kagome, square, and triangular lattices, giving rise to a variety of thermal phase transitions from infinite-order Brezinskii-Kosterlitz-Thouless transitions, second-order transitions, to first-order phase transitions. Our approach holds the potential application to other types of frustrated classical systems like Heisenberg spin antiferromagnets.