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

• URL: http://arxiv.org/abs/2511.13657v1
• Date: Mon, 17 Nov 2025 18:14:38 GMT
• Title: Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads
• Authors: Nitish Kumar Chandra, Eneet Kaur, Kaushik P. Seshadreesan,
• Abstract summary: Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds.<n>Type 1 architectures consist of small quantum nodes connected via Greenberger-e-Zeilinger (GHZ) states, enabling nonlocal stabilizer measurements.<n>Type 2 architectures distribute a large error correcting code block across multiple modules, with most stabilizer measurements remaining local.<n>Type 3 architectures assign code blocks to distinct modules and can perform fault tolerant operations such as lattice gates, lattice surgery, and teleportation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• COMPAS: A Distributed Multi-Party SWAP Test for Parallel Quantum Algorithms [4.584616394519209]
  We introduce COMPAS, an architecture that realizes multivariate trace estimation across a multi-party network of interconnected modular and distributed QPUs.<n>Unlike other schemes, which must choose between optimality in circuit depth or GHZ width, COMPAS achieves both at once.<n>We analyze network-level errors and simulate the effects of circuit-level noise on the architecture.
  arXiv  Detail & Related papers  (2025-11-28T18:31:15Z)
• QuantEM: The quantum error management compiler [6.576503649817851]
  Quantum error detection (QED) enables improved reliability with significantly lower overhead.<n>Applying QED to arbitrary quantum circuits remains challenging because of the need for manual insertion of detection subcircuits, ancilla allocation, and hardware-specific mapping and scheduling.<n>We present QuantEM, a modular and scalable compiler designed to automate the integration of QED codes into arbitrary quantum programs.
  arXiv  Detail & Related papers  (2025-09-19T01:04:15Z)
• Scalable modular architecture for universal quantum computation [45.989522481082986]
  We show that it is sufficient to connect two qubit arrays that are evolution operator controllable by a single entangling two-qubit gate.<n>We illustrate the approach with two examples, consisting of 10, respectively 127 qubits, inspired by IBM quantum processors.
  arXiv  Detail & Related papers  (2025-07-19T16:45:47Z)
• Fault-Tolerant Stabilizer Measurements in Surface Codes with Three-Qubit Gates [1.351813974961217]
  We show that stabilizer measurement circuits for unrotated surface codes can be fault-tolerant using single auxiliary qubits and three-qubit gates.<n>These gates enable lower-depth circuits leading to fewer fault locations and potentially shorter QEC cycle times.
  arXiv  Detail & Related papers  (2025-06-10T17:54:23Z)
• Modular Architectures and Entanglement Schemes for Error-Corrected Distributed Quantum Computation [1.6492989697868894]
  We study modular quantum computers with solid-state quantum hardware. We investigate a distributed surface code's error-correcting threshold and logical failure rate. We find that the performance of the code depends significantly on the choice of entanglement generation scheme.
  arXiv  Detail & Related papers  (2024-08-05T21:20:03Z)
• High-rate quantum LDPC codes for long-range-connected neutral atom registers [0.0]
  High-rate quantum error correcting (QEC) codes with moderate overheads in qubit number and control complexity are desirable for fault-tolerant quantum computing.<n>We analyze a family of Low-Density Parity-Check (LDPC) codes with limited long-range interactions and outline a near-term implementation in neutral atom registers.
  arXiv  Detail & Related papers  (2024-04-19T17:14:03Z)
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice [41.94295877935867]
  Topological quantum error correction is a milestone in the scaling roadmap of quantum computers.<n>The square-lattice surface code has become the workhorse to address this challenge.<n>In some platforms, however, the connectivities are kept even lower in order to minimise gate errors.
  arXiv  Detail & Related papers  (2024-02-03T15:28:27Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• A fault-tolerant continuous-variable measurement-based quantum computation architecture [0.9786690381850356]
  Continuous variable measurement-based quantum computation on cluster states has great potential for scalable, universal, and fault-tolerant quantum computation. No complete fault-tolerant architecture exists that includes everything from cluster state generation with finite squeezing to gate implementations with realistic noise and error correction. We propose a simple architecture for the preparation of a cluster state in three dimensions in which gates by gate teleportation can be efficiently implemented.
  arXiv  Detail & Related papers  (2021-01-08T14:01:05Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.