论文标题
线性距离量子LDPC代码的有效解码器
An efficient decoder for a linear distance quantum LDPC code
论文作者
论文摘要
最近的事态发展表明，量子低密度平价检查（QLDPC）的存在具有恒定速率和线性距离。一个自然的问题涉及这些代码的有效解释性。在本文中，我们提出了一个线性时间解码器，用于近期量子制革商编码渐近良好的QLDPC代码的构建，该代码可以纠正所有重量误差，最高为恒定分数的恒定分数。我们的解码器是一种迭代算法，它在恒定区域内搜索校正。在每个步骤中，都可以通过减少本地定义且有效计算的成本函数来找到校正，该函数可作为剩余误差重量的代理。
Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient decodability of these codes. In this paper, we present a linear time decoder for the recent quantum Tanner codes construction of asymptotically good qLDPC codes, which can correct all errors of weight up to a constant fraction of the blocklength. Our decoder is an iterative algorithm which searches for corrections within constant-sized regions. At each step, the corrections are found by reducing a locally defined and efficiently computable cost function which serves as a proxy for the weight of the remaining error.
