Impacts of Decoder Latency on Utility-Scale Quantum Computer Architectures

• URL: http://arxiv.org/abs/2511.10633v1
• Date: Fri, 14 Nov 2025 02:00:43 GMT
• Title: Impacts of Decoder Latency on Utility-Scale Quantum Computer Architectures
• Abstract summary: We build a model for the reaction time in which the decoder latency is based on parallel space- and time-window decoding methods.<n>We show how the logical microarchitecture can be optimized with respect to the reaction time.
• Score: 1.2099984425168675
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The speed of a fault-tolerant quantum computer is dictated by the reaction time of its classical electronics, that is, the total time required by decoders and controllers to determine the outcome of a logical measurement and execute subsequent conditional logical operations. Despite its importance, the reaction time and its impact on the design of the logical microarchitecture of a quantum computer are not well understood. In this work, we build, for a surface code based architecture, a model for the reaction time in which the decoder latency is based on parallel space- and time-window decoding methods, and communication latencies are drawn from our envisioned quantum execution environment comprising a high-speed network of quantum processing units, controllers, decoders, and high-performance computing nodes. We use this model to estimate the increase in the logical error rate of magic state injections as a function of the reaction time. Next, we show how the logical microarchitecture can be optimized with respect to the reaction time, and then present detailed full-system quantum and classical resource estimates for executing utility-scale quantum circuits based on realistic hardware noise parameters and state-of-the-art decoding times. For circuits with $10^{6}$--$10^{11}$ $T$ gates involving 200--2000 logical qubits, under a $Λ=9.3$ hardware model representative of a realistic target for superconducting quantum processors operating at a 2.86 MHz stabilization frequency, we show that even decoding at a sub-microsecond per stabilization round speed introduces substantial resource overheads: approximately 100k--250k additional physical qubits for correction qubit storage in the magic state factory; 300k--1.75M extra physical qubits in the core processor due to the code distance increase of $d$ to $d+4$ for extra memory protection; and a longer runtime by roughly a factor of 100.

Related papers

• Real-time decoding of quantum error correction codes using high-performance computing [13.272191986064648]
  Quantum error correction (QEC) is indispensable for building scalable fault-tolerant quantum computers.<n>We propose an architecture, called emphTHQLink, for real-time decoding of quantum error correction codes using high-performance computing resources.<n>We report a round-trip latency of 2.944 $$s on average, with an incremental overhead of 130 ns per additional hop.
  arXiv  Detail & Related papers  (2026-08-04T17:12:42Z)
• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Fault-tolerant quantum computation with static atomic buses [0.0]
  Efficient quantum error correction and fault-tolerant quantum computing require high-fidelity long-range connectivity.<n>Here, we introduce a neutral-atom architecture on static atomic buses, in which mediator atoms enable long-range operations without qubit transport.<n>The architecture achieves logical gate times of approximately 100 us and quantum-error- cycle distances of about 1 ms for code d12.
  arXiv  Detail & Related papers  (2026-07-02T22:34:55Z)
• Surface code logical operations on a superconducting quantum processor [66.1042398805403]
  We experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor.<n>Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.
  arXiv  Detail & Related papers  (2026-07-01T21:07:02Z)
• Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting [0.0]
  Quantum computer hardware is predicted to scale over hundreds of thousands of qubits coming online in the next decade.<n>Despite significant theoretical and experimental QEC progress, quantum computer architecture has suffered a significant gap.<n>We present a complete heterogeneous quantum computing architecture incorporating task-specific hardware selection and QEC encoding, and agnostic to code selection or physical qubit parameters.
  arXiv  Detail & Related papers  (2026-04-07T18:00:11Z)
• SDQC: Distributed Quantum Computing Architecture Utilizing Entangled Ion Qubit Shuttling [1.101459210965074]
  Shuttling-based Distributed Quantum Computing (SDQC) is a hybrid architecture that combines the strengths of physical qubit shuttling and distributed quantum computing.<n>We present a practical architecture incorporating quantum error correction (QEC), (2) pipelining strategies to exploit parallelism in entanglement distribution and measurement, and (3) a performance evaluation in terms of logical error rate and clock speed.
  arXiv  Detail & Related papers  (2025-12-02T15:56:25Z)
• The Fast for the Curious: How to accelerate fault-tolerant quantum applications [101.46859364118622]
  We evaluate strategies for reducing the run time of fault-tolerant quantum computations.<n>We discuss how the co-design of hardware, fault tolerance, and algorithmic subroutines can reduce run times.
  arXiv  Detail & Related papers  (2025-10-30T02:27:55Z)
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays [38.6948808036416]
  We present a low-overhead architecture that supports the layout and resource estimation of large-scale fault-tolerant quantum algorithms.<n>We find that a 2048-bit RSA factoring can be executed with 19 million qubits in 5.6 days, for 1 ms QEC cycle times.
  arXiv  Detail & Related papers  (2025-05-21T18:00:18Z)
• Experimental Demonstration of Logical Magic State Distillation [62.77974948443222]
  We present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer.<n>Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel.
  arXiv  Detail & Related papers  (2024-12-19T18:38:46Z)
• Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures [0.8453577061453568]
  We consider a concept architecture comprising a dedicated zone as a multi-level magic state factory and a core processor for efficient logical operations.<n>We show that physical quantum resource estimation reduces to a simple model involving a small number of key parameters.
  arXiv  Detail & Related papers  (2024-11-06T21:25:34Z)
• Demonstrating real-time and low-latency quantum error correction with superconducting qubits [52.08698178354922]
  We demonstrate low-latency feedback with a scalable FPGA decoder integrated into a superconducting quantum processor. We observe logical error suppression as the number of decoding rounds is increased. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments.
  arXiv  Detail & Related papers  (2024-10-07T17:07:18Z)
• Compilation of Trotter-Based Time Evolution for Partially Fault-Tolerant Quantum Computing Architecture [0.6449786007855248]
  We present an efficient method for simulating the time evolution of the 2D Hubbard model Hamiltonian. Our analysis reveals an acceleration of over 10 times compared to naive serial compilation. For devices with a physical error rate of $p_rm phys = 10-4$, we estimate that approximately $6.5 times 104$ physical qubits are required to achieve faster ground state energy estimation.
  arXiv  Detail & Related papers  (2024-08-27T10:07:34Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• A real-time, scalable, fast and highly resource efficient decoder for a quantum computer [1.9014261239550778]
  We introduce the Collision Clustering decoder and implement it on FPGA and ASIC hardware. We simulate logical memory experiments using the leading quantum error correction scheme, the surface code. We demonstrate MHz decoding speed - matching the requirements of fast-operating modalities such as superconducting qubits.
  arXiv  Detail & Related papers  (2023-09-11T15:46:27Z)
• 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)
• A High Performance Compiler for Very Large Scale Surface Code Computations [38.26470870650882]
  We present the first high performance compiler for very large scale quantum error correction. It translates an arbitrary quantum circuit to surface code operations based on lattice surgery. The compiler can process millions of gates using a streaming pipeline at a speed geared towards real-time operation of a physical device.
  arXiv  Detail & Related papers  (2023-02-05T19:06:49Z)
• Field-deployable Quantum Memory for Quantum Networking [62.72060057360206]
  We present a quantum memory engineered to meet real-world deployment and scaling challenges. The memory technology utilizes a warm rubidium vapor as the storage medium, and operates at room temperature. We demonstrate performance specifications of high-fidelity retrieval (95%) and low operation error $(10-2)$ at a storage time of 160 $mu s$ for single-photon level quantum memory operations.
  arXiv  Detail & Related papers  (2022-05-26T00:33:13Z)

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.