A Platform-aware Compilation Framework for Fault-tolerant Quantum Computation
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 ∼104 physical qubits and runtimes ranging from 102 ms (photonics, superconducting) to 105 ms (neutral atoms).
Related
- Verified Pauli-Product Measurement Compilation for Fault-Tolerant Quantum Computation
- FT-Weave: Real-Time Compilation Framework for Reconfigurable Fault-Tolerant Quantum Architectures
- C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution
- Fault-tolerant quantum computation with static atomic buses
- CUDA-Q Logical: Retargetable Compilation for Fault-Tolerant Quantum Computing
BibTeX
@misc{patil2026platformaware,
title = {{A Platform-aware Compilation Framework for Fault-tolerant Quantum Computation}},
author = {Srushti Patil and Susan X. Chen and Andreas Juul Bay-Smidt and Stefan Alaric Schäffer and Peter Krogstrup and Stefano Paesani and Gemma C. Solomon},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.08908},
eprint = {2609.08908},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.08908},
}
RIS
TY - UNPB
TI - A Platform-aware Compilation Framework for Fault-tolerant Quantum Computation
AU - Srushti Patil
AU - Susan X. Chen
AU - Andreas Juul Bay-Smidt
AU - Stefan Alaric Schäffer
AU - Peter Krogstrup
AU - Stefano Paesani
AU - Gemma C. Solomon
PY - 2026
DA - 2026/09/08
PB - arXiv
DO - 10.48550/arxiv.2609.08908
UR - https://arxiv.org/abs/2609.08908
AB - 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 ∼10^4 physical qubits and runtimes ranging from 10^2 ms (photonics, superconducting) to 10^5 ms (neutral atoms).
ER -