Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads

Abstract

Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds. As quantum hardware advances toward modular and networked architectures, various fault tolerant DQC schemes have been proposed, which can be broadly categorized into three architectural types. Type 1 architectures consist of small quantum nodes connected via Greenberger-Horne-Zeilinger (GHZ) states, enabling nonlocal stabilizer measurements. Type 2 architectures distribute a large error correcting code block across multiple modules, with most stabilizer measurements remaining local, except for a small subset at patch boundaries that are performed using nonlocal CNOT gates. Type 3 architectures assign code blocks to distinct modules and can perform fault tolerant operations such as transversal gates, lattice surgery, and teleportation to implement logical operations between code blocks. Using the planar surface code and toric code as representative examples, we analyze how the resource requirements, particularly the number of Bell pairs and the average number of generation attempts, scale with increasing code distance across different architectural designs. This analysis provides valuable insights for identifying architectures well suited to fault tolerant distributed quantum computation under near term hardware and resource constraints.

To appear in the Second IEEE Workshop on Quantum Intelligence, Learning and Security (QuILLS 2025)

References in corpus (19)

• Surface codes: Towards practical large-scale quantum computation
• Efficient high-fidelity quantum computation using matter qubits and linear optics
• Roads towards fault-tolerant universal quantum computation
• Surface code quantum computing by lattice surgery
• Low-distance Surface Codes under Realistic Quantum Noise
• Topological quantum computing with a very noisy network and local error rates approaching one percent
• Distributed Quantum Computing: a Survey
• 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae
• Optimizing practical entanglement distillation
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• Early Fault-Tolerant Quantum Computing
• Measurement based entanglement under conditions of extreme photon loss
• Multiplexed entanglement generation over quantum networks using multi-qubit nodes
• Coherent errors and readout errors in the surface code
• Thresholds for the distributed surface code in the presence of memory decoherence
• Modular Architectures and Entanglement Schemes for Error-Corrected Distributed Quantum Computation
• Network Operations Scheduling for Distributed Quantum Computing
• Lattice surgery-based logical state teleportation via noisy links