  We provide a completely self-contained construction of a family of NLTS
Hamiltonians [Freedman and Hastings, 2014] based on ideas from [Anshu,
Breuckmann, and Nirkhe, 2022], [Cross, He, Natarajan, Szegedy, and Zhu, 2022]
and [Eldar and Harrow, 2017]. Crucially, it does not require optimal-parameter
quantum LDPC codes and can be built from simple classical LTCs such as the
repetition code on an expander graph. Furthermore, it removes the constant-rate
requirement from the construction of Anshu, Breuckmann, and Nirkhe.
