Feasibility of Distributed Fault-Tolerant Quantum Computing: From Quantum Links to Algorithms
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.
Related
- Transversal Fanout for Fault Tolerant Distributed Quantum Computing: Analysis and Application
- Towards fault-tolerant quantum computing with optically controlled superconducting qubits
- Fault-tolerant execution of error-corrected quantum algorithms
- Tight Communication Bounds for Distributed Algorithms in the Quantum Routing Model
- SynDebug: A Framework to Debug Logic Bugs in Fault-Tolerant Quantum Computing Programs
BibTeX
@misc{kobayashi2026feasibility,
title = {{Feasibility of Distributed Fault-Tolerant Quantum Computing: From Quantum Links to Algorithms}},
author = {Takumi Kobayashi and Hodaka Kurokawa and Yasunari Suzuki and Hideo Kosaka},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.34143},
eprint = {2610.34143},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.34143},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Feasibility of Distributed Fault-Tolerant Quantum Computing: From Quantum Links to Algorithms
AU - Takumi Kobayashi
AU - Hodaka Kurokawa
AU - Yasunari Suzuki
AU - Hideo Kosaka
PY - 2026
DA - 2026/10/25
PB - arXiv
DO - 10.48550/arxiv.2610.34143
UR - https://arxiv.org/abs/2610.34143
AB - 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.
ER -