2000 character limit reached
A polynomial-time algorithm for the ground state of one-dimensional gapped Hamiltonians (1406.6355v6)
Published 24 Jun 2014 in cond-mat.str-el, cs.DS, and quant-ph
Abstract: A (deterministic) polynomial-time algorithm is proposed for approximating the ground state of (general) one-dimensional gapped Hamiltonians. Let $\epsilon,n,\eta$ be the energy gap, the system size, and the desired precision, respectively. Neglecting $\epsilon$-dependent subpolynomial (in $n$) and constant factors, the running time of the algorithm is $n{O(1)}$ for $\eta=n{-O(1)}$.