AI 中文总结
本文将经典的Find Erasures and Decode算法适配为量子扩展码的Find Rows and Columns and Decode算法，该算法线性时间可并行，比Small Set Flip等开销低、纠错能力强。
AI 中文摘要
本文提出了经典的Find Erasures and Decode算法向量子扩展码的一种新适配方案，该算法运行时间为线性，可并行至对数深度。与Small Set Flip和Small Set Find相比，新算法避免了考虑稳定子生成元子集的开销，所需扩展更少，且能纠正更多错误。
英文摘要
A new adaptation of the Find Erasures and Decode algorithm from classical to quantum expander codes is presented. It runs in linear time and is parallelizable to logarithmic depth. Compared to Small Set Flip and Small Set Find, the new algorithm avoids the overhead of considering the subsets of stabilizer generators, requires less expansion and corrects more errors.
