NLTS Hamiltonians from Good Quantum Codes

47Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastings 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 a particular family of constant-rate and linear-distance qLDPC codes correspond to NLTS local Hamiltonians, although we believe this to be true for all current constructions of good qLDPC codes.

Cite

CITATION STYLE

APA

Anshu, A., Breuckmann, N. P., & Nirkhe, C. (2023). NLTS Hamiltonians from Good Quantum Codes. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 1090–1096). Association for Computing Machinery. https://doi.org/10.1145/3564246.3585114

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free