Turning Quantum Compiler Configuration Selection Upside Down: A Top-Down Paradigm
Abstract
Selecting an effective quantum compiler configuration requires coordinated decisions over both hardware targets and compiler settings, with the ultimate goal of improving circuit execution fidelity. Existing SOTA approaches typically decompose this problem into two sequential stages: a device is chosen first, after which compiler options are tuned on that device through RL-based search. This bottom-up strategy can be fundamentally limited by its initial device decision, since a poorly matched backend may constrain the best fidelity achievable regardless of how effectively later compiler options are optimized. In contrast to classical compiler tuning, where the search space is often prohibitively large, the configuration space of quantum compilers remains manageable enough to support exhaustive search. Consequently, rather than repeatedly searching from candidate configurations, one can derive reusable configuration knowledge from offline oracle results and apply it directly to new circuits. In this paper, we introduce a top-down configuration-selection paradigm and build QuOPTBench, an exhaustively searched benchmark containing oracle configurations for 268 quantum circuits. We first study whether LLMs can directly infer suitable configurations and evaluate ten representative LLMs. The results reveal that vanilla LLMs remain far from the oracle. We then employ an LLM to extract transferable rules from sampled circuits governing configuration selection. Using these rules together with predictors trained on the enumerated configuration data of the sampled circuits, we design QuTOP, a rule-guided ML framework that performs fast configuration selection without iterative online search. Across our evaluation, the distilled rules consistently strengthen LLM-based selection, while QuTOP provides the strongest overall balance between solution quality and selection latency among the baselines.
Related
- Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths
- Query-Efficient Quantum Multi-Objective Optimization for Materials Configuration Search via Bayesian Weight Selection
- QBX: A Compiler for 2-local Qubit Hamiltonian Simulation on Quantum Chiplets
- Turning Selection Bias into a New Statistic: Asymmetry and Fringes of Lensed Gravitational Waves
- GadIR: A Spatial-Topology Preserving Compiler for Quantum Many-Body Systems Simulation
BibTeX
@misc{zhong2026turning,
title = {{Turning Quantum Compiler Configuration Selection Upside Down: A Top-Down Paradigm}},
author = {Ming Zhong and Xiangyu Ren and Kangyu Zheng and Zhi Zeng and Shenggen Zheng and Shaohua Li and Zhiding Liang},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.29170},
eprint = {2610.29170},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.29170},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Turning Quantum Compiler Configuration Selection Upside Down: A Top-Down Paradigm
AU - Ming Zhong
AU - Xiangyu Ren
AU - Kangyu Zheng
AU - Zhi Zeng
AU - Shenggen Zheng
AU - Shaohua Li
AU - Zhiding Liang
PY - 2026
DA - 2026/10/21
PB - arXiv
DO - 10.48550/arxiv.2610.29170
UR - https://arxiv.org/abs/2610.29170
AB - Selecting an effective quantum compiler configuration requires coordinated decisions over both hardware targets and compiler settings, with the ultimate goal of improving circuit execution fidelity. Existing SOTA approaches typically decompose this problem into two sequential stages: a device is chosen first, after which compiler options are tuned on that device through RL-based search. This bottom-up strategy can be fundamentally limited by its initial device decision, since a poorly matched backend may constrain the best fidelity achievable regardless of how effectively later compiler options are optimized. In contrast to classical compiler tuning, where the search space is often prohibitively large, the configuration space of quantum compilers remains manageable enough to support exhaustive search. Consequently, rather than repeatedly searching from candidate configurations, one can derive reusable configuration knowledge from offline oracle results and apply it directly to new circuits. In this paper, we introduce a top-down configuration-selection paradigm and build QuOPTBench, an exhaustively searched benchmark containing oracle configurations for 268 quantum circuits. We first study whether LLMs can directly infer suitable configurations and evaluate ten representative LLMs. The results reveal that vanilla LLMs remain far from the oracle. We then employ an LLM to extract transferable rules from sampled circuits governing configuration selection. Using these rules together with predictors trained on the enumerated configuration data of the sampled circuits, we design QuTOP, a rule-guided ML framework that performs fast configuration selection without iterative online search. Across our evaluation, the distilled rules consistently strengthen LLM-based selection, while QuTOP provides the strongest overall balance between solution quality and selection latency among the baselines.
ER -