Despite significant progress on quantum low-density parity-check (qLDPC) codes, building qLDPC processors that are high-rate, high-throughput, hardware-friendly, and fast-to-decode remains a challenge...

The early days of fault-tolerant quantum computing (FTQC) are rapidly approaching. Many contemporary architecture proposals are built on quantum low-density parity-check (QLDPC) codes — a subject that...

It is the prevailing belief that quantum error correcting techniques will be required to build a utility-scale quantum computer able to perform computations that are out of reach of classical computer...

Quantum low-density parity-check (QLDPC) codes offer lower overhead than topological quantum error-correcting codes, but decoding remains a key challenge for scalable fault-tolerant quantum computing....

Quantum low-density parity-check (QLDPC) codes offer lower overhead than topological quantum error-correcting codes, but decoding remains a key challenge for scalable fault-tolerant quantum computing....

We introduce a new heuristic decoder, Relay-BP, targeting real-time quantum circuit decoding for large-scale quantum computers. Relay-BP achieves high accuracy across circuit-noise decoding problems: ...

This work focuses on growing our understanding of how high dimensional expanders (HDX) can be utilized to construct highly performant quantum codes. While asymptotically good qLDPC codes have been con...

YouTube video by DJ iD01t

In pursuit of large-scale fault-tolerant quantum computation, quantum low-density parity-check (LPDC) codes have been established as promising candidates for low-overhead memory when compared to conve...

Mingyu Kang, Yingjia Lin, Hanwen Yao, Mert Gökduman, Arianna Meinking, and Kenneth R. Brown, Quantum 9, 1931 (2025). To achieve quantum fault tolerance with lower overhead, quantum low-density parity-...

In pursuit of large-scale fault-tolerant quantum computation, quantum low-density parity-check (LPDC) codes have been established as promising candidates for low-overhead memory when compared to conventional approaches based on surface codes. Performing fault-tolerant logical computation on QLDPC memory, however, has been a long standing challenge in theory and in practice. In this work, we propose a new primitive, which we call an $\textit{extractor system}$, that can augment any QLDPC memory into a computational block well-suited for Pauli-based computation. In particular, any logical Pauli operator supported on the memory can be fault-tolerantly measured in one logical cycle, consisting of $O(d)$ physical syndrome measurement cycles, without rearranging qubit connectivity. We further propose a fixed-connectivity, LDPC architecture built by connecting many extractor-augmented computational (EAC) blocks with bridge systems. When combined with any user-defined source of high fidelity $|T\rangle$ states, our architecture can implement universal quantum circuits via parallel logical measurements, such that all single-block Clifford gates are compiled away. The size of an extractor on an $n$ qubit code is $\tilde{O}(n)$, where the precise overhead has immense room for practical optimizations.