MaxSAT decoders for arbitrary CSS codes
<|reference_start|>MaxSAT decoders for arbitrary CSS codes: Quantum error correction (QEC) is essential for operating quantum computers in the presence of noise. Here, we accurately decode arbitrary Calderbank-Shor-Steane (CSS) codes via the maximum satisfiability (MaxSAT) problem. We show how to map quantum maximum likelihood problem of CSS codes of arbitrary geometry and parity check weight into MaxSAT problems. We incorporate the syndrome measurements as hard clauses, while qubit and measurement error probabilities, including biased and non-uniform, are encoded as soft MaxSAT clauses. For the code capacity of color codes on a hexagonal lattice, our decoder has a higher threshold and superior scaling in noise suppression compared to belief propagation with ordered statistics post-processing (BP-OSD), while showing similar scaling in computational cost. Further, we decode surface codes and recently proposed bivariate quantum low-density parity check (QLDPC) codes where we find lower error rates than BP-OSD. Finally, we connect the complexity of MaxSAT decoding to a computational phase transition controlled by the clause density of the MaxSAT problem, where we show that our mapping is always in the computationally ''easy`` phase. Our MaxSAT decoder can be further parallelised or implemented on ASICs and FPGAs, promising potential further speedups of several orders of magnitude. Our work provides a flexible platform towards practical applications on quantum computers.<|reference_end|>
@article{noormandipour2024maxsat,
    title={MaxSAT decoders for arbitrary CSS codes},
    author={Mohammadreza Noormandipour and Tobias Haug},
    journal={arXiv preprint arXiv:2410.01673},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.01673},
    primaryClass={quant-ph cs.IT math.IT}
}