Transpiler Autotuning with Predictive Models for Quantum Circuit Optimization

• URL: http://arxiv.org/abs/2607.29145v1
• Date: Fri, 31 Jul 2026 08:23:43 GMT
• Title: Transpiler Autotuning with Predictive Models for Quantum Circuit Optimization
• Abstract summary: We build a predictive model extension for the Qiskit transpilation pipeline that uses a machine learning model to automatically select combinations of transpiler passes aiming to achieve a maximum reduction in two-qubit gates.<n>Our empirical evaluation shows that the combinations selected by our model are never outperformed by Qiskit's optimization levels, achieve on average an additional 19.1$%$ - 32.4$%$ reduction in two-qubit gates, and for some circuits finds reductions of up to $95.8%$ in cases where Qiskit achieves no reduction at all.
• Score: 1.039769242219222
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Quantum software engineering is an emerging research field focusing on efficiently embedding the quantum programming paradigm into existing software ecosystems. A key aspect of this field is the realization of quantum algorithms using gate-based programming and the subsequent low-level optimization of the resulting quantum circuits, a process that is commonly performed by so-called transpilation pipelines. One significant challenge in these pipelines is determining which optimizations to apply to a given circuit. This decision is usually based on fixed default configurations that are uniformly applied to all circuits, frequently resulting in missed opportunities for more aggressive circuit optimization. In this work, we tackle this challenge by applying autotuning with supervised machine learning to develop an automated method for selection of transpiler passes. To train our machine-learning models, we employ feature-model based sampling to generate a representative dataset that examines how different combinations of Qiskit transpiler passes perform across thousands of circuits drawn from the state-of-the-art benchmarking suite MQT Bench. Using these data, we build a predictive model extension for the Qiskit transpilation pipeline that uses a machine learning model to automatically select combinations of transpiler passes aiming to achieve a maximum reduction in two-qubit gates. Our empirical evaluation shows that the combinations selected by our model are never outperformed by Qiskit's optimization levels, achieve on average an additional 19.1$\%$ - 32.4$\%$ reduction in two-qubit gates, and for some circuits finds reductions of up to $95.8\%$ in cases where Qiskit achieves no reduction at all.

Related papers

• Q3SAT-GPT: A Generative Model for Discovering Quantum Circuits for the 3-SAT Problem [3.5143539128349297]
  This work introduces Q3SAT-GPT, a generative model for discovering quantum circuits for the Max-E3-SAT problem.<n>Our method learns from high-performing QAOA-style anstze to directly generate candidate circuits.<n>We also introduce Mosaic Adaptive QAOA (MosaicADAPT-QAOA), an adaptive strategy for constructing low-depth QAOA circuits.
  arXiv  Detail & Related papers  (2026-04-30T02:10:50Z)
• Investigation of Automated Design of Quantum Circuits for Imaginary Time Evolution Methods Using Deep Reinforcement Learning [6.1990010478895]
  We present an automated framework for VITE circuit design using Double Deep-Q Networks (DDQN)<n>Our approach treats circuit construction as a multi-objective problem, simultaneously minimizing energy expectation values and optimizing circuit complexity.<n>In Max-Cut problems, our agent autonomously discovered circuits with approximately 37% fewer gates and 43% less depth than standard hardware-efficient ansatz.
  arXiv  Detail & Related papers  (2026-04-09T08:17:11Z)
• Automated quantum circuit optimization with randomized replacements [0.0]
  We show how to allow approximate local transformations and employ mixed quantum channels to approximate pure circuits.<n>Our protocol converts experimental noise due to gate applications into deliberately engineered random noise.<n>Results highlight the potential of mixed-channel approximations to enhance quantum circuit performance.
  arXiv  Detail & Related papers  (2026-01-22T13:16:05Z)
• Graph-Based Bayesian Optimization for Quantum Circuit Architecture Search with Uncertainty Calibrated Surrogates [2.271697926182248]
  We present an automated framework that discovers and refines variational quantum circuits.<n>Circuits are represented as graphs and mutated and selected via an expected improvement acquisition function.<n>The GNN-guided pipeline consistently finds circuits with lower complexity and competitive or superior classification accuracy.
  arXiv  Detail & Related papers  (2025-12-10T12:23:04Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Accelerating Transpilation in Quantum Machine Learning with Haiqu's Rivet-transpiler [45.88028371034407]
  We develop the Rivet transpiler, which accelerates transpilation by reusing previously transpiled circuits.<n>We demonstrate up to 600% improvement in transpilation time for quantum layerwise learning.
  arXiv  Detail & Related papers  (2025-08-29T06:00:29Z)
• Digitized Counterdiabatic Quantum Algorithms for Logistics Scheduling [33.04597339860113]
  We propose digitized counterdiabatic quantum optimization (DCQO)algorithms for two scheduling problems.<n>For the job-shop scheduling problem, we aim at finding the optimal schedule for a robot executing a number of tasks under specific constraints.<n>For the traveling salesperson problem, the goal is to find the path that covers all cities and is associated with the shortest traveling distance.
  arXiv  Detail & Related papers  (2024-05-24T16:53:30Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization [41.94295877935867]
  We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-08-29T17:53:08Z)
• Adaptive Planning Search Algorithm for Analog Circuit Verification [53.97809573610992]
  We propose a machine learning (ML) approach, which uses less simulations. We show that the proposed approach is able to provide OCCs closer to the specifications for all circuits.
  arXiv  Detail & Related papers  (2023-06-23T12:57:46Z)
• Constraint programming models for depth-optimal qubit assignment and SWAP-based routing [0.0]
  We propose constraint programming (CP) models for a qubit assignment and routing problem. We compare their performance against integer linear programming (ILP) models for circuit depth minimization. Our empirical analysis indicates that the proposed CP approaches outperform the ILP models both in terms of solution quality and runtime.
  arXiv  Detail & Related papers  (2023-06-14T16:42:36Z)
• Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors [48.68474702382697]
  Vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables.
  arXiv  Detail & Related papers  (2023-06-14T13:44:35Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)

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.