Efficient and scalable inter-module switching for distributed quantum computing architectures

• URL: http://arxiv.org/abs/2508.19088v1
• Date: Tue, 26 Aug 2025 14:50:52 GMT
• Title: Efficient and scalable inter-module switching for distributed quantum computing architectures
• Authors: Kamil Bradler,
• Abstract summary: Large-scale fault-tolerant quantum computers of the future will likely be modular by necessity or by design.<n>In this work we construct several novel and decentralized switching schemes based on the properties of the Generalized Mach-Zehnder Interferometer (GMZI)
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Large-scale fault-tolerant quantum computers of the future will likely be modular by necessity or by design. Modularity is inevitable if the substrate cannot support the desired error-correction code due to its planar geometry or manufacturing constraints resulting in a limited number of logical qubits per module. Even if the computer is compact enough there may be functional requirements to distribute the quantum computation substrate over distant regions of varying scales. In both cases, matter-based quantum information, such as spins, ions or neutral atoms, is the most conveniently transmitted or mediated by photonic interconnects. To avoid long algorithm execution times and reduce errors, each module of a universal quantum computer should be dynamically interconnected with as many other modules as possible. This task relies on an optical switching network providing any-to-any or sufficiently high simultaneous connectivity. In this work we construct several novel and decentralized switching schemes based on the properties of the Generalized Mach-Zehnder Interferometer (GMZI) that are more economic and less noisy compared to commonly considered alternatives while achieving the same functionality.

Related papers

• Lattice surgery with Bell measurements: Modular fault-tolerant quantum computation at low entanglement cost [0.0]
  We introduce a protocol for lattice surgery on surface codes in which all non-local operations are Bell measurements.<n>We evaluate our protocol's performance when two logical qubits on separate modules are prepared in a logical Bell state.
  arXiv  Detail & Related papers  (2025-10-15T13:38:31Z)
• Scalable modular architecture for universal quantum computation [49.1574468325115]
  We show that it is sufficient to connect two qubit arrays that are evolution operator controllable by a single entangling two-qubit gate.<n>Our proof provides a template to build up modular QPUs from smaller building blocks with reduced numbers of local controls and couplings.
  arXiv  Detail & Related papers  (2025-07-19T16:45:47Z)
• Time-Aware Qubit Assignment and Circuit Optimization for Distributed Quantum Computing [6.812818096174995]
  In distributed quantum computing, large circuits are divided into smaller subcircuits such that they can be executed individually and simultaneously on multiple QPUs.<n>We address the problem of assigning qubits to QPUs to minimize communication costs in two different ways.<n>First by applying time-aware algorithms that take into account the changing connectivity of a given circuit as well as the underlying network topology.<n>In another approach, we propose an evolutionary-based quantum circuit optimization algorithm that adjusts the circuit itself rather than the schedule to reduce the overall communication cost.
  arXiv  Detail & Related papers  (2025-07-15T20:20:29Z)
• 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)
• Attention-Based Deep Reinforcement Learning for Qubit Allocation in Modular Quantum Architectures [1.8781124875646162]
  This research contributes to the advancement of scalable quantum computing systems by introducing a novel learning-based approach for efficient quantum circuit compilation and mapping. In this work, we propose a novel approach employing Deep Reinforcement Learning (DRL) methods to learn theses for a specific multi-core architecture.
  arXiv  Detail & Related papers  (2024-06-17T12:09:11Z)
• A modular entanglement-based quantum computer architecture [0.0]
  We propose a modular quantum computation architecture based on utilizing multipartite entanglement.<n>The usage of different kinds of multipartite entanglement rather than Bell pairs allows for more efficient and flexible coupling between modules.
  arXiv  Detail & Related papers  (2024-06-09T11:07:57Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• 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)
• Variational Quantum Eigensolvers in the Era of Distributed Quantum Computers [0.0]
  We show that a distributed quantum computing architecture with it limited capacity to exchange information between modules can accurately solve quantum computational problems. Results provide a strong indication that near-term it modular quantum processors can be an effective alternative to their monolithic counterparts.
  arXiv  Detail & Related papers  (2023-02-27T19:00:01Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Interleaving: Modular architectures for fault-tolerant photonic quantum computing [50.591267188664666]
  Photonic fusion-based quantum computing (FBQC) uses low-loss photonic delays. We present a modular architecture for FBQC in which these components are combined to form "interleaving modules" Exploiting the multiplicative power of delays, each module can add thousands of physical qubits to the computational Hilbert space.
  arXiv  Detail & Related papers  (2021-03-15T18:00:06Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.