This paper reviews the theoretical foundations and practical realization of large-scale FTQC, and explores major families of QECCs, including topological, qLDPC, subsystem, and dynamical codes, with emphasis on code construction, syndrome extraction, and decoding.
Abstract
The limited qubit resources of current quantum processing units (QPUs), together with their susceptibility to operational imperfections, environmental noise, and error propagation, not only degrade computational fidelity but also constrain the scalability required for utility-scale quantum computing. Consequently, the transition from monolithic architectures to distributed quantum computing (DQC), supported by distributed quantum error-correcting codes (QECCs), is emerging as a promising paradigm for large-scale fault-tolerant quantum computing (FTQC). This transition represents a full-stack challenge that requires coordinated advances in quantum architecture, fault-tolerant gate operations, and classical–quantum co-processing and control. In this paper, we review the theoretical foundations and practical realization of large-scale FTQC. We first explore major families of QECCs, including topological, qLDPC, subsystem, and dynamical codes, with emphasis on code construction, syndrome extraction, and decoding. We then review the implementation of fault-tolerant universal gate sets at the physical and logical levels, followed by entanglement generation, distribution, and purification for distributed architectures. Finally, we outline open challenges and future research directions in theory, architecture, and implementation, highlighting the role of distributed fault-tolerant designs in next-generation utility-scale quantum computing.
This work implements for the first time all logical operations required for modular fault-tolerant universal quantum computing with a non-Calderbank-Shor-Steane (CSS) code, the perfect $[[5, 1, 3]]$ code, on a trapped-ion quantum computer, and demonstrates the smallest quantum error-correcting (QEC) code capable of cor...
R. Freund, F. Butt, Cesar Benito et al.· 0 citations
It is shown that even a single physical communication channel per node can substantially reduce the physical-qubit requirements per node under experimentally motivated, forward-looking microwave-link assumptions of a 1 MHz physical Bell-pair generation rate and 90% fidelity, although at the cost of a roughly tenfold in...
Takumi Kobayashi, H. Kurokawa, Yasunari Suzuki et al.· 0 citations
This brief review contrasts qubits and qudits, surveys leading physical implementations, and examines representative applications including quantum machine learning, quantum simulation, quantum error correction, quantum communication, and quantum sensing.
An evolutionary framework in which large language models propose circuit designs and an independent evaluator verifies and scores them is introduced and opens the door for evaluator-guided LLM co-design of new algorithmic structures for quantum computation.
An-Di Gu, Alek H. Kemeny, S. Yelin et al.· 10 citations· ⚡2
We introduce a factory--processor interface architecture for modular optical fault-tolerant quantum computation that separates code-dependent encoded-resource preparation from reusable online logical processing on a common Gaussian optical processor. Beyond encoded resources, the interface specifies logical outputs, co...
Kosuke Fukui, Takaya Matsuura, Yohji Chin et al.· 0 citations
Semiconductor spin qubits offer a promising route to compact and scalable quantum computers, combining long coherence times in isotopically purified silicon with compatibility with semiconductor manufacturing. Beyond computational speedup, their energy efficiency is an important consideration for future large-scale sys...
J. Santos, Jayshankar Nath, Marco Pezzutto et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.