Modular architectures and entanglement schemes for error-corrected distributed quantum computation

Abstract Connecting multiple smaller qubit modules by generating high-fidelity entanglement is a promising path for scaling quantum computing hardware. The performance of such a modular quantum computer depends on the quality and rate of entanglement generation. However, identifying optimal architectures and entanglement generation protocols remains an open question. How can modular quantum architectures be designed to achieve fault tolerance while requiring only feasible entanglement rates and hardware? Focusing on solid-state quantum hardware, we investigate the threshold and logical failure rate of a fully distributed surface code. We consider both emission-based and scattering-based entanglement schemes between the modules to link the performance to the physical hardware and identify the regime for fault tolerance. We compare architectures with one or two data qubits per module. For some entanglement schemes, thresholds nearing the thresholds of non-distributed implementations (~ 0.4%) appear feasible with future parameters minimizing the performance gap between modular and monolithic quantum processors.

Authors

Institutions

Publication Details

Journal
npj Quantum Information
Published
2025-12-02
DOI
https://doi.org/10.1038/s41534-025-01146-2
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Modular architectures and entanglement schemes for error-corrected distributed quantum computation

David Elkouss, Sébastian de Bone, Johannes Borregaard, Fenglei Gu et al.
1 citations
npj Quantum Information
Quantum Computing Algorithms and Architecture
2.48
article

Modular architectures and entanglement schemes for error-corrected distributed quantum computation

David Elkouss, Sébastian de Bone, Johannes Borregaard, Fenglei Gu, Siddhant Singh, Eduardo Villaseñor
article en
1 citations

Abstract

Abstract Connecting multiple smaller qubit modules by generating high-fidelity entanglement is a promising path for scaling quantum computing hardware. The performance of such a modular quantum computer depends on the quality and rate of entanglement generation. However, identifying optimal architectures and entanglement generation protocols remains an open question. How can modular quantum architectures be designed to achieve fault tolerance while requiring only feasible entanglement rates and hardware? Focusing on solid-state quantum hardware, we investigate the threshold and logical failure rate of a fully distributed surface code. We consider both emission-based and scattering-based entanglement schemes between the modules to link the performance to the physical hardware and identify the regime for fault tolerance. We compare architectures with one or two data qubits per module. For some entanglement schemes, thresholds nearing the thresholds of non-distributed implementations (~ 0.4%) appear feasible with future parameters minimizing the performance gap between modular and monolithic quantum processors.

npj Quantum InformationVol. 12(1)
Harvard University (US), Okinawa Institute of Science and Technology Graduate University (JP), QuSoft (NL), QuTech (NL), CSIRO Manufacturing (AU), Delft University of Technology (NL)
Rijksdienst voor Ondernemend Nederland, Technische Universiteit Delft, Fujitsu, Moonshot Research and Development Program
Openalex Percentile: Top 8%
Quantum Computing Algorithms and Architecture
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.