We introduce a quantum Maxwell erasure decoder for CSS quantum low-density parity-check (qLDPC) codes that extends peeling with bounded guessing. Guesses are tracked symbolically and can be eliminated by restrictive checks, giving a tunable tradeoff between complexity and performance via a guessing budget: an unconstrained budget recovers Maximum-Likelihood (ML) performance, while a constant budget yields linear-time decoding and approximates ML. We provide theoretical guarantees on asymptotic performance and demonstrate strong performance on bivariate bicycle and quantum Tanner codes.

翻译：我们提出了一种针对CSS量子低密度奇偶校验（qLDPC）码的量子麦克斯韦擦除解码器，该解码器通过有界猜测扩展了剥离解码。猜测以符号形式进行跟踪，并可通过限制性校验消除，从而通过猜测预算实现复杂度与性能之间的可调权衡：无约束预算可恢复最大似然（ML）性能，而恒定预算则实现线性时间解码并近似ML性能。我们提供了关于渐近性能的理论保证，并在双变量自行车码和量子坦纳码上展示了优异的性能表现。