Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computing due to their substantially reduced footprint. However, these gains can be diluted at utility scale if we cannot also realize space-time efficient logical operations for relevant quantum applications. We present RASCqL, a reaction-time-limited architecture for space-time efficient complex-instruction-set quantum computation with qLDPC logic. RASCqL supports key algorithmic subroutines such as quantum arithmetic and state preparation directly within co-designed qLDPC codes, achieving $2\times$ to $7\times$ reductions in qubit footprint while maintaining space-time volume comparable to state-of-the-art transversal surface-code architectures. Unlike prior approaches that aim for versatile logical instruction sets for arbitrary circuits, RASCqL adopts an application-tailored code modification that embeds specific complex Clifford transformations useful for common subroutines as virtually implementable operations arising from code automorphisms. RASCqL further leverages parallel physical operations available in reconfigurable neutral-atom arrays to enable fast QEC cycles and high-fidelity transversal operations. At the cost of increased design complexity and specialization, RASCqL can improve end-to-end resource estimates for applications such as factoring and quantum chemistry simulation in both footprint and space-time volume under realistic physical error rates of approximately $2\times10^{-3}$ to $5\times10^{-4}$, without requiring additional hardware capabilities. These results demonstrate that qLDPC codes can serve as complex quantum logic units for useful quantum algorithms, extending their practical utility in fault-tolerant quantum computing architectures.
Improved QLDPC Surgery: Logical Measurements and Bridging Codes
IBM Quantum, IBM T.J. Watson Research Center(IBM量子,IBM托马斯·J·沃森研究中心);Massachusetts Institute of Technology(麻省理工学院);IBM Quantum, IBM Research Cambridge(IBM量子,IBM剑桥研究中心)
Simple, Efficient, and Generic Post-Selection Decoding for qLDPC Codes
Graduate School of China Academy of Engineering Physics(中国工程物理研究院研究生院);International Center for Elementary Particle Physics, University of Tokyo(东京大学基础粒子物理国际中心);Department of Applied Physics, University of Tokyo(东京大学应用物理系)
Extractors: QLDPC Architectures for Efficient Pauli-Based Computation
Massachusetts Institute of Technology(麻省理工学院);University of Oxford(牛津大学);IBM Quantum, IBM Almaden Research Center(IBM量子,IBM阿尔马登研究中心);IBM Quantum, IBM T.J. Watson Research Center(IBM量子,IBM T.J.沃森研究中心)
High-Rate Surgery: towards constant-overhead logical operations
Pritzker School of Molecular Engineering, The University of Chicago(芝加哥大学普里茨克分子工程学院);Institute for Quantum Information and Matter, Caltech(加州理工学院量子信息与物质研究所);Walter Burke Institute for Theoretical Physics, Caltech(加州理工学院沃尔特·伯克理论物理研究所)
Fast computational primitives for La-cross qLDPC codes
University of Strasbourg(斯特拉斯堡大学);CNRS, CESQ and ISIS (UMR 7006)(法国国家科学研究中心,量子化学与光谱学与成像中心及信息科学研究所联合研究实验室);aQCess(量子计算、通信与安全应用中心);QPerfect SAS(QPerfect公司);European Center for Quantum Sciences(欧洲量子科学中心);Institut Universitaire de France (IUF)(法国高等研究院)
Fault-Tolerant QLDPC Syndrome Measurement via LDGM Encoding
Duke Quantum Center, Duke University(杜克大学量子中心);Department of Electrical and Computer Engineering, Duke University(杜克大学电气与计算机工程系);Department of Mathematics and Statistics, University of South Florida(南佛罗里达大学数学与统计系)
Batched high-rate logical operations for quantum LDPC codes
Institute for Quantum Information and Matter, Caltech(加州理工学院量子信息物质研究所);Walter Burke Institute for Theoretical Physics, Caltech(加州理工学院沃尔特·伯克理论物理研究所);QuEra Computing Inc.(QuEra计算公司);Department of Physics, Harvard University(哈佛大学物理系);AWS Center for Quantum Computing(亚马逊云科技量子计算中心);Massachusetts Institute of Technology(麻省理工学院)
No-go theorems for logical gates on product quantum codes
QuICS, University of Maryland(马里兰大学量子信息与计算科学研究所);Pritzker School of Molecular Engineering and Department of Computer Science, University of Chicago(芝加哥大学普里茨克分子工程学院及计算机系);Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心)
Chromatic Block-Gibbs p-Bit Decoding of QLDPC Codes
Western Digital, San Jose, CA, USA(西部数据);Duke Quantum Center, Duke University, Durham, NC, USA(杜克大学量子中心);Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA(杜克大学电气与计算机工程系);Department of Mathematics, Duke University, Durham, NC, USA(杜克大学数学系)
Demonstration of low-overhead quantum error correction codes
Zhejiang University(浙江大学);Shanghai Qi Zhi Institute(上海人工智能实验室);Tsinghua University(清华大学);Harvard University(哈佛大学);Xi'an Jiaotong University(西安交通大学);Institute of Physics, Polish Academy of Sciences(波兰科学院物理研究所);Hefei National Laboratory(合肥国家实验室)
Transversal dimension jump for product qLDPC codes
Institute for Quantum Information and Matter, Caltech(加州理工学院量子信息与物质研究所);Fu Foundation School of Engineering and Applied Science, Columbia University(哥伦比亚大学富工程与应用科学学院);AWS Center for Quantum Computing(亚马逊量子计算中心);Walter Burke Institute for Theoretical Physics, Caltech(加州理工学院沃尔特·伯克理论物理研究所)
Non-Abelian qLDPC: TQFT Formalism, Addressable Gauging Measurement and Application to Magic State Fountain on 2D Product Codes
IBM Quantum, IBM T.J. Watson Research Center(IBM量子,IBM托马斯·J·沃森研究中心);School of Natural Sciences, Institute for Advanced Study(自然科学院,高等研究院);Department of Mathematics, King’s College London(数学系,伦敦国王学院)
Parsimonious Quantum Low-Density Parity-Check Code Surgery
Iceberg Quantum(冰山量子);Condensed Matter Theory Center and Joint Quantum Institute, Department of Physics, University of Maryland(马里兰大学凝聚态理论中心与联合量子研究所物理系);Department of Mathematics, Massachusetts Institute of Technology(麻省理工学院数学系);Department of Physics, University of California San Diego(加州大学圣地亚哥分校物理系);School of Physics, The University of Sydney(悉尼大学物理学院)
A topological theory for qLDPC: non-Clifford gates and magic state fountain on homological product codes with constant rate and beyond the $N^{1/3}$ distance barrier
IBM Quantum, T.J. Watson Research Center(IBM量子,T.J.沃森研究中心)
Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心);State Key Laboratory of Low Dimensional Quantum Physics, Department of Physics, Tsinghua University(清华大学物理系低维量子物理国家重点实验室);Joint Center for Quantum Information and Computer Science, University of Maryland(马里兰大学量子信息与计算机联合中心);Shanghai Institute for Mathematics and Interdisciplinary Sciences (SIMIS)(上海数学与交叉学科研究院)
Yale University(耶鲁大学);Harvard University(哈佛大学);Massachusetts Institute of Technology(麻省理工学院);Stony Brook University(石溪大学);University of Maryland(马里兰大学);IBM Quantum, T. J. Watson Research Center(IBM量子,T.J.沃森研究中心);IBM Denmark(IBM丹麦);University of Sydney(悉尼大学)
Single-shot magic state factories for quantum LDPC codes
Harvard University(哈佛大学);QuEra Computing Inc.(QuEra计算公司);University of Maryland, College Park(马里兰大学帕克分校);California Institute of Technology(加州理工学院);Massachusetts Institute of Technology(麻省理工学院)