Breaking Down Quantum Compilation: Profiling and Identifying Costly Passes

• URL: http://arxiv.org/abs/2504.15141v1
• Date: Mon, 21 Apr 2025 14:45:01 GMT
• Title: Breaking Down Quantum Compilation: Profiling and Identifying Costly Passes
• Authors: Felix Zilk, Alessandro Tundo, Vincenzo De Maio, Ivona Brandic,
• Abstract summary: We perform a preliminary analysis of the quantum circuit compilation process in Qiskit.<n>We identify the tasks that most strongly impact the overall compilation time.<n>Our results indicate that, as the desired level of optimization increases, circuit synthesis and gate passes become the dominant tasks.
• Score: 40.11095094521714
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: With the increasing capabilities of quantum systems, the efficient, practical execution of quantum programs is becoming more critical. Each execution includes compilation time, which accounts for substantial overhead of the overall program runtime. To address this challenge, proposals that leverage precompilation techniques have emerged, whereby entire circuits or select components are precompiled to mitigate the compilation time spent during execution. Considering the impact of compilation time on quantum program execution, identifying the contribution of each individual compilation task to the execution time is necessary in directing the community's research efforts towards the development of an efficient compilation and execution pipeline. In this work, we perform a preliminary analysis of the quantum circuit compilation process in Qiskit, examining the cumulative runtime of each individual compilation task and identifying the tasks that most strongly impact the overall compilation time. Our results indicate that, as the desired level of optimization increases, circuit optimization and gate synthesis passes become the dominant tasks in compiling a Quantum Fourier Transform, with individual passes consuming up to 87% of the total compilation time. Mapping passes require the most compilation time for a GHZ state preparation circuit, accounting for over 99% of total compilation time.

Related papers

• Quantum Gate Decomposition: A Study of Compilation Time vs. Execution Time Trade-offs [0.31457219084519]
  High-level quantum programming languages generate code that cannot be executed directly by quantum hardware and must be compiled. Unlike classical code, quantum programs must be compiled before each execution, making the trade-off between compilation time and execution time significant. We analyze the trade-offs of state-of-the-art decomposition algorithms by implementing them in the Ket quantum programming platform.
  arXiv  Detail & Related papers  (2025-04-28T22:24:55Z)
• Constant-time hybrid compilation of Shor's algorithm with quantum just-in-time compilation [0.0]
  This work provides an implementation of Shor's factoring algorithm, compiled to elementary quantum gates using PennyLane and Catalyst.<n>We demonstrate that with QJIT compilation, the algorithm is compiled once per bit width of $N$, even when $N$-specific optimizations are applied to circuit generation.<n>The implementation is benchmarked up to 32-bit $N$, and both the size of the compiled program and the pure compilation time are found to be constant.
  arXiv  Detail & Related papers  (2025-04-16T19:30:10Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• One-Time Compilation of Device-Level Instructions for Quantum Subroutines [21.79238078751215]
  We develop a device-level partial-compilation (DLPC) technique that reduces compilation overhead to nearly constant. We execute this modified pipeline on real trapped-ion quantum computers and observe significant reductions in compilation time.
  arXiv  Detail & Related papers  (2023-08-21T15:23:09Z)
• A High Performance Compiler for Very Large Scale Surface Code Computations [38.26470870650882]
  We present the first high performance compiler for very large scale quantum error correction. It translates an arbitrary quantum circuit to surface code operations based on lattice surgery. The compiler can process millions of gates using a streaming pipeline at a speed geared towards real-time operation of a physical device.
  arXiv  Detail & Related papers  (2023-02-05T19:06:49Z)
• 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)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• 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)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• 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)

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.