Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2607.04586

QTUNER: A Feature-Guided Adaptive Framework for Quantum-Compiler Optimization Pass Tuning

Ming Zhong, Xiangyu Ren, Jinglei Cheng, Shaohua Li, Zhiding Liang

quant-phcs.SESubmitted Jul 6, 2026• Announced Jul 7, 2026• 0 citations• Revised Oct 27, 2026 (v2)
v1 · Jul 6, 2026v2 · Oct 27, 2026
arXivHTMLPDF

Abstract

Quantum compiler optimization is important for improving the execution fidelity of quantum circuits. In practice, this optimization is often formulated as reducing circuit-level metrics. In classical compilers, pass tuning has been well-established through various methods. However, these methods cannot be directly applied to quantum compilers, because quantum programs exhibit quantum-specific features. Existing quantum compiler tuning studies have attempted to incorporate quantum circuit features with compiler tuning techniques, but they still suffer from two key limitations. First, they tune only a limited subset of optimization passes, leaving the global effectiveness of the full optimization pass space underexplored. Second, the quantum features they use are mainly static features, such as structure and DAG features, which are not directly tied to the optimization characteristics of quantum circuits. In this paper, we propose QTuner, a feature-guided framework for quantum compiler pass tuning. We first construct an optimization dataset by performing Bayesian Optimization and recording their optimized pass sequences. Based on this dataset, QTuner represents each circuit with two types of features: static circuit features and optimization-aware pass embeddings. Finally, QTuner trains two models offline, which are used to efficiently retrieve and rank promising pass sequences for a new circuit. We evaluate QTuner on two benchmarks across Qiskit and PyTKET compilers. On Qiskit, QTuner achieves up to a 10.6-percentage-point improvement in 2Q gate reduction over the strongest baseline while reducing tuning time by 73.59%. On PyTKET, QTuner achieves up to a 9.4-percentage-point improvement in 2Q gate reduction and reduces tuning time by 64.49%. These results demonstrate that QTuner enables efficient pass tuning across quantum compilers.

Comments
13 pages, 13 figures, 5 tables. Accepted by the IEEE/ACM International Conference on Software Engineering (ICSE 2027)

Related papers

Transpiler Autotuning with Predictive Models for Quantum Circuit Optimization

Piotr Malkowski, Domenik Eichhorn, Joshua Ammermann +4 more

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.

quant-pharXiv:2607.29145•Aug 3, 2026•0 citations

Adaptive Quantum Circuit Compilation for Hardware-Aware Optimization

Jincheng Zhang

Quantum circuit compilation is a critical step in realizing quantum algorithms on real quantum hardware. Traditional compilation methods often employ static optimization strategies, neglecting the unique constraints and characteristics of the target quantum device. This paper introduces a novel adaptive quantum circuit compilation framework designed to dynamically adjust circuit designs based on hardware-specific information, aiming to minimize gate count and, consequently, error rates. The core of the framework lies in integrating a hardware simulator directly within the compilation process. This allows the compiler to evaluate the performance of various circuit designs—considering factors like qubit connectivity, gate fidelity, and decoherence models—before committing to a final layout. The proposed approach represents a shift from static to adaptive optimization, providing a more nuanced and effective strategy for translating quantum algorithms into executable code on diverse quantum hardware platforms. This research demonstrates a significant potential improvement in quantum circuit efficiency and fidelity, addressing a key bottleneck in the advancement of quantum computing.

•Sep 3, 2026•0 citations

A Portable Auto-Tuning Framework for Quantum Compilation Optimization Based on D3QN

Yi Liu, Yuqiong Jin, Jinchen Xu

This paper proposes a portable quantum compilation optimization framework based on D3QN (Double Dueling Deep Q-Network) to automate quantum circuit tuning. Addressing challenges in adapting fixed strategies to diverse algorithms, the framework integrates reinforcement learning (RL) with a quantum compiler environment. The RL agent dynamically selects optimization passes, guided by a reward function balancing gate count, circuit depth, and hardware constraints. Quantum circuits are encoded as DAGs, with D3QN estimating Q-values and standardizing action-space encoding, state representation, and constraint validation. Experiments on the MQTBench dataset (430 circuits across 18 algorithms) show the framework outperforms QCOR-O3 and random strategies, achieving an average 8.7% gate reduction. Implemented on QCOR's MLIR-based compiler, the modular design ensures portability. Results validate generalization across algorithms, though performance varies for underrepresented circuits. This work establishes a standardized, RL-driven framework for quantum compilation optimization in NISQ systems.

International Conference on Computer Information and Big Data Applications (CIBDA)•Mar 14, 2025•0 citations

Adaptive Quantum Circuit Compilation with Bayesian Optimization

Jincheng Zhang

