Neural Guided Sampling for Quantum Circuit Optimization

• URL: http://arxiv.org/abs/2510.12430v1
• Date: Tue, 14 Oct 2025 12:09:05 GMT
• Title: Neural Guided Sampling for Quantum Circuit Optimization
• Authors: Bodo Rosenhahn, Tobias J. Osborne, Christoph Hirche,
• Abstract summary: Translating a 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.<n>One method to address efficient transpilation is based on approaches known from optimization, e.g. by using random sampling and token replacement strategies.<n>Here, 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.
• Score: 26.90377134346014
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

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)
• Efficient Variational Quantum Algorithms via Circuit Knitting and Architecture Search [14.667623160371013]
  We introduce CKVQA, a framework that applies circuit knitting to variational quantum algorithms (VQAs)<n>CKVQA aims to minimize the sampling overhead by identifying parameterized quantum circuits that achieve a favorable balance between algorithmic performance and sampling overhead.<n>We have developed a subcircuit-level optimization method to accelerate the training of VQAs and reduce overall execution time.
  arXiv  Detail & Related papers  (2025-08-05T12:27:19Z)
• Digital Zero-Noise Extrapolation with Quantum Circuit Unoptimization [0.9208007322096533]
  Quantum circuit unoptimization is an algorithm that transforms a quantum circuit into a different circuit.<n>By employing quantum circuit unoptimization as a form of circuit folding, noise can be systematically amplified.<n>We show that using quantum circuit unoptimization to perform ZNE can approximately recover signal from noisy quantum simulations.
  arXiv  Detail & Related papers  (2025-03-08T21:06:48Z)
• Optimization Driven Quantum Circuit Reduction [20.697821016522358]
  We propose three different transpilation approaches to substantially reduce circuit lengths without affecting functionality.<n>The first variant is based on a search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support.<n>We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using different qiskit optimization levels.
  arXiv  Detail & Related papers  (2025-02-20T16:41:10Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation [4.2754140179767415]
  We present it FragQC, a software tool that cuts a quantum circuit into sub-circuits when its error probability exceeds a certain threshold. We achieve an increase of fidelity by 14.83% compared to direct execution without cutting the circuit, and 8.45% over the state-of-the-art ILP-based method.
  arXiv  Detail & Related papers  (2023-09-30T17:38:31Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• Quantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications [1.6329956884407544]
  We introduce two ideas for circuit optimization and combine them in a multi-tiered quantum circuit optimization protocol called AQCEL. AQCEL is deployed on an iterative and efficient quantum algorithm designed to model final state radiation in high energy physics. Our technique is generic and can be useful for a wide variety of quantum algorithms.
  arXiv  Detail & Related papers  (2021-02-19T16:20:31Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.