No Tile Left Behind: Multiprogramming for Surface-Code Architectures

• URL: http://arxiv.org/abs/2604.25976v1
• Date: Tue, 28 Apr 2026 13:24:31 GMT
• Title: No Tile Left Behind: Multiprogramming for Surface-Code Architectures
• Abstract summary: 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.
• Score: 0.5352699766206807
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Fault-tolerant quantum computing (FTQC) is emerging as the architectural regime in which practical large-scale quantum workloads will execute. In this setting, however, multiprogramming is no longer a matter of partitioning a flat pool of qubits. Quantum error correction exposes a structured floorplan of data tiles, ancilla tiles, and magic-state service resources, so concurrent execution must account for compact placement, connectivity, routing headroom, and shared support infrastructure. This makes FTQC multiprogramming fundamentally harder than its NISQ counterpart: admission decisions can fragment the remaining floorplan, conservative reservations can waste ancilla, and dynamic contention across data, ancilla, and magic-state resources can degrade both throughput and quality of service. In this work, we develop a formal framework for FTQC multiprogramming that captures these structural constraints and their runtime implications. We formulate the baseline static allocation problem, extend it to limited-resource and online settings through hierarchy-aware scheduling policies, and further generalize it to cultivation-enabled architectures with dynamic magic-state generation. Through simulation on synthetic Clifford+T workloads, the proposed scheduler achieves a normalized system speedup of 3.1x, improving over prior FTQC multiprogramming baselines by ~29% while maintaining low mean slowdown.

Related papers

• Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study [0.0]
  We present an architecture-algom co-design study of the Optimistic Quantum Fourier Transform (OQFT) under a surface-code fault-tolerant execution model for reconfigurable neutral-atom hardware.<n>Our analysis identifies reaction-limited operation and demand as primary drivers of resource estimation and establishes a generalizable foundation for primitive-based architectural studies.
  arXiv  Detail & Related papers  (2026-05-14T18:11:04Z)
• Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation [7.84307291746753]
  Fault-tolerant quantum computation (FTQC) depends on real-time classical decoding.<n>FTQC computation is rapidly emerging as a system bottleneck.<n>We propose Triage, a dual-mode architecture that mitigates operation stalls by adaptively combining a cost-efficient scheduler with a priority-aware emergency mode.
  arXiv  Detail & Related papers  (2026-05-06T03:39:24Z)
• Centralizing Task-based Approach to Quantum Network Control [71.48385446560893]
  layered architectures impose stringent design and timing constraints on quantum networks.<n>We simulate a resource-centric, task-based approach to quantum network control by utilizing a centralized controller.
  arXiv  Detail & Related papers  (2026-05-05T03:57:17Z)
• Toward designing workload-aware Surface Code Architectures [0.5352699766206807]
  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.
  arXiv  Detail & Related papers  (2026-04-21T17:06:43Z)
• Multi-Turn Reasoning LLMs for Task Offloading in Mobile Edge Computing [15.718757401948304]
  We propose COMLLM, a generative framework that enables foresighted decision-making in MEC systems.<n> COMLLM achieves near-optimal latency and improved load-balancing fairness. Notably, it exhibits zero-shot scalability, allowing a model trained on smallscale networks to generalize to larger, unseen topologies without retraining.
  arXiv  Detail & Related papers  (2026-04-08T14:38:48Z)
• Understanding by Reconstruction: Reversing the Software Development Process for LLM Pretraining [66.89012795621349]
  Large Language Models (LLMs) often struggle with the deep, long-horizon reasoning required for complex software engineering.<n>We propose a novel paradigm: understanding via reconstruction.<n>We introduce a framework that synthesizes latent agentic trajectories using a multi-agent simulation.
  arXiv  Detail & Related papers  (2026-03-11T09:23:20Z)
• 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)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• 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)
• Adaptive Job Scheduling in Quantum Clouds Using Reinforcement Learning [1.0542466736167886]
  Current quantum systems face critical bottlenecks, including limited qubit counts, brief coherence intervals, and high susceptibility to errors.<n>We introduce a simulation-based tool that supports distributed scheduling and concurrent execution of quantum jobs on networked QPUs connected via real-time classical channels.
  arXiv  Detail & Related papers  (2025-06-12T16:54:19Z)
• Elastic Entangled Pair and Qubit Resource Management in Quantum Cloud Computing [73.7522199491117]
  Quantum cloud computing (QCC) offers a promising approach to efficiently provide quantum computing resources. The fluctuations in user demand and quantum circuit requirements are challenging for efficient resource provisioning. We propose a resource allocation model to provision quantum computing and networking resources.
  arXiv  Detail & Related papers  (2023-07-25T00:38:46Z)
• Efficient Parallel Split Learning over Resource-constrained Wireless Edge Networks [44.37047471448793]
  In this paper, we advocate the integration of edge computing paradigm and parallel split learning (PSL) We propose an innovative PSL framework, namely, efficient parallel split learning (EPSL) to accelerate model training. We show that the proposed EPSL framework significantly decreases the training latency needed to achieve a target accuracy.
  arXiv  Detail & Related papers  (2023-03-26T16:09:48Z)
• Tailored Learning-Based Scheduling for Kubernetes-Oriented Edge-Cloud System [54.588242387136376]
  We introduce KaiS, a learning-based scheduling framework for edge-cloud systems. First, we design a coordinated multi-agent actor-critic algorithm to cater to decentralized request dispatch. Second, for diverse system scales and structures, we use graph neural networks to embed system state information. Third, we adopt a two-time-scale scheduling mechanism to harmonize request dispatch and service orchestration.
  arXiv  Detail & Related papers  (2021-01-17T03:45:25Z)

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.