Quantum circuit compilation is a crucial step in the process of executing quantum algorithms on near-term quantum hardware. The challenge lies in translating high-level quantum algorithms, often expressed using universal gate sets, into efficient, gate-level circuits that minimize gate count and circuit depth, thereby reducing error rates and improving execution times. Traditional compilation methods often rely on hand-crafted heuristics or limited search algorithms, failing to fully explore the exponentially large search space of possible circuit transformations. This work proposes an adaptive quantum circuit compilation framework leveraging Bayesian optimization. The system dynamically explores the space of potential circuit transformations, learning to identify optimal compilation strategies through a probabilistic modeling approach. The core claim is that Bayesian optimization can effectively adaptively compile quantum circuits, optimizing for performance and minimizing gate count. The system incorporates a compiler that utilizes Bayesian optimization to explore the vast space of possible quantum circuit transformations, learning to identify the most efficient compilation strategies. The results demonstrate the potential of this approach to significantly reduce the complexity of quantum circuits while maintaining algorithm fidelity.

•Sep 6, 2026•0 citations

Evaluating the Effect of the Order of Optimization Passes in Quantum Circuit Optimization

Xiao-Ting Michelle To, Nils Quetschlich, Amr Elsharkawy +3 more

Quantum circuit optimization is critical for mitigating the noise inherent in current quantum hardware. Quantum compilers typically sequentially apply multiple optimizations (also called ``optimization passes'') to improve the circuit. The impact of the order in which these passes are executed has yet been largely unexplored. This paper investigates the significance of the order of optimization passes within quantum circuit compilation, specifically analyzing interactions between different optimization methods and quantifying their mutual influences. Using Qiskit's compiler, we systematically evaluate pairwise combinations of 16 selected optimization passes, measuring circuit depth and gate count across various benchmark circuits. Our findings indicate dependencies between certain optimization passes, demonstrating that the order of the passes affects the optimization quality. In some cases, the worse performing sequence can be corrected through repeated pass application. %such that they are as good as the best performing one by extending the sequence. Experiments on multi-pass sequences show that more than two optimization passes may have an impact on each other but that this always links to the previously found pairwise effects. We observe that it is important to initially choose the best order of optimization passes to get the best possible optimization for the given circuit. The experiments reveal some factors which are important to choose the best, or at least a good, order; among those, the resulting optimization sequence depends the most on the native gate set.

quant-pharXiv:2609.29406•Sep 25, 2026•0 citations

Adaptive Quantum Circuit Compilation for Variational Quantum Algorithms

Jincheng Zhang

Variational quantum algorithms (VQAs) hold significant promise for solving complex problems across diverse fields. However, their practical implementation on near-term quantum devices is severely hampered by the pervasive effects of quantum noise. Traditional quantum circuit compilation techniques are largely static, failing to account for the unique noise profiles inherent in individual quantum hardware. This paper introduces a novel adaptive quantum circuit compilation framework designed to mitigate these limitations. The core concept centers around dynamically adjusting the circuit layout and gate decomposition in real-time, leveraging measurements of the quantum hardware's noise characteristics to optimize both the accuracy and circuit depth of the compiled quantum circuit. This approach represents a critical step towards unlocking the full potential of VQAs by enabling them to effectively operate within the constraints of noisy quantum computers. The framework incorporates feedback loops for continuous refinement, adapting to evolving noise conditions. The methodology is described, focusing on the key components: noise profiling, adaptive gate decomposition, and circuit re-optimization. Simulation results demonstrate the effectiveness of the adaptive approach in reducing circuit depth and improving the fidelity of VQA computations compared to static compilation methods. This work lays the foundation for robust and efficient VQA execution on future quantum hardware.

•Sep 2, 2026•0 citations
Quantum compiler optimization is important for improving the execution fidelity of quantum circuits. In practice, this optimization is often formulated as reducing circuit-level metrics. In classical compilers, pass tuning has been well-established through various methods. However, these methods cannot be directly applied to quantum compilers, because quantum programs exhibit quantum-specific features. Existing quantum compiler tuning studies have attempted to incorporate quantum circuit features with compiler tuning techniques, but they still suffer from two key limitations. First, they tune only a limited subset of optimization passes, leaving the global effectiveness of the full optimization pass space underexplored. Second, the quantum features they use are mainly static features, such as structure and DAG features, which are not directly tied to the optimization characteristics of quantum circuits.
In this paper, we propose QTuner, a feature-guided framework for quantum compiler pass tuning. We first construct an optimization dataset by performing Bayesian Optimization and recording their optimized pass sequences. Based on this dataset, QTuner represents each circuit with two types of features: static circuit features and optimization-aware pass embeddings. Finally, QTuner trains two models offline, which are used to efficiently retrieve and rank promising pass sequences for a new circuit. We evaluate QTuner on two benchmarks across Qiskit and PyTKET compilers. On Qiskit, QTuner achieves up to a 10.6-percentage-point improvement in 2Q gate reduction over the strongest baseline while reducing tuning time by 73.59%. On PyTKET, QTuner achieves up to a 9.4-percentage-point improvement in 2Q gate reduction and reduces tuning time by 64.49%. These results demonstrate that QTuner enables efficient pass tuning across quantum compilers.
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%95.8\%95.8% in cases where Qiskit achieves no reduction at all.
Quantum circuit compilation is a critical step in realizing quantum algorithms on real quantum hardware. Traditional compilation methods often employ static optimization strategies, neglecting the unique constraints and characteristics of the target quantum device. This paper introduces a novel adaptive quantum circuit compilation framework designed to dynamically adjust circuit designs based on hardware-specific information, aiming to minimize gate count and, consequently, error rates. The core of the framework lies in integrating a hardware simulator directly within the compilation process. This allows the compiler to evaluate the performance of various circuit designs—considering factors like qubit connectivity, gate fidelity, and decoherence models—before committing to a final layout. The proposed approach represents a shift from static to adaptive optimization, providing a more nuanced and effective strategy for translating quantum algorithms into executable code on diverse quantum hardware platforms. This research demonstrates a significant potential improvement in quantum circuit efficiency and fidelity, addressing a key bottleneck in the advancement of quantum computing.
This paper proposes a portable quantum compilation optimization framework based on D3QN (Double Dueling Deep Q-Network) to automate quantum circuit tuning. Addressing challenges in adapting fixed strategies to diverse algorithms, the framework integrates reinforcement learning (RL) with a quantum compiler environment. The RL agent dynamically selects optimization passes, guided by a reward function balancing gate count, circuit depth, and hardware constraints. Quantum circuits are encoded as DAGs, with D3QN estimating Q-values and standardizing action-space encoding, state representation, and constraint validation. Experiments on the MQTBench dataset (430 circuits across 18 algorithms) show the framework outperforms QCOR-O3 and random strategies, achieving an average 8.7% gate reduction. Implemented on QCOR's MLIR-based compiler, the modular design ensures portability. Results validate generalization across algorithms, though performance varies for underrepresented circuits. This work establishes a standardized, RL-driven framework for quantum compilation optimization in NISQ systems.
Quantum circuit compilation is a crucial step in the process of executing quantum algorithms on near-term quantum hardware. The challenge lies in translating high-level quantum algorithms, often expressed using universal gate sets, into efficient, gate-level circuits that minimize gate count and circuit depth, thereby reducing error rates and improving execution times. Traditional compilation methods often rely on hand-crafted heuristics or limited search algorithms, failing to fully explore the exponentially large search space of possible circuit transformations. This work proposes an adaptive quantum circuit compilation framework leveraging Bayesian optimization. The system dynamically explores the space of potential circuit transformations, learning to identify optimal compilation strategies through a probabilistic modeling approach. The core claim is that Bayesian optimization can effectively adaptively compile quantum circuits, optimizing for performance and minimizing gate count. The system incorporates a compiler that utilizes Bayesian optimization to explore the vast space of possible quantum circuit transformations, learning to identify the most efficient compilation strategies. The results demonstrate the potential of this approach to significantly reduce the complexity of quantum circuits while maintaining algorithm fidelity.
Quantum circuit optimization is critical for mitigating the noise inherent in current quantum hardware. Quantum compilers typically sequentially apply multiple optimizations (also called ``optimization passes'') to improve the circuit. The impact of the order in which these passes are executed has yet been largely unexplored. This paper investigates the significance of the order of optimization passes within quantum circuit compilation, specifically analyzing interactions between different optimization methods and quantifying their mutual influences. Using Qiskit's compiler, we systematically evaluate pairwise combinations of 16 selected optimization passes, measuring circuit depth and gate count across various benchmark circuits. Our findings indicate dependencies between certain optimization passes, demonstrating that the order of the passes affects the optimization quality. In some cases, the worse performing sequence can be corrected through repeated pass application. %such that they are as good as the best performing one by extending the sequence. Experiments on multi-pass sequences show that more than two optimization passes may have an impact on each other but that this always links to the previously found pairwise effects. We observe that it is important to initially choose the best order of optimization passes to get the best possible optimization for the given circuit. The experiments reveal some factors which are important to choose the best, or at least a good, order; among those, the resulting optimization sequence depends the most on the native gate set.
Variational quantum algorithms (VQAs) hold significant promise for solving complex problems across diverse fields. However, their practical implementation on near-term quantum devices is severely hampered by the pervasive effects of quantum noise. Traditional quantum circuit compilation techniques are largely static, failing to account for the unique noise profiles inherent in individual quantum hardware. This paper introduces a novel adaptive quantum circuit compilation framework designed to mitigate these limitations. The core concept centers around dynamically adjusting the circuit layout and gate decomposition in real-time, leveraging measurements of the quantum hardware's noise characteristics to optimize both the accuracy and circuit depth of the compiled quantum circuit. This approach represents a critical step towards unlocking the full potential of VQAs by enabling them to effectively operate within the constraints of noisy quantum computers. The framework incorporates feedback loops for continuous refinement, adapting to evolving noise conditions. The methodology is described, focusing on the key components: noise profiling, adaptive gate decomposition, and circuit re-optimization. Simulation results demonstrate the effectiveness of the adaptive approach in reducing circuit depth and improving the fidelity of VQA computations compared to static compilation methods. This work lays the foundation for robust and efficient VQA execution on future quantum hardware.