QuTuner: Feature- and Learning-Guided Optimization Pass Tuning for Quantum Compilers

• URL: http://arxiv.org/abs/2607.04586v1
• Date: Mon, 06 Jul 2026 01:24:07 GMT
• Title: QuTuner: Feature- and Learning-Guided Optimization Pass Tuning for Quantum Compilers
• Abstract summary: We present QuTuner, a feature-guided quantum compiler pass tuning framework.<n>We show that QuTuner provides an effective approach to adaptive pass tuning for quantum compilers.
• Score: 8.601841468588587
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum compilers play a key role in transforming quantum circuits into lower-cost implementations with improved execution fidelity. This process is commonly guided by circuit-level metrics, such as gate counts and circuit depth. Although compiler pass tuning has been widely studied in classical compilation, directly transferring these techniques to quantum compilers is challenging, because quantum programs are expressed as circuits and exhibit optimization behaviors that are shaped by quantum-specific structures. Prior quantum compiler tuning approaches have begun to use circuit features to guide pass selection, but they remain limited in two aspects: they search only a small portion of the optimization-pass space, and they mainly rely on static features that do not explicitly reflect how a circuit reacts to compiler optimizations. We present QuTuner, a feature-guided quantum compiler pass tuning framework that generalizes across compilers and tuning objectives. QuTuner first builds a large optimization dataset. It then characterizes each circuit from two complementary views: static circuit features that describe circuit structure, and optimization-aware pass embeddings that summarize the circuit's responses to individual optimization passes. Using these representations, QuTuner trains two offline models to retrieve and rank candidate pass sequences for unseen circuits, followed by lightweight refinement. We evaluate QuTuner on Qiskit and PyTKET using two benchmark suites. On Qiskit, QuTuner improves the evaluation-metric reduction by up to 84.85% over the strongest baseline while reducing tuning time by 73.59%. On PyTKET, it improves metric reduction by up to 18.68% with a 64.49% reduction in tuning time. These results show that QuTuner provides an effective approach to adaptive pass tuning for quantum compilers.

Related papers

• 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)
• 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)
• Optimizing Quantum Circuits, Fast and Slow [7.543907169342984]
  We present a framework for thinking of rewriting and resynthesis as abstract circuit transformations. We then present a radically simple algorithm, GUOQ, for optimizing quantum circuits.
  arXiv  Detail & Related papers  (2024-11-06T18:34:35Z)
• 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)
• Quantum Circuit Unoptimization [0.6449786007855248]
  We construct a quantum algorithmic primitive called quantum circuit unoptimization.<n>It makes a given quantum circuit complex by introducing some redundancies while preserving circuit equivalence.<n>We use quantum circuit unoptimization to generate compiler benchmarks and evaluate circuit optimization performance.
  arXiv  Detail & Related papers  (2023-11-07T08:38:18Z)
• PCOAST: A Pauli-based Quantum Circuit Optimization Framework [0.3974852803981997]
  PCOAST is a framework for quantum circuit optimizations based on the commutative properties of Pauli strings. We evaluate its compilation performance against two leading quantum compilers, Qiskit and tket.
  arXiv  Detail & Related papers  (2023-05-16T23:02:07Z)
• Optimization at the Interface of Unitary and Non-unitary Quantum Operations in PCOAST [0.3496513815948205]
  Pauli-based Circuit Optimization, Analysis and Synthesis Toolchain (PCOAST) introduced as framework for optimizing quantum circuits. In this paper, we focus on the set of subroutines which look to optimize the PCOAST graph in cases involving unitary and non-unitary operations. We evaluate the PCOAST optimization subroutines using the Intel Quantum SDK on examples of the Variational Quantum Eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-05-16T22:58:14Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Relaxed Peephole Optimization: A Novel Compiler Optimization for Quantum Circuits [15.9208532173357]
  We propose a novel quantum compiler optimization, named relaxed peephole optimization (RPO) for quantum computers. We define a qubit is in a basis state when, at a given point in time, its state is either in the X-, Y-, or Z-basis. We extend our approach to optimize the quantum gates when some input qubits are in known pure states.
  arXiv  Detail & Related papers  (2020-12-14T17:03:06Z)
• 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.