Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms

• URL: http://arxiv.org/abs/2510.05221v1
• Date: Mon, 06 Oct 2025 18:00:47 GMT
• Title: Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms
• Authors: Frederik K. Marqversen, Gefen Baranes, Maxim Sirotin, Johannes Borregaard,
• Abstract summary: We present a comprehensive analysis and comparison of known and new methods for establishing fault-tolerant interfaces.<n>We identify optimal interface strategies across a wide range of hardware parameters, such as gate fidelities, memory resources, and logical error rates.<n>Our results establish when the interface become a bottleneck in the computation and provide guidance for experimental implementations with superconducting, atomic, and solid-state hardware.
• Score: 0.27998963147546146
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Modular architectures offer a scalable path toward fault-tolerant quantum computing by interconnecting smaller quantum processing units (QPUs) provided that high-rate, fault-tolerant interfaces can be realized across modules. We present a comprehensive analysis and comparison of known and new methods for establishing such interfaces, including lattice surgery, transversal gates, and novel grow-and-distil protocols based on code growing and logical distillation. Using the surface code, we identify optimal interface strategies across a wide range of hardware parameters, such as gate fidelities, entangling rates, and memory resources, and estimate the requirements to achieve logical error rates of $10^{-6}$ and $10^{-12}$. Our results establish when the interface become a bottleneck in the computation and provide guidance for experimental implementations with superconducting, atomic, and solid-state hardware.

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)
• Performance Characterization of a Multi-Module Quantum Processor with Static Inter-Chip Couplers [63.42120407991982]
  Three-dimensional integration technologies such as flip-chip bonding are a key prerequisite to realize large-scale superconducting quantum processors.<n>We present a design for a multi-chip module comprising one carrier chip and four qubit modules.<n>Measuring two of the qubits, we analyze the readout performance, finding a mean three-level state-assignment error of $9 times 10-3$ in 200 ns.<n>We demonstrate a controlled-Z two-qubit gate in 100 ns with an error of $7 times 10-3$ extracted from interleaved randomized benchmarking.
  arXiv  Detail & Related papers  (2025-03-16T18:32:44Z)
• 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)
• Characterizing the Inter-Core Qubit Traffic in Large-Scale Quantum Modular Architectures [2.465579331213113]
  We present a pioneering characterization of the era of monolithic-temporal inter-core qubit traffic in large-scale circuits. The programs are executed on an all-to-all connected-core architecture that supports up to around 1000 qubits. Based on the showcased results, we provide a set of guidelines to improve mapping quantum circuits to multi-core processors, and lay the foundations of benchmarking large-scale multi-core architectures.
  arXiv  Detail & Related papers  (2023-10-03T09:54:41Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• Mapping quantum circuits to modular architectures with QUBO [3.0148208709026005]
  In multi-core architectures, it is crucial to minimize the amount of communication between cores when executing an algorithm. We propose for the first time a Quadratic Unconstrained Binary Optimization technique to encode the problem and the solution. Our method showed promising results and performed exceptionally well with very dense and highly-parallelized circuits.
  arXiv  Detail & Related papers  (2023-05-11T09:45:47Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Hardware optimized parity check gates for superconducting surface codes [0.0]
  Error correcting codes use multi-qubit measurements to realize fault-tolerant quantum logic steps. We analyze an unconventional surface code based on multi-body interactions between superconducting transmon qubits. Despite the multi-body effects that underpin this approach, our estimates of logical faults suggest that this design can be at least as robust to realistic noise as conventional designs.
  arXiv  Detail & Related papers  (2022-11-11T18:00:30Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• 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)
• 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)

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.