Export Publication

Monteiro, F. A., Ferraz, O., Coutinho, B. C., Gomes, M., Falcão, G. & Silva, V. (2025). GPU-Accelerated Syndrome Decoding for Quantum LDPC Codes below the 63 microsecond Latency Threshold. Asilomar Conference on Signals, Systems, and Computers.

F. A. Monteiro et al.,  "GPU-Accelerated Syndrome Decoding for Quantum LDPC Codes below the 63 microsecond Latency Threshold", in Asilomar Conf. on Signals, Systems, and Computers, Urbana, Illinois, 2025

@misc{monteiro2025_1764931212974,
	author = "Monteiro, F. A. and Ferraz, O. and Coutinho, B. C. and Gomes, M. and Falcão, G. and Silva, V.",
	title = "GPU-Accelerated Syndrome Decoding for Quantum LDPC Codes below the 63 microsecond Latency Threshold",
	year = "2025",
	howpublished = "Digital",
	url = "https://allerton.csl.illinois.edu"
}

TY  - CPAPER
TI  - GPU-Accelerated Syndrome Decoding for Quantum LDPC Codes below the 63 microsecond Latency Threshold
T2  - Asilomar Conference on Signals, Systems, and Computers
AU  - Monteiro, F. A.
AU  - Ferraz, O.
AU  - Coutinho, B. C.
AU  - Gomes, M.
AU  - Falcão, G.
AU  - Silva, V.
PY  - 2025
CY  - Urbana, Illinois
UR  - https://allerton.csl.illinois.edu
AB  - This paper presents a GPU-accelerated decoder for quantum low-density parity-check (QLDPC) codes that achieves sub-63 microseconds latency, below the surface code decoder's real-time threshold demonstrated on Google's Willow quantum processor. While surface codes have demonstrated below-threshold performance, the encoding rates approach zero as code distances increase, posing challenges for scalability. Recently proposed QLDPC codes, such as those by Panteleev and Kalachev, offer constant-rate encoding and asymptotic goodness but introduce higher decoding complexity. To address such limitation, this work presents a parallelized belief propagation decoder leveraging syndrome information on commodity GPU hardware. Parallelism was exploited to maximize performance within the limits of target latency, allowing decoding latencies under 50 microseconds for [[784, 24 , 24 ]] codes and as low as  for smaller codes, meeting the tight timing constraints of superconducting qubit cycles. These results show that real-time, scalable decoding of asymptotically good quantum codes is achievable using widely available commodity hardware, advancing the feasibility of fault-tolerant quantum computation beyond surface codes.
ER  -