• Corpus ID: 195886249

A polynomial-time algorithm for ground states of spin trees

  title={A polynomial-time algorithm for ground states of spin trees},
  author={Nilin Abrahamsen},
  journal={arXiv: Quantum Physics},
  • Nilin Abrahamsen
  • Published 10 July 2019
  • Physics, Mathematics
  • arXiv: Quantum Physics
We prove that the ground states of a local Hamiltonian satisfy an area law and can be computed in polynomial time when the interaction graph is a tree with discrete fractal dimension $\beta<2$. This condition is met for generic trees in the plane and for established models of hyperbranched polymers in 3D. This work is the first to prove an area law and exhibit a provably polynomial-time classical algorithm for local Hamiltonian ground states beyond the case of spin chains. Our algorithm outputs… 

Figures from this paper

Sub-exponential algorithm for 2D frustration-free spin systems with gapped subsystems
We show that in the setting of the subvolume law of [Anshu, Arad, Gosset '19] for 2D locally gapped frustration-free spin systems there exists a randomized classical algorithm which computes the
Sharp implications of AGSPs for degenerate ground spaces
We generalize the `off-the-rack' AGSP$\Rightarrow$entanglement bound implication of [Arad, Landau, and Vazirani '12] from unique ground states to degenerate ground spaces. Our condition
Area law of noncritical ground states in 1D long-range interacting systems
This work shows that for generic non-critical one-dimensional ground states with locally bounded Hamiltonians, the area law robustly holds without any corrections, even under long-range interactions, which guarantees an efficient description of ground states by the matrix-product state in experimentally relevant long- range systems, which justifies the density-matrix renormalization algorithm.
From communication complexity to an entanglement spread area law in the ground state of gapped local Hamiltonians
This work construction provides evidence for a conjecture in physics by Li and Haldane on the entanglement spectrum of lattice Hamiltonians, and uses recent advances in Hamiltonian simulation algorithms along with quantum phase estimation to give a new construction for an approximate ground space projector over arbitrary interaction graphs.
Improved Thermal Area Law and Quasilinear Time Algorithm for Quantum Gibbs States
One of the most fundamental problems in quantum many-body physics is the characterization of correlations among thermal states. Of particular relevance is the thermal area law, which justifies the


Computing the Degenerate Ground Space of Gapped Spin Chains in Polynomial Time
The main new idea is to incorporate the local distinguishability of ground states on the half-chain to ensure that the algorithm returns a complete set of global ground states.
A polynomial time algorithm for the ground state of one-dimensional gapped local Hamiltonians
The density matrix renormalization group method has been extensively used to study the ground state of 1D many-body systems since its introduction two decades ago. In spite of its wide use, this
An area law and sub-exponential algorithm for 1D systems
We give a new proof for the area law for general 1D gapped systems, which exponentially improves Hastings' famous result [1]. Specifically, we show that for a chain of d-dimensional spins, governed
Rigorous RG Algorithms and Area Laws for Low Energy Eigenstates in 1D
One of the central challenges in the study of quantum many-body systems is the complexity of simulating them on a classical computer. A recent advance (Landau et al. in Nat Phys, 2015) gave a
Entanglement subvolume law for 2d frustration-free spin systems
A new AGSP is constructed which is based on a robust polynomial approximation of the AND function and it achieves an improved trade-off between approximation error and entanglement, and represents a subvolume bound onEntanglement in frustration-free 2D systems.
Approximation algorithms for quantum many-body problems
We discuss classical algorithms for approximating the largest eigenvalue of quantum spin and fermionic Hamiltonians based on semidefinite programming relaxation methods. First, we consider traceless
Solving gapped Hamiltonians locally
We show that any short-range Hamiltonian with a gap between the ground and excited states can be written as a sum of local operators, such that the ground state is an approximate eigenvector of each
Product-State Approximations to Quantum States
We show that for any many-body quantum state there exists an unentangled quantum state such that most of the two-body reduced density matrices are close to those of the original state. This is a
Complexity Classification of Local Hamiltonian Problems
The calculation of ground-state energies of physical systems can be formalized as the $k$-local Hamiltonian problem, which is a natural quantum analogue of classical constraint satisfaction problems.
Connecting global and local energy distributions in quantum spin models on a lattice
Generally, the local interactions in a many-body quantum spin system on a lattice do not commute with each other. Consequently, the Hamiltonian of a local region will generally not commute with that