FTCircuitBench: A Benchmark Suite for Fault-Tolerant Quantum Compilation and Architecture

• URL: http://arxiv.org/abs/2601.03185v1
• Date: Tue, 06 Jan 2026 17:08:46 GMT
• Title: FTCircuitBench: A Benchmark Suite for Fault-Tolerant Quantum Compilation and Architecture
• Authors: Adrian Harkness, Shuwen Kan, Chenxu Liu, Meng Wang, John M. Martyn, Shifan Xu, Diana Chamaki, Ethan Decker, Ying Mao, Luis F. Zuluaga, Tamás Terlaky, Ang Li, Samuel Stein,
• Abstract summary: 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.
• Score: 9.755713238528779
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Realizing large-scale quantum advantage is expected to require quantum error correction (QEC), making the compilation and optimization of logical operations a critical area of research. Logical computation imposes distinct constraints and operational paradigms that differ from those of the Noisy Intermediate-Scale Quantum (NISQ) regime, motivating the continued evolution of compilation tools. Given the complexity of this emerging stack, where factors such as gate decomposition precision and computational models must be co-designed, standardized benchmarks and toolkits are valuable for evaluating progress. To support this need, we introduce FTCircuitBench, which serves as: (1) a benchmark suite of impactful quantum algorithms, featuring pre-compiled instances in both Clifford+T and Pauli Based Computation models; (2) a modular end-to-end pipeline allowing users to compile and decompose algorithms for various fault-tolerant architectures, supporting both prebuilt and custom optimization passes; and (3) a toolkit for evaluating the impact of algorithms and optimization across the full compilation stack, providing detailed numerical analysis at each stage. FTCircuitBench is fully open-sourced and maintained on Github.

Related papers

• Optimization and Synthesis of Quantum Circuits with Global Gates [41.99844472131922]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• Hungarian Qubit Assignment for Optimized Mapping of Quantum Circuits on Multi-Core Architectures [1.1288814203214292]
  Quantum computers are expected to adopt a modular approach, featuring clusters of tightly connected quantum bits with sparser connections between these clusters. Efficiently distributing qubits across multiple processing cores is critical for improving quantum computing systems' performance and scalability. We propose the Hungarian Qubit Assignment (HQA) algorithm, which leverages the Hungarian algorithm to improve qubit-to-core assignment.
  arXiv  Detail & Related papers  (2023-09-21T15:48:45Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• 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)
• Arline Benchmarks: Automated Benchmarking Platform for Quantum Compilers [0.0]
  Open-source software package, Arline Benchmarks, is designed to perform automated benchmarking of quantum compilers. We compare several quantum compilation frameworks based on a set of important metrics. We propose a concept of composite compilation pipeline that combines compiler-specific circuit optimizations in a single compilation stack.
  arXiv  Detail & Related papers  (2022-02-28T18:48:01Z)
• Finite-Sum Coupled Compositional Stochastic Optimization: Theory and Applications [43.48388050033774]
  This paper provides a comprehensive analysis of a simple algorithm for both non- and convex objectives. Our analysis also exhibits new insights for improving the practical implementation by sampling batches of equal size for the outer and inner levels.
  arXiv  Detail & Related papers  (2022-02-24T22:39:35Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Performance Evaluations of Signed and Unsigned Noisy Approximate Quantum Fourier Arithmetic [3.256297688080386]
  We implement QFT-based integer addition and multiplications on quantum computers.<n>These operations are fundamental to various quantum applications.<n>We evaluate these implementations based on IBM's superconducting qubit architecture.
  arXiv  Detail & Related papers  (2021-12-17T06:51:18Z)
• 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)
• 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)
• Verifying Results of the IBM Qiskit Quantum Circuit Compilation Flow [7.619626059034881]
  We propose an efficient scheme for quantum circuit equivalence checking. The proposed scheme allows to verify even large circuit instances with tens of thousands of operations within seconds or even less.
  arXiv  Detail & Related papers  (2020-09-04T19:58:53Z)

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.