arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.07476quant-phcs.CCcs.ITmath.IT
收藏

高维立方复形的扩张及其在量子局部可检验码中的应用

Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes

Irit Dinur, Ting-Chun Lin, Thomas Vidick

AI总结:

本研究提出任意维度t>0的高维立方复形,借助局部码转化为链复形并证明其圈与上圈扩张下界,t=4时得到具有恒定相对码率等特性的近乎良好量子局部可检验码。

摘要:

我们针对任意维度t>0引入了一种高维立方复形,并将其应用于量子局部可检验码的设计。我们的复形是Panteleev与Kalachev以及Dinur等人所提出的平方复形(t=2的情形)的自然推广,这两类平方复形已分别被应用于经典局部可检验码(LTC)和量子低密度奇偶校验码(qLDPC)的设计。\n 我们以恒定规模的局部码$h_1,\ldots,h_t$作为构件,将几何(立方)复形转化为链复形。Panteleev与Kalachev近期关于乘积扩张码元组存在性的研究成果,使我们能够证明该链复形的圈扩张和上圈扩张的下界。\n 当t=4时,我们的构造得到了一类新的“近乎良好”的量子LTC——具有恒定相对码率、逆多对数相对距离和可靠性,以及恒定规模的奇偶校验。该量子码的距离及其局部可检验性均直接通过我们的链复形的圈扩张和上圈扩张得到证明。

英文摘要:

We introduce a high-dimensional cubical complex, for any dimension t>0, and apply it to the design of quantum locally testable codes. Our complex is a natural generalization of the constructions by Panteleev and Kalachev and by Dinur et. al of a square complex (case t=2), which have been applied to the design of classical locally testable codes (LTC) and quantum low-density parity check codes (qLDPC) respectively. We turn the geometric (cubical) complex into a chain complex by relying on constant-sized local codes $h_1,\ldots,h_t$ as gadgets. A recent result of Panteleev and Kalachev on existence of tuples of codes that are product expanding enables us to prove lower bounds on the cycle and co-cycle expansion of our chain complex. For t=4 our construction gives a new family of "almost-good" quantum LTCs -- with constant relative rate, inverse-polylogarithmic relative distance and soundness, and constant-size parity checks. Both the distance of the quantum code and its local testability are proven directly from the cycle and co-cycle expansion of our chain complex.

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

↑