Modular Architectures and Entanglement Schemes for Error-Corrected Distributed Quantum Computation
Siddhant Singh, Fenglei Gu, Sébastian de Bone, Eduardo Villaseñor, David Elkouss, Johannes Borregaard
TL;DR
This work evaluates fault-tolerant, error-corrected distributed quantum computation using solid-state modular hardware. It compares emission-based and scattering-based GHZ-generation schemes within two toric-code-based modular architectures (WT4 and WT3) and links hardware parameters to logical error rates through hardware-tailored noise models and superoperator QEC simulations. Scattering-based entanglement schemes deliver higher thresholds (up to ~0.35–0.40% in FP), while emission-based methods struggle under near-term parameters, guiding design choices for scalable, distributed quantum processors. The study also provides a concrete methodology for threshold estimation and highlights the importance of GHZ fidelity (>99%) and GHZ-success probability (>10^-4) as gatekeepers for practicality, with implications for future BB-code alternatives and gated logical operations.
Abstract
Connecting multiple smaller qubit modules by generating high-fidelity entangled states is a promising path for scaling quantum computing hardware. The performance of such a modular quantum computer is highly dependent on the quality and rate of entanglement generation. However, the optimal architectures and entanglement generation schemes are not yet established. Focusing on modular quantum computers with solid-state quantum hardware, we investigate a distributed surface code's error-correcting threshold and logical failure rate. We consider both emission-based and scattering-based entanglement generation schemes for the measurement of non-local stabilizers. Through quantum optical modeling, we link the performance of the quantum error correction code to the parameters of the underlying physical hardware and identify the necessary parameter regime for fault-tolerant modular quantum computation. In addition, we compare modular architectures with one or two data qubits per module. We find that the performance of the code depends significantly on the choice of entanglement generation scheme, while the two modular architectures have similar error-correcting thresholds. For some schemes, thresholds nearing the thresholds of non-distributed implementations ($\sim0.4 \%$) appear feasible with future parameters.
