A simple efficient algorithm in frustration-free one-dimensional gapped systems
classification
❄️ cond-mat.str-el
quant-ph
keywords
algorithmefficientfrustration-freegappedone-dimensionalaccessibleaudiencecommunity
read the original abstract
We propose an efficient algorithm for the ground state of frustration-free one-dimensional gapped Hamiltonians. This algorithm is much simpler than the original one by Landau et al., and thus may be easily accessible to a general audience in the community. We present all the details in two pages.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.