Published February 3, 2016
| Submitted
Report
Open
A simple efficient algorithm in frustration-free one-dimensional gapped systems
- Creators
- Huang, Yichen
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.
Additional Information
Dated: November 5, 2015. We acknowledge funding provided by the Institute for Quantum Information and Matter, an NSF Physics Frontiers Center (NSF Grant PHY-1125565) with support of the Gordon and Betty Moore Foundation (GBMF-12500028). In May 2015, Zeph Landau announced his joint work with Itai Arad, Umesh Vazirani, and Thomas Vidick on related problems in a talk [6] at the Simons Institute for the Theory of Computing. From the talk, the connection between their approach and the one in the present paper was not clear to me. Thanks to the correspondence with ZL in mid-October 2015, I realized that my approach has some overlap with theirs. Although the present work is independent, IA, ZL, UV, & TV deserve the credit of the overlapping part because they had the ideas since May 2015. They will post their results soon.Attached Files
Submitted - 1510.01303v3.pdf
Files
1510.01303v3.pdf
Files
(240.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:0cc5baf850e00d1cd1565757d91f9892
|
240.2 kB | Preview Download |
Additional details
- Eprint ID
- 64142
- Resolver ID
- CaltechAUTHORS:20160201-153526027
- Institute for Quantum Information and Matter (IQIM)
- PHY-1125565
- NSF Physics Frontiers Center
- GBMF-12500028
- Gordon and Betty Moore Foundation
- Created
-
2016-02-03Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field
- Caltech groups
- Institute for Quantum Information and Matter