C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution

• URL: http://arxiv.org/abs/2605.14042v1
• Date: Wed, 13 May 2026 19:03:18 GMT
• Title: C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution
• Abstract summary: This work presents a microarchitecture-aware compilation approach that integrates algorithmic structure directly with lattice surgery execution.<n>We design a dynamic, event-driven scheduling strategy that accurately models spatial layout and routing constraints.<n>This approach substantially reduces idle resources and achieves up to a 59.7$times$ reduction in execution time compared to standard baselines.
• Score: 1.635939418192339
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Achieving practical quantum advantage on fault-tolerant quantum computers (FTQC) is fundamentally constrained by the substantial spatial and temporal overheads required to map logical operations onto physical hardware. Existing compilation approaches typically adopt coarse-grained, slice-based abstractions that overlook fine-grained microarchitectural effects, such as routing contention, leading to inefficient resource utilization and limited alignment between algorithm structure and hardware capabilities. This work presents a microarchitecture-aware compilation approach that integrates algorithmic structure directly with lattice surgery (LS) execution. By leveraging the commutativity of C-Phase operations, the method transforms inherently sequential gate sequences into concurrent multi-target interactions, effectively removing artificial dependencies and exposing significant instruction-level parallelism. To enable this, we design a dynamic, event-driven scheduling strategy that accurately models spatial layout and routing constraints, allowing operations to overlap in time while minimizing contention. Through improved coordination of computation and communication, this approach substantially reduces idle resources and achieves up to a 59.7$\times$ reduction in execution time compared to standard baselines.

Related papers

• Architecture-Aware Reinforcement Learning for Communication-Efficient Distributed Quantum Circuit Compilation [16.380589534840862]
  Distributed quantum computing provides a scalable route for executing quantum circuits beyond the capacity limits of a single quantum processing unit.<n>This paper presents an architecture-aware reinforcement-learning framework that formulates distributed quantum compilation as a constrained Markov Decision Process.
  arXiv  Detail & Related papers  (2026-08-07T07:25:18Z)
• Accelerating Masked Diffusion Large Language Models: A Survey of Efficient Inference Techniques [45.003333444832656]
  Diffusion large language models (dLLMs) offer a theoretical advantage in parallel generation over standard autoregressive models.<n> realizing this efficiency requires specialized inference mechanisms, such as diffusion-aware caching and reuse.<n>We introduce a unified latency decomposition framework for dLLMs to disentangle these factors and analyze their impact on inference speed in real deployments.
  arXiv  Detail & Related papers  (2026-07-14T14:48:06Z)
• General circuit mapping algorithm for neutral atom quantum computers [1.047947389293086]
  Neutral atom quantum computers (NAQC) are emerging as a promising, scalable quantum computing platform.<n> circuit execution often requires physically moving qubits, making compilation a critical optimization challenge.<n>We propose a circuit independent mathematical framework built on graph-theoretic optimization that determines the minimal number of required qubit transfers.
  arXiv  Detail & Related papers  (2026-06-18T17:21:23Z)
• DA-PTQ: Drift-Aware Post-Training Quantization for Efficient Vision-Language-Action Models [61.26694413585136]
  Drift-Aware Post-Training Quantization (DA-PTQ) formulates quantization as a drift-aware optimization problem over sequential decision processes.<n>DA-PTQ significantly reduces kinematic drift and achieves comparable performance to full-precision models under low-bit settings.
  arXiv  Detail & Related papers  (2026-04-13T14:51:43Z)
• Resource Estimation via Efficient Compilation of Key Quantum Primitives [0.15169059475563407]
  Resource estimation is a significant challenge in evaluating fault tolerant quantum computers.<n>We present a compilation-driven framework for quantum resource estimation.<n>We show that access to movement can save time on cultivation and important gates.
  arXiv  Detail & Related papers  (2026-04-01T20:36:21Z)
• Adaptive Parallelism-Aware Qubit Routing for Ion Trap QCCD Architectures [0.0]
  Trapped-ion Quantum Charge-Coupled Device (QCCD) architectures promise scalability through interconnected trap zones and dynamic ion transport.<n>We introduce a routing strategy that turns this challenge into an advantage by exploiting operational parallelism across traps.<n>Across a broad suite of benchmarks and QCCD layouts, the method consistently reduces ion-transport overhead and improves execution fidelity, outperforming state-of-the-art routing techniques.
  arXiv  Detail & Related papers  (2026-03-20T14:11:29Z)
• Network Operations Scheduling for Distributed Quantum Computing [0.0]
  We compare and contrast two approaches to solving the make span minimization problem.<n>One approach is based on the resource constrained project scheduling (RCPSP) framework, and another based on a greedy algorithm.<n>Our results illustrate the effectiveness of the RCPSP framework, while also underlining the relevance and usefulness of greedy algorithms.
  arXiv  Detail & Related papers  (2025-11-17T18:40:50Z)
• 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)
• 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)
• Pilot Contamination Aware Transformer for Downlink Power Control in Cell-Free Massive MIMO Networks [45.487183737784086]
  This paper introduces the pilot contamination-aware power control (PAPC) transformer neural network.<n>PAPC integrates pilot allocation data into the network, effectively handling pilot contamination scenarios.<n>Trained in an unsupervised learning framework, PAPC is evaluated against the accelerated proximal gradient (APG) algorithm.
  arXiv  Detail & Related papers  (2024-11-28T09:48:52Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• Compiler for Distributed Quantum Computing: a Reinforcement Learning Approach [6.347685922582191]
  We introduce a novel compiler that prioritizes reducing the expected execution time by jointly managing the generation and routing of EPR pairs. We present a real-time, adaptive approach to compiler design, accounting for the nature of entanglement generation and the operational demands of quantum circuits. Our contributions are twofold: (i) we model the optimal compiler for DQC using a Markov Decision Process (MDP) formulation, establishing the existence of an optimal algorithm, and (ii) we introduce a constrained Reinforcement Learning (RL) method to approximate this optimal compiler.
  arXiv  Detail & Related papers  (2024-04-25T23:03:20Z)
• DESTRESS: Computation-Optimal and Communication-Efficient Decentralized Nonconvex Finite-Sum Optimization [43.31016937305845]
  Internet-of-things, networked sensing, autonomous systems and federated learning call for decentralized algorithms for finite-sum optimizations. We develop DEcentralized STochastic REcurSive methodDESTRESS for non finite-sum optimization. Detailed theoretical and numerical comparisons show that DESTRESS improves upon prior decentralized algorithms.
  arXiv  Detail & Related papers  (2021-10-04T03:17:41Z)
• Efficient Micro-Structured Weight Unification and Pruning for Neural Network Compression [56.83861738731913]
  Deep Neural Network (DNN) models are essential for practical applications, especially for resource limited devices. Previous unstructured or structured weight pruning methods can hardly truly accelerate inference. We propose a generalized weight unification framework at a hardware compatible micro-structured level to achieve high amount of compression and acceleration.
  arXiv  Detail & Related papers  (2021-06-15T17:22:59Z)
• Goal Kernel Planning: Linearly-Solvable Non-Markovian Policies for Logical Tasks with Goal-Conditioned Options [54.40780660868349]
  We introduce a compositional framework called Linearly-Solvable Goal Kernel Dynamic Programming (LS-GKDP)<n>LS-GKDP combines the Linearly-Solvable Markov Decision Process (LMDP) formalism with the Options Framework of Reinforcement Learning.<n>We show how an LMDP with a goal kernel enables the efficient optimization of meta-policies in a lower-dimensional subspace defined by the task grounding.
  arXiv  Detail & Related papers  (2020-07-06T05:13:20Z)

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.