Publication: NLTS Hamiltonians from Good Quantum Codes
No Thumbnail Available
Open/View Files
Date
2023-06-02
Published Version
Journal Title
Journal ISSN
Volume Title
Publisher
ACM
The Harvard community has made this article openly available. Please share how this access benefits you.
Citation
Anshu, Anurag, Nikolas P. Breuckmann, and Chinmay Nirkhe. "NLTS Hamiltonians from good quantum codes." In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 1090-1096. 2023.
Research Data
Abstract
The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastings [2014] posits that there exist families of Hamiltonians with all low energy states of non-trivial complexity (with complexity measured by the quantum circuit depth preparing the state). We prove this conjecture by showing that the recently discovered families of constant-rate and linear-distance QLDPC codes correspond to NLTS local Hamiltonians.
Description
Other Available Sources
Keywords
Terms of Use
This article is made available under the terms and conditions applicable to Open Access Policy Articles (OAP), as set forth at Terms of Service