Stalls and Spequlation: Pipelined Execution for Fault Tolerant Quantum Computation

• URL: http://arxiv.org/abs/2606.19593v1
• Date: Wed, 17 Jun 2026 20:47:45 GMT
• Title: Stalls and Spequlation: Pipelined Execution for Fault Tolerant Quantum Computation
• Abstract summary: Current scheduling models treat logical operations as atomic, hiding the fact that these subsystems operate sequentially and spend significant time idle.<n>We present a pipelined execution framework that decomposes each logical operation into its component stages.<n>We show that pipelining with speculation reduces total pipeline steps by 20-40% compared to a no-speculation baseline.
• Score: 1.6724455800127804
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Fault-tolerant quantum computation requires the coordinated action of three distinct systems: classical control logic, quantum hardware, and classical error decoders. Current scheduling models treat logical operations as atomic, hiding the fact that these subsystems operate sequentially and spend significant time idle. We present a pipelined execution framework that decomposes each logical operation into its component stages i.e. Control, Execute, and Decode. Building on this, we discuss some speculation strategies that allow successor operations to begin processing before their predecessors have completed decoding. We evaluate our framework on several common benchmarks and show that pipelining with speculation reduces total pipeline steps by 20-40% compared to a no-speculation baseline. The most aggressive strategy consistently outperforms conservative alternatives, even though partial rollback is needed at times, because the per-rollback penalty is small relative to the parallelism gained. We further show that speculation facilitates load balancing by distributing work more evenly across the heterogeneous subsystems of a fault-tolerant quantum computer, converting idle time into useful computation while also saving on execution time.

Related papers

• Low-cost algorithm-to-execution framework for surface-code quantum computing [11.215578710853835]
  We develop a low-cost algorithm-to-execution framework for surface-code quantum computing.<n>From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload.<n>We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload.
  arXiv  Detail & Related papers  (2026-09-10T01:37:38Z)
• 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)
• Dependency-Aware Circuit Scheduling for Multi-Core Quantum Systems to Minimize Makespan [1.6449390849183356]
  We introduce a layered scheduling approach for multi-core quantum circuits.<n>We then propose a greedy scheduling strategy which schedules each gate as soon as all its dependencies and required resources are available.<n>Our evaluation shows that on real benchmarks, greedy scheduling achieves an average 40% reduction in makespan and improvement in core utilization.
  arXiv  Detail & Related papers  (2026-07-01T05:37:07Z)
• 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)
• Logical-to-Physical Compilation for Reducing Depth in Distributed Quantum Systems [0.7856998585396422]
  We present a compiler that integrates logical-to-physical decomposition with depth-aware rescheduling to reduce the execution cost of quantum circuits.<n>An algorithm is proposed that ensures parallelism is created when possible while keeping logical equivalence and that circuit depth is never increased.
  arXiv  Detail & Related papers  (2026-03-31T10:19:11Z)
• Learning to Share: Selective Memory for Efficient Parallel Agentic Systems [49.78267008828593]
  Agentic systems solve complex tasks by coordinating multiple agents that iteratively reason, invoke tools, and exchange intermediate results.<n>Recent approaches deploy multiple agent teams running in parallel to explore diverse reasoning trajectories.<n>We propose Learning to Share (LTS), a learned shared-memory mechanism for parallel agentic frameworks.
  arXiv  Detail & Related papers  (2026-02-05T18:20:21Z)
• ThreadWeaver: Adaptive Threading for Efficient Parallel Reasoning in Language Models [99.6720868215076]
  We introduce ThreadWeaver, a framework for adaptive parallel reasoning.<n> ThreadWeaver achieves accuracy on par with popular sequential reasoning models of comparable size.<n>We show that ThreadWeaver delivers up to 1.53x average speedup in token latency.
  arXiv  Detail & Related papers  (2025-11-24T18:55:59Z)
• 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)
• Moveless: Minimizing Overhead on QCCDs via Versatile Execution and Low Excess Shuttling [0.5833117322405447]
  We propose a compilation scheme specifically tailored for the structural regularity of QEC circuits.<n>Our resulting compiler, leads to QEC circuits which are on average 3.38x faster to execute, and lead to up to two orders of magnitude of improvement in logical error rates with realistic physical error rates.
  arXiv  Detail & Related papers  (2025-08-05T21:02:29Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks [9.971549076128268]
  We explore two minimal asynchronous protocols for entanglement in quantum networks. A parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation.
  arXiv  Detail & Related papers  (2024-05-03T18:04:11Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49: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.