An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise
Fault-tolerant quantum computers must be designed in conjunction with classical co-processors that decode quantum error correction measurement information in real-time. In this work, we introduce the belief propagation plus ordered Tanner forest (BP + OTF) algorithm as an almost-linear time decoder for quantum low-density parity-check codes. The OTF post-processing stage removes qubits from the decoding graph until it has a tree-like structure. Provided that the resultant loo
Researchers have developed a new algorithm called belief propagation plus ordered Tanner forest (BP + OTF) designed to decode quantum error correction measurements in real-time. This algorithm is intended for use with quantum low-density parity-check codes, which are crucial for fault-tolerant quantum computers. The BP + OTF method first processes information on a full graph and then refines it on a simplified, tree-like structure to ensure accurate decoding. Additionally, a technique for sparsifying detector error models was introduced to improve performance under circuit-level noise, preserving essential error information.
This advancement is significant because it offers a faster and more efficient way to decode quantum error correction codes, a critical component for building reliable quantum computers.
📌 Kaynak
Bu özet naturecom kaynağından otomatik derlenmiştir. Tamamı için orijinal habere gidin.
Orijinal haberi oku →