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

NLTS哈密顿量与来自低速率量子LDPC码的强显式SoS下界

NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes

Louis Golowich, Tali Kaufman

AI总结:

利用低速率量子LDPC码,改进NLTS哈密顿量构造至任意小正维度,并通过植入非平凡码字实现强显式SoS下界。

摘要:

最近首次构造的渐近好量子LDPC(qLDPC)码在复杂性理论中引发了两项突破:NLTS(无低能平凡态)定理(Anshu, Breuckmann, 和 Nirkhe, STOC'23),以及针对平方和(SoS)层级线性级数的显式下界(Hopkins 和 Lin, FOCS'22)。在本工作中,我们利用低速率qLDPC码对这两个结果进行了改进:- 而Anshu等人仅从线性维度的qLDPC码获得NLTS哈密顿量,我们证明了更强的结果:任意小正维度的qLDPC码都能产生NLTS哈密顿量。- Hopkins和Lin的SoS下界仅是弱显式的,因为它们需要运行高斯消元来寻找非平凡码字,这需要多项式时间。我们通过引入一种在线性距离qLDPC码中植入强显式非平凡码字的新方法解决了这一缺陷,进而得到强显式的SoS下界。我们的“植入”qLDPC码可能具有独立意义,因为它们提供了一种无需依赖奇偶校验计数即可确保qLDPC码具有正维度的新途径,从而在码构造中提供了更大的灵活性。

英文摘要:

Recent constructions of the first asymptotically good quantum LDPC (qLDPC) codes led to two breakthroughs in complexity theory: the NLTS (No Low-Energy Trivial States) theorem (Anshu, Breuckmann, and Nirkhe, STOC'23), and explicit lower bounds against a linear number of levels of the Sum-of-Squares (SoS) hierarchy (Hopkins and Lin, FOCS'22). In this work, we obtain improvements to both of these results using qLDPC codes of low rate: - Whereas Anshu et al. only obtained NLTS Hamiltonians from qLDPC codes of linear dimension, we show the stronger result that qLDPC codes of arbitrarily small positive dimension yield NLTS Hamiltonians. - The SoS lower bounds of Hopkins and Lin are only weakly explicit because they require running Gaussian elimination to find a nontrivial codeword, which takes polynomial time. We resolve this shortcoming by introducing a new method of planting a strongly explicit nontrivial codeword in linear-distance qLDPC codes, which in turn yields strongly explicit SoS lower bounds. Our "planted" qLDPC codes may be of independent interest, as they provide a new way of ensuring a qLDPC code has positive dimension without resorting to parity check counting, and therefore provide more flexibility in the code construction.

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

↑