arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2210.02999quant-phcs.CC
收藏

经典LTC的NLTS哈密顿量

NLTS Hamiltonians from classical LTCs

Zhiyang He, Chinmay Nirkhe

摘要:

我们基于[Anshu,Breuckmann,and Nirkhe,2022],[Cross,He,Natarajan,Szegedy,and Zhu,2022]和[Eldar and Harrow,2017]的思想,提供了NLTS Hamilton族[Freedman and Hastings,2014]的完全自包含的构造。关键是,它不需要最佳参数量子LDPC码,并且可以从简单的经典LTC(例如扩展图上的重复码)构建。此外,它还删除了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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