dorsal/arxiv
View SchemaNetwork-Based Quantum Computing: an efficient design framework for many-small-node distributed fault-tolerant quantum computing
| Authors | Soshun Naito, Yasunari Suzuki, Yuuki Tokunaga |
|---|---|
| Categories | |
| ArXiv ID | 2601.09374vv1 |
| URL | https://arxiv.org/abs/2601.09374 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
In fault-tolerant quantum computing, a large number of physical qubits are required to construct a single logical qubit, and a single quantum node may be able to hold only a small number of logical qubits. In such a case, the idea of distributed fault-tolerant quantum computing (DFTQC) is important to demonstrate large-scale quantum computation using small-scale nodes. However, the design of distributed systems on small-scale nodes, where each node can store only one or a few logical qubits for computation, has not been explored well yet. In this paper, we propose network-based quantum computation (NBQC) to efficiently realize distributed fault-tolerant quantum computation using many small-scale nodes. A key idea of NBQC is to let computational data continuously move throughout the network while maintaining the connectivity to other nodes. We numerically show that, for practical benchmark tasks, our method achieves shorter execution times than circuit-based strategies and more node-efficient constructions than measurement-based quantum computing. Also, if we are allowed to specialize the network to the structure of quantum programs, such as peak access frequencies, the number of nodes can be significantly reduced. Thus, our methods provide a foundation in designing DFTQC architecture exploiting the redundancy of many small fault-tolerant nodes.
{
"annotation_id": "e8c9a101-578e-4382-a8be-bd7910dcd160",
"date_created": "2026-02-17T05:53:19.481000Z",
"date_modified": "2026-02-17T05:53:19.481000Z",
"file_hash": "85de076d48301c6bf089fdbe8bf2bd8fa801b648771d7f1226f5dbed58209868",
"private": false,
"record": {
"abstract": "In fault-tolerant quantum computing, a large number of physical qubits are required to construct a single logical qubit, and a single quantum node may be able to hold only a small number of logical qubits. In such a case, the idea of distributed fault-tolerant quantum computing (DFTQC) is important to demonstrate large-scale quantum computation using small-scale nodes. However, the design of distributed systems on small-scale nodes, where each node can store only one or a few logical qubits for computation, has not been explored well yet. In this paper, we propose network-based quantum computation (NBQC) to efficiently realize distributed fault-tolerant quantum computation using many small-scale nodes. A key idea of NBQC is to let computational data continuously move throughout the network while maintaining the connectivity to other nodes. We numerically show that, for practical benchmark tasks, our method achieves shorter execution times than circuit-based strategies and more node-efficient constructions than measurement-based quantum computing. Also, if we are allowed to specialize the network to the structure of quantum programs, such as peak access frequencies, the number of nodes can be significantly reduced. Thus, our methods provide a foundation in designing DFTQC architecture exploiting the redundancy of many small fault-tolerant nodes.",
"arxiv_id": "2601.09374",
"authors": [
"Soshun Naito",
"Yasunari Suzuki",
"Yuuki Tokunaga"
],
"categories": [
"quant-ph",
"cs.DC"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Network-Based Quantum Computing: an efficient design framework for many-small-node distributed fault-tolerant quantum computing",
"url": "https://arxiv.org/abs/2601.09374",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "f4e39afc-cbcb-439e-863b-07ee881ff6c3",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}