A Platform-aware Compilation Framework for Fault-tolerant Quantum Computation

• URL: http://arxiv.org/abs/2609.08908v1
• Date: Tue, 08 Sep 2026 15:41:54 GMT
• Title: A Platform-aware Compilation Framework for Fault-tolerant Quantum Computation
• Abstract summary: We present a platform-aware compilation framework that re-compiles a quantum circuit into a hardware-compatible instruction set.<n>We benchmark the framework for Hamiltonian simulation of the 2D Fermi Hubbard model and for eigenenergy estimation of a small molecule.<n>For the latter, we show that end-to-end quantum simulations can be achieved with $sim104$ physical qubits and algorithms ranging from $102$ ms (photonics, superconducting) to $105$ ms (neutral atoms)
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The compilation of an algorithm can vary significantly with the choice of physical hardware platform and error correction model. Yet, current compilation frameworks typically commit to a single architecture-hardware configuration, making it difficult to assess resource estimates across platforms. We present a platform-aware compilation framework that re-compiles a quantum circuit into a hardware-compatible instruction set as well as fault-tolerant operations and provides end-to-end resource estimates in terms of physical-qubit count, time-to-solution, and classical processing time. We benchmark the framework by obtaining end-to-end resource estimates for different compilers, each tailored to the functionalities of specific hardware modalities: connectivity, clock speed, and noise model. As part of this framework, we introduce a transversal active volume (t-AV) compilation architecture designed for the efficient execution of fault-tolerant operations in platforms supporting long-range logical connectivity. We benchmark the framework for Hamiltonian simulation of the 2D Fermi Hubbard model as well as for eigenenergy estimation of a small molecule (trimethylenemethane) as a candidate for early fault-tolerant demonstration of quantum chemistry. For the latter, we show that end-to-end quantum simulations can be achieved with $\sim10^4$ physical qubits and runtimes ranging from $10^2$ ms (photonics, superconducting) to $10^5$ ms (neutral atoms).

Related papers

• CUDA-Q Logical: Retargetable Compilation for Fault-Tolerant Quantum Computing [30.490749390369032]
  We present Q-Q Logical, a compiler infrastructure for fault-tolerant compilation, analysis, and execution.<n>By deriving every resource estimate directly from compiler artifacts, the framework unifies compilation and resource analysis.<n>We show that schedule estimates reconcile with established independent models.
  arXiv  Detail & Related papers  (2026-09-11T18:00:16Z)
• 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)
• 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)
• FTCircuitBench: A Benchmark Suite for Fault-Tolerant Quantum Compilation and Architecture [9.755713238528779]
  FTCircuitBench serves as a benchmark suite of impactful quantum algorithms.<n>A modular end-to-end pipeline allows users to compile and decompose algorithms for various fault-tolerant architectures.<n>A toolkit provides detailed numerical analysis at each stage.
  arXiv  Detail & Related papers  (2026-01-06T17:08:46Z)
• Efficient Compilation for Shuttling Trapped-Ion Machines via the Position Graph Architectural Abstraction [0.9199465050084297]
  This work presents a novel unifying abstraction, called the position graph, for different types of hardware architectures.<n>We model trapped-ion Quantum Charge-Coupled Device (QCCD) architectures and enable high-quality, superconducting scalable compilation methods.<n>This approach generates native, executable circuits and ion instructions on the hardware that adheres to the physical constraints of shuttling-based quantum computers.
  arXiv  Detail & Related papers  (2025-01-21T19:39:03Z)
• Superconducting qubits at the utility scale: the potential and limitations of modularity [29.454068658181466]
  Fault-tolerant quantum computers (FTQCs) have the potential to address some of humanity's grand challenges.<n>This paper presents an architectural model of a potential FTQC based on superconducting qubits, divided into discrete modules and interconnected via coherent links.
  arXiv  Detail & Related papers  (2024-06-10T04:30:48Z)
• On-Chip Hardware-Aware Quantization for Mixed Precision Neural Networks [52.97107229149988]
  We propose an On-Chip Hardware-Aware Quantization framework, performing hardware-aware mixed-precision quantization on deployed edge devices. For efficiency metrics, we built an On-Chip Quantization Aware pipeline, which allows the quantization process to perceive the actual hardware efficiency of the quantization operator. For accuracy metrics, we propose Mask-Guided Quantization Estimation technology to effectively estimate the accuracy impact of operators in the on-chip scenario.
  arXiv  Detail & Related papers  (2023-09-05T04:39:34Z)
• Compiler Optimization for Quantum Computing Using Reinforcement Learning [3.610459670994051]
  We propose a reinforcement learning framework for developing optimized quantum circuit compilation flows. The proposed framework is set up with a selection of compilation passes from IBM's Qiskit and Quantinuum's TKET. It significantly outperforms both individual compilers in 73% of cases regarding the expected fidelity.
  arXiv  Detail & Related papers  (2022-12-08T19:00:01Z)
• Enabling Retargetable Optimizing Compilers for Quantum Accelerators via a Multi-Level Intermediate Representation [78.8942067357231]
  We present a multi-level quantum-classical intermediate representation (IR) that enables an optimizing, retargetable, ahead-of-time compiler. We support the entire gate-based OpenQASM 3 language and provide custom extensions for common quantum programming patterns and improved syntax. Our work results in compile times that are 1000x faster than standard Pythonic approaches, and 5-10x faster than comparative standalone quantum language compilers.
  arXiv  Detail & Related papers  (2021-09-01T17:29:47Z)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)
• Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
  qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
  arXiv  Detail & Related papers  (2020-10-08T12:49:07Z)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)

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.