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 increase in execution time.
Abstract
Practical fault-tolerant quantum computation requires a large number of physical qubits, posing a major challenge for scaling up individual quantum processors. Distributed architectures offer a promising solution by interconnecting multiple processors through quantum networks. However, remote Bell-pair generation remains technically demanding, making it essential to assess computational performance under limited communication resources. In this work, we present a comprehensive resource analysis of distributed fault-tolerant quantum computation using superconducting processors connected by microwave or optical links. We show 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 increase in execution time. Conversely, reducing the execution-time overhead requires substantially greater communication resources, including higher Bell-pair fidelities and extensive multiplexing. These results demonstrate the potential feasibility of distributed fault-tolerant quantum computation with limited communication resources and provide a quantitative basis for balancing quantum-link performance, processor size, and execution time.
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.
S. Babaie, Sean Grzenda, Lan Yang et al.· Entropy· 0 citations
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
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
Fault-tolerant quantum computing requires high-fidelity quantum gates that are resilient to control errors and device imperfections. Here, we develop energy-optimal control pulses for single-qubit gates that are simultaneously robust against frequency detuning and waveform inhomogeneities while also suppressing leakage...
Tang-You Huang, Anuj Aggarwal, Jing-Jun Zhu et al.· 1 citation
This work forms the joint selection of compilations and allocation of shots under per-link Bell-pair capacities as Candidate-Constrained Max-Shot Allocation (CMA), proves it NP-hard, and solves it with a dynamic program and its approximate variant AppDP, a compact MILP, and a greedy heuristic Effi.
Yi-Pei Liu, Sen Zhang, Ze-Bo Yang et al.· 0 citations
Transitioning quantum computing from laboratory physical demonstrations to practical, utility-scale processing requires bridging a multi-order-of-magnitude gap between physical gate fidelities and algorithmic error thresholds. While fault-tolerant quantum computing relies on quantum error correction to span this divide...