English
Related papers

Related papers: The closed-branch decoder for quantum LDPC codes

200 papers

Quantum low-density parity-check (qLDPC) codes are an important component in the quest for quantum fault tolerance. Dramatic recent progress on qLDPC codes has led to constructions which are asymptotically good, and which admit linear-time…

Quantum Physics · Physics 2024-11-08 Louis Golowich , Venkatesan Guruswami

Quantum low-density parity-check (QLDPC) codes are among the most promising candidates for future quantum error correction schemes. However, a limited number of short to moderate-length QLDPC codes have been designed and their decoding…

Information Theory · Computer Science 2024-05-07 Sisi Miao , Jonathan Mandelbaum , Holger Jäkel , Laurent Schmalen

Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient decodability of these codes. In this paper, we present a linear…

Quantum Physics · Physics 2022-06-15 Shouzhen Gu , Christopher A. Pattison , Eugene Tang

Decoding quantum error-correcting codes is a key challenge in enabling fault-tolerant quantum computation. In the classical setting, linear programming (LP) decoders offer provable performance guarantees and can leverage fast practical…

Quantum Physics · Physics 2025-08-08 Shouzhen Gu , Mehdi Soleimanifar

Fault tolerance in quantum protocols requires contributions from error-correcting codes and their suitable decoders. Quantum Low-Density Parity Check (QLDPC) codes are one of the most explored quantum codes that have good coding rate and…

Quantum Physics · Physics 2026-04-24 Mainak Bhattacharyya , Ankur Raina

We propose a decoder for quantum low density parity check (LDPC) codes based on a beam search heuristic guided by belief propagation (BP). Our beam search decoder applies to all quantum LDPC codes and achieves different speed-accuracy…

Quantum Physics · Physics 2025-12-18 Min Ye , Dave Wecker , Nicolas Delfosse

Quantum low-density parity-check (QLDPC) codes have been proven to achieve higher minimum distances at higher code rates than surface codes. However, this family of codes imposes stringent latency requirements and poor performance under…

Information Theory · Computer Science 2024-06-26 Dimitris Chytas , Nithin Raveendran , Bane Vasić

Quantum low-density parity-check (QLDPC) codes have emerged as a promising technique for quantum error correction. A variety of decoders have been proposed for QLDPC codes and many of them utilize belief propagation (BP) decoding in some…

Information Theory · Computer Science 2024-06-25 Hanwen Yao , Waleed Abu Laban , Christian Häger , Alexandre Graell i Amat , Henry D. Pfister

Quantum error correction (QEC) is a cornerstone of quantum computing, enabling reliable information processing in the presence of noise. Sparse stabilizer codes -- referred to generally as quantum low-density parity-check (QLDPC) codes --…

Quantum Physics · Physics 2025-10-20 Bane Vasic , Valentin Savin , Michele Pacenti , Shantom Borah , Nithin Raveendran

Quantum Error Correction (QEC) is an essential field of research towards the realization of large-scale quantum computers. On the theoretical side, a lot of effort is put into designing error-correcting codes that protect quantum data from…

Quantum Physics · Physics 2023-02-10 Lucas Berent , Lukas Burgholzer , Robert Wille

Hardware-friendly quantum low-density parity-check (QLDPC) decoders are commonly built upon belief propagation (BP) processing. Yet, quantum degeneracy often prevents BP from achieving reliable convergence. To overcome this fundamental…

Quantum Physics · Physics 2025-11-18 Lorenzo Valentini , Diego Forlivesi , Andrea Talarico , Marco Chiani

Quantum low-density parity-check (qLDPC) codes are promising for realizing scalable fault-tolerant quantum computation due to their potential for low-overhead protocols. A common approach to decoding qLDPC codes is to use the belief…

Quantum Physics · Physics 2025-10-13 Kento Tsubouchi , Hayata Yamasaki , Shiro Tamiya

Error correction allows a quantum computer to preserve states long beyond the decoherence time of its physical qubits. Key to any scheme of error correction is the decoding algorithm, which estimates the error state of qubits from the…

Quantum Physics · Physics 2025-01-06 Stasiu Wolanski , Ben Barber

Quantum error correction (QEC) is critical for scalable and reliable quantum computing, but existing solutions, such as surface codes, incur significant qubit overhead. Quantum low-density parity check (qLDPC) codes have recently emerged as…

Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers. One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder. In this…

Quantum Physics · Physics 2025-02-18 Sisi Miao , Alexander Schnerring , Haizheng Li , Laurent Schmalen

Quantum error correction (QEC) is critical for practical realization of fault-tolerant quantum computing, and recently proposed families of quantum low-density parity-check (QLDPC) code are prime candidates for advanced QEC hardware…

Information Theory · Computer Science 2025-03-11 Nithin Raveendran , David Declercq , Bane Vasić

Quantum error correction is an indispensable ingredient for scalable quantum computing. In this Perspective we discuss a particular class of quantum codes called low-density parity-check (LDPC) quantum codes. The codes we discuss are…

Quantum Physics · Physics 2021-10-26 Nikolas P. Breuckmann , Jens Niklas Eberhardt

It is widely accepted that quantum error correction is essential for realizing large-scale fault-tolerant quantum computing. Recent experiments have demonstrated error correction codes operating below threshold, primarily using local planar…

Quantum Physics · Physics 2026-01-21 Christian Kraglund Andersen , Eliška Greplová

We study the performance of medium-length quantum LDPC (QLDPC) codes in the depolarizing channel. Only degenerate codes with the maximal stabilizer weight much smaller than their minimum distance are considered. It is shown that with the…

Quantum Physics · Physics 2021-11-24 Pavel Panteleev , Gleb Kalachev

We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff and efficient list decoding up to the Johnson bound in polynomial time. Previous constructions of list decodable good distance…

Information Theory · Computer Science 2024-11-08 Thiago Bergamaschi , Fernando Granha Jeronimo , Tushant Mittal , Shashank Srivastava , Madhur Tulsiani
‹ Prev 1 2 3 10 Next ›