Toward designing workload-aware Surface Code Architectures

• URL: http://arxiv.org/abs/2604.19855v2
• Date: Thu, 23 Apr 2026 12:31:46 GMT
• Title: Toward designing workload-aware Surface Code Architectures
• Abstract summary: FTQC designs generally emphasize either fast logical-qubit accessibility at the cost of significant qubit overhead, or high logical-qubit density at the cost of added workload latency.<n>We propose an architecture that balances these competing objectives by placing surface-code patches around an ancilla-centric region, which yields nearly uniform ancilla access for all data qubits.
• Score: 0.5352699766206807
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Practical quantum advantage is expected to depend on fault-tolerant quantum computing, although the architectural overhead needed to support fault tolerance is still extremely high. Prior FTQC designs generally emphasize either fast logical-qubit accessibility at the cost of significant qubit overhead, or high logical-qubit density at the cost of added workload latency. We propose an architecture that balances these competing objectives by placing surface-code patches around an ancilla-centric region, which yields nearly uniform ancilla access for all data qubits. Building on this design, we introduce a new workload-driven placement method that uses the $T$-gate profile of an application to determine an effective floorplan. We further provide a reconfigurable optimization for reducing the latency of $Y$-gate measurements on a per-workload basis. To improve flexibility, we also study concurrent execution of multiple programs on the same architecture. Numerical evaluation indicates that our approach keeps cycles per instruction near the optimal regime while reducing the number of required data tiles by up to $\sim21\%$, and achieves up to $\sim90\%$ efficiency when running 10 programs concurrently.

Related papers

• No Tile Left Behind: Multiprogramming for Surface-Code Architectures [0.5352699766206807]
  Quantum error correction exposes a structured floorplan of data tiles, ancilla tiles, and magic-state service resources.<n>We develop a formal framework for FTQC multiprogramming that captures these structural constraints and their runtime implications.<n>A scheduler achieves a normalized system speedup of 3.1x, improving over prior FTQC multiprogramming baselines by 29% while maintaining low mean slowdown.
  arXiv  Detail & Related papers  (2026-04-28T13:24:31Z)
• Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage [3.470681946214809]
  We introduce a teleportation-based scheme that leverages the reconfigurable connectivity of neutral atoms to parallelize logical operations.<n>Our approach achieves up to textbf$mathbfsim 3 times$ speedup over extractor architectures at no extra space cost.<n>We find that our speedups still apply and report exact space-time cost along with success probabilities.
  arXiv  Detail & Related papers  (2026-04-21T17:57:43Z)
• Beyond Test-Time Training: Learning to Reason via Hardware-Efficient Optimal Control [86.63490309209378]
  We formulate reasoning as optimal control and introduce the Test-Time Control layer, which performs finite-horizon LQR planning over latent states at inference time.<n>We demonstrate that embedding optimal control as an architectural layer provides an effective and scalable mechanism for reasoning beyond test-time training.
  arXiv  Detail & Related papers  (2026-03-10T05:42:13Z)
• RASCqL: Reaction-time-limited Architecture for Space-time-efficient Complex qLDPC Logic [0.39768138694503036]
  RASCqL is a Reaction-timelimited Architecture for Space-time-efficient qLDPC Logic.<n>It supports key algorithmic subroutines such as quantum arithmetic, table lookups, and magic-state distillation directly in qLDPC codes.<n>RASCqL implements key algorithmic subroutines at space-time costs comparable to state-of-the-art surface-code architectures.
  arXiv  Detail & Related papers  (2026-02-15T18:52: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)
• Tableau-Based Framework for Efficient Logical Quantum Compilation [15.58811254216672]
  Fault-tolerant quantum computing (FTQC) enables reliable execution of quantum algorithms.<n>FTQC architectures minimize the number of physical qubits required, saving more than half compared to other architectures.<n>We present TQC, a framework that minimizes FTQC runtime overhead without requiring additional physical qubits.
  arXiv  Detail & Related papers  (2025-09-02T18:18:46Z)
• Dynamic Speculative Agent Planning [57.630218933994534]
  Large language-model-based agents face critical deployment challenges due to prohibitive latency and inference costs.<n>We introduce Dynamic Speculative Planning (DSP), an online reinforcement learning framework that provides lossless acceleration with substantially reduced costs.<n>Experiments on two standard agent benchmarks demonstrate that DSP achieves comparable efficiency to the fastest acceleration method while reducing total cost by 30% and unnecessary cost up to 60%.
  arXiv  Detail & Related papers  (2025-09-02T03:34:36Z)
• End-to-End On-Device Quantization-Aware Training for LLMs at Inference Cost [53.25965863436039]
  Quantization-aware training (QAT) provides a more principled solution, but its reliance on backpropagation incurs prohibitive memory costs.<n>We propose ZeroQAT, a zeroth-order optimization-based QAT framework that supports both weight and activation quantization.<n>Experiments show that ZeroQAT consistently outperforms representative PTQ and QAT baselines while requiring significantly less memory.
  arXiv  Detail & Related papers  (2025-08-21T01:18:27Z)
• D$^{2}$MoE: Dual Routing and Dynamic Scheduling for Efficient On-Device MoE-based LLM Serving [14.607254882119507]
  Combination of experts (MoE) model is a sparse variant of large language models (LLMs)<n>Despite its benefits, MoE is still too expensive to deploy on resource-constrained edge devices.<n>We propose D$2$MoE, an algorithm-system co-design framework that matches diverse task requirements by dynamically allocating the most proper bit-width to each expert.
  arXiv  Detail & Related papers  (2025-04-17T05:37:35Z)
• QuartDepth: Post-Training Quantization for Real-Time Depth Estimation on the Edge [55.75103034526652]
  We propose QuartDepth which adopts post-training quantization to quantize MDE models with hardware accelerations for ASICs.<n>Our approach involves quantizing both weights and activations to 4-bit precision, reducing the model size and computation cost.<n>We design a flexible and programmable hardware accelerator by supporting kernel fusion and customized instruction programmability.
  arXiv  Detail & Related papers  (2025-03-20T21:03:10Z)
• 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)
• Mechanistic Design and Scaling of Hybrid Architectures [114.3129802943915]
  We identify and test new hybrid architectures constructed from a variety of computational primitives. We experimentally validate the resulting architectures via an extensive compute-optimal and a new state-optimal scaling law analysis. We find MAD synthetics to correlate with compute-optimal perplexity, enabling accurate evaluation of new architectures.
  arXiv  Detail & Related papers  (2024-03-26T16:33:12Z)
• Data-Driven Offline Optimization For Architecting Hardware Accelerators [89.68870139177785]
  We develop a data-driven offline optimization method for designing hardware accelerators, dubbed PRIME. PRIME improves performance upon state-of-the-art simulation-driven methods by about 1.54x and 1.20x, while considerably reducing the required total simulation time by 93% and 99%, respectively. In addition, PRIME also architects effective accelerators for unseen applications in a zero-shot setting, outperforming simulation-based methods by 1.26x.
  arXiv  Detail & Related papers  (2021-10-20T17:06:09Z)

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.