论文标题
来自古典LTC的NLT汉密尔顿人
NLTS Hamiltonians from classical LTCs
论文作者
论文摘要
我们根据[Anshu，Breuckmann和Nirkhe，2022]的想法提供了一个完全独立的汉密尔顿家族[Freedman and Hastings，2014]，[Cross，He，Natarajan，Szegedy和Zhu，szegedy和Zhu，2022]以及[Eldar and Harrow，2017]。至关重要的是，它不需要最佳参数Quantum LDPC代码，并且可以由简单的经典LTC（例如Expander Graph上的重复代码）构建。此外，它从Anshu，Breuckmann和Nirkhe的构建中消除了恒定率的要求。
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.
