Beyond Reinforcement Learning: Fast and Scalable Quantum Circuit Synthesis

• URL: http://arxiv.org/abs/2602.15146v2
• Date: Wed, 18 Feb 2026 09:41:06 GMT
• Title: Beyond Reinforcement Learning: Fast and Scalable Quantum Circuit Synthesis
• Authors: Lukas Theißinger, Thore Gerlach, David Berghaus, Christian Bauckhage,
• Abstract summary: Quantum unitary synthesis addresses the problem of translating quantum algorithms into sequences of hardware-executable gates.<n>Existing approaches suffer from misaligned optimization objectives, substantial training costs and limited generalization across different qubit counts.<n>We mitigate these limitations by using supervised learning to approximate the minimum description of residual unitaries and combining this estimate with beam search to identify near optimal gate sequences.
• Score: 2.2632495210933135
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum unitary synthesis addresses the problem of translating abstract quantum algorithms into sequences of hardware-executable quantum gates. Solving this task exactly is infeasible in general due to the exponential growth of the underlying combinatorial search space. Existing approaches suffer from misaligned optimization objectives, substantial training costs and limited generalization across different qubit counts. We mitigate these limitations by using supervised learning to approximate the minimum description length of residual unitaries and combining this estimate with stochastic beam search to identify near optimal gate sequences. Our method relies on a lightweight model with zero-shot generalization, substantially reducing training overhead compared to prior baselines. Across multiple benchmarks, we achieve faster wall-clock synthesis times while exceeding state-of-the-art methods in terms of success rate for complex circuits.

Related papers

• Unitary Synthesis with AlphaZero via Dynamic Circuits [0.0]
  Unitary synthesis is the process of decomposing a target unitary transformation into a sequence of quantum gates.<n>We propose an approach using an AlphaZero-inspired reinforcement-learning agent for the exact compilation of unitaries.<n>The approach achieves low inference time and proves versatile across different gate sets, and qubit connectivities.
  arXiv  Detail & Related papers  (2025-08-28T21:15:28Z)
• Decentralized Optimization on Compact Submanifolds by Quantized Riemannian Gradient Tracking [45.147301546565316]
  This paper considers the problem of decentralized optimization on compact submanifolds.<n>We propose an algorithm where agents update variables using quantized variables.<n>To the best of our knowledge, this is the first algorithm to achieve an $mathcalO (1/K)$ convergence rate in the presence of quantization.
  arXiv  Detail & Related papers  (2025-06-09T01:57:25Z)
• Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints [49.76332265680669]
  This paper examines a crucial subset of problems where both the objective and constraint functions are weakly convex.<n>Existing methods often face limitations, including slow convergence rates or reliance on double-loop designs.<n>We introduce a novel single-loop penalty-based algorithm to overcome these challenges.
  arXiv  Detail & Related papers  (2025-04-21T17:15:48Z)
• High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization [0.8341988468339112]
  Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing.<n>We leverage search-based methods to first approximately diagonalize a unitary, then perform the inversion analytically.<n>Our approach improves both the implementation precision and run time of synthesis algorithms by orders of magnitude when evaluated on unitaries from real quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-31T12:10:32Z)
• Quantum Circuit Optimization with AlphaTensor [47.9303833600197]
  We develop AlphaTensor-Quantum, a method to minimize the number of T gates that are needed to implement a given circuit. Unlike existing methods for T-count optimization, AlphaTensor-Quantum can incorporate domain-specific knowledge about quantum computation and leverage gadgets. Remarkably, it discovers an efficient algorithm akin to Karatsuba's method for multiplication in finite fields.
  arXiv  Detail & Related papers  (2024-02-22T09:20:54Z)
• Faster Quantum Algorithms with "Fractional"-Truncated Series [14.536572102408423]
  We introduce Randomized Truncated Series (RTS), a framework that significantly reduces circuit depth by quadratically improving truncation error and enabling continuous adjustment of the effective truncation order. We generalize the mixing lemma to near-unitary instances to support our error analysis and demonstrate the versatility of RTS through applications in linear combinations of unitaries, quantum signal processing, and quantum differential equations.
  arXiv  Detail & Related papers  (2024-02-08T11:49:24Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Improving Quantum Circuit Synthesis with Machine Learning [0.7894596908025954]
  We show how applying machine learning to unitary datasets permits drastic speedups for synthesis algorithms. This paper presents QSeed, a seeded synthesis algorithm that employs a learned model to quickly propose resource efficient circuit implementations of unitaries.
  arXiv  Detail & Related papers  (2023-06-09T01:53:56Z)
• Estimating gate-set properties from random sequences [0.0]
  Current quantum devices are only capable of short unstructured gate sequences followed by native measurements. A single experiment - random sequence estimation - solves a wealth of estimation problems. We derive robust channel variants of shadow estimation with close-to-optimal performance guarantees.
  arXiv  Detail & Related papers  (2021-10-25T18:01:25Z)
• 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.