QUANT-PHLGOct 14, 2025

Neural Guided Sampling for Quantum Circuit Optimization

arXiv:2510.12430v1h-index: 6
Originality Incremental advance
AI Analysis

This addresses the challenge of efficient quantum circuit optimization for quantum computing applications, representing an incremental improvement over stochastic optimization methods.

The paper tackles the problem of reducing quantum circuit length during transpilation to mitigate decoherence, proposing a 2D neural guided sampling method that predicts reducible gate groups, resulting in faster optimization times compared to existing tools like qiskit and BQSKit.

Translating a general quantum circuit on a specific hardware topology with a reduced set of available gates, also known as transpilation, comes with a substantial increase in the length of the equivalent circuit. Due to decoherence, the quality of the computational outcome can degrade seriously with increasing circuit length. Thus, there is major interest to reduce a quantum circuit to an equivalent circuit which is in its gate count as short as possible. One method to address efficient transpilation is based on approaches known from stochastic optimization, e.g. by using random sampling and token replacement strategies. Here, a core challenge is that these methods can suffer from sampling efficiency, causing long and energy consuming optimization time. As a remedy, we propose in this work 2D neural guided sampling. Thus, given a 2D representation of a quantum circuit, a neural network predicts groups of gates in the quantum circuit, which are likely reducible. Thus, it leads to a sampling prior which can heavily reduce the compute time for quantum circuit reduction. In several experiments, we demonstrate that our method is superior to results obtained from different qiskit or BQSKit optimization levels.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes