Aug 2026· 1 citation· ⚡ 1 influential· 39 references
Physics
TL;DR
It is shown that edge symmetries can be exploited to design syndrome-extraction circuits from the underlying components, rather than from the full quantum code, to produce depth-optimal circuits from the underlying components.
Abstract
Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computing, but their practical implementation requires efficient circuits for syndrome extraction. Many qLDPC families are assembled from a small set of components through explicit operations that imprint edge symmetries on their Tanner graphs. We show that disassembling the code by quotienting its symmetries one at a time, reduces parity-check circuit design to a much smaller problem acting only on the underlying components. Solutions to the reduced problem can then be lifted to the full code, yielding circuit constructions that apply to entire families of codes built from the same components. For lifted-product codes, our approach provides an optimal analytical construction for parity-check circuits achieving the lower bound on CNOT depth. We obtain analogous constructions for balanced-product codes and quantum--classical homological product codes. For quantum Tanner codes, the reduced problem is small enough to solve numerically, reaching the CNOT-depth lower bound for nearly all instance tested, including codes with up to 576 data qubits.
This work proposes a novel design of high-rate Calderbank--Shor--Steane (CSS) quantum low-density parity-check (QLDPC) codes based on quasi-dyadic matrices based on quasi-dyadic matrices.
This work provides an explicit characterization in terms of the defining cyclotomic sets, which extends existing results for cyclic codes and allows the construction of new and longer CSS-T codes.
Delio Jaramillo-Velez, Alessandro Neri, Adway Patra et al.· 3 citations
This work introduces lifted surgery, a method for fast and parallel surgery on Abelian group algebra codes that maintains the low physical overhead that makes QLDPC codes attractive and offers a practical route towards low-overhead fault-tolerant quantum computing.
Lucas Berent, Lawrence Z. Cohen, A. O. Quintavalle· 6 citations
Inspired by recent affine-permutation-based code constructions and the long-range connectivity available in reconfigurable neutral-atom arrays, Cornucopia codes are introduced, a family of practical, hardware-efficient quantum low-density parity-check codes that achieve an ultra-high encoding rate exceeding $1/2 while...
An algorithm that uses random single-qubit measurements to learn the stabilizer generators of any stabilizer code from $N$ copies of stabilizer states in its codespace, requiring no prior knowledge of the code's structure is presented.
This work treats degenerate decoding as probabilistic inference in an undirected graphical model: the probability of each logical class is the partition function of an unconstrained, strictly positive Markov random field over the code's check variables, a construction that generalizes the random-bond Ising mapping of t...
R. Krishnamoorthy, Florian Gerhardt, Johannes Knaute et al.· 2 citations· ⚡1
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduNov 20, 2026
Senior Research Scientist Jim Glass discusses how his MIT-IBM Computing Research Lab collaboration connects perception and language, and addresses the shortcoming of current models.