A new decoding algorithm for quantum expander codes has been proposed in an unreviewed preprint posted to arXiv. Dubbed "Find Rows and Columns and Decode" (FRCD), it adapts the classical "Find Erasures and Decode" strategy to the quantum setting, operating in linear time and parallelizable to logarithmic depth—properties that matter considerably for practical fault-tolerant quantum computation.
The authors claim FRCD compares favorably to existing approaches such as Small Set Flip and Small Set Find. Specifically, they argue it sidesteps the computational overhead of enumerating subsets of stabilizer generators, demands less expansion from the underlying expander graph, and corrects a larger class of errors. Expander codes are attractive for quantum error correction because their sparse, highly connected structure enables efficient decoding, and improvements in that decoding pipeline could meaningfully affect the resource overhead of large-scale quantum systems.
As with all arXiv preprints, this work has not yet undergone peer review, and the claimed advantages over competing algorithms should be treated as preliminary. Independent verification of the error-correction thresholds and the precise expansion requirements will be needed before the results can be considered established.