NLTS Hamiltonians from good quantum codes

Citation:

Anurag Anshu, Nikolas P. Breuckmann, and Chinmay Nirkhe. 6/27/2022. “NLTS Hamiltonians from good quantum codes.” 55th Annual ACM Symposium on Theory of Computing (STOC 2023). ACM. Publisher's Version

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.

Notes:

  • Quanta magazine article on the paper.
  • QIP 2023 (plenary talk)
Last updated on 06/04/2023