A simple efficient algorithm in frustration-free one-dimensional gapped systems
Yichen Huang

TL;DR
This paper introduces a simplified and accessible algorithm for finding the ground state of frustration-free one-dimensional gapped Hamiltonians, making advanced quantum many-body techniques more approachable.
Contribution
It presents a significantly simpler algorithm than previous methods, with detailed explanations suitable for a broad audience.
Findings
Algorithm is more straightforward than previous approaches
Efficient in terms of computational complexity
Accessible to non-specialists in the field
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum many-body systems · Quantum chaos and dynamical systems · Quantum Chromodynamics and Particle Interactions
