Automated Discovery of Gadgets in Quantum Circuits for Efficient Reinforcement Learning

• URL: http://arxiv.org/abs/2509.24666v1
• Date: Mon, 29 Sep 2025 12:13:25 GMT
• Title: Automated Discovery of Gadgets in Quantum Circuits for Efficient Reinforcement Learning
• Abstract summary: We suggest an algorithm for the automated discovery of new gadgets and families of related gadgets.<n>The algorithm is based on the representation of quantum circuits as directed graphs and an automated search for repeated subgraphs.<n>We compare the performance of 4-qubit gadgets taken from a previously known and a newly discovered family and discuss their advantages and disadvantages.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Reinforcement learning (RL) has proven itself as a powerful tool for the discovery of quantum circuits and quantum protocols. We have recently shown that including composite quantum gates -- referred to as ``gadgets'' -- in the action space of RL agents substantially enhances the RL performance in the context of quantum error correction. However, up to now the gadgets themselves had to be constructed manually. In this paper, we suggest an algorithm for the automated discovery of new gadgets and families of related gadgets. The algorithm is based on the representation of quantum circuits as directed graphs and an automated search for repeated subgraphs. The latter are identified as gadgets. We demonstrate the efficiency of the algorithm, which allows us to find two new gadget families suitable for RL. We compare the performance of 4-qubit gadgets taken from a previously known and a newly discovered family and discuss their advantages and disadvantages.

Related papers

• Automated near-term quantum algorithm discovery for molecular ground states [33.691278813186564]
  We use Hive, an AI platform for program synthesis, to drive a highly distributed evolutionary process for discovering new algorithms.<n>We focus on the ground state problem in quantum chemistry, and discover efficient quantum algorithms that solve it for molecules LiH, H2O, and F2.<n>We benchmark the Hive-discovered circuits on the Quantinuum System Model H2 quantum computer and identify minimum system requirements for chemical precision.
  arXiv  Detail & Related papers  (2026-03-27T12:37:20Z)
• Quantum Agents for Algorithmic Discovery [0.42970700836450476]
  We introduce quantum agents trained by episodic, reward-based reinforcement learning to autonomously rediscover several seminal quantum algorithms and protocols.<n>In particular, our agents learn: efficient logarithmic-depth quantum circuits for the Quantum Fourier Transform; Grover's search algorithm; optimal cheating strategies for strong coin flipping.
  arXiv  Detail & Related papers  (2025-10-09T12:38:53Z)
• Q-Fusion: Diffusing Quantum Circuits [2.348041867134616]
  We propose a diffusion-based algorithm leveraging the LayerDAG framework to generate new quantum circuits.<n>Our results demonstrate that the proposed model consistently generates 100% valid quantum circuit outputs.
  arXiv  Detail & Related papers  (2025-04-29T14:10:10Z)
• Scaling the Automated Discovery of Quantum Circuits via Reinforcement Learning with Gadgets [0.0]
  Reinforcement Learning (RL) has established itself as a powerful tool for designing quantum circuits.<n>We propose a principled approach based on the systematic discovery and introduction of composite gates.<n>We demonstrate that incorporating gadgets in the form of composite Clifford gates, in addition to standard CNOT and Hadamard gates, significantly enhances the efficiency of RL agents.
  arXiv  Detail & Related papers  (2025-03-14T17:55:49Z)
• Reinforcement learning with learned gadgets to tackle hard quantum problems on real hardware [0.0]
  We introduce gadget reinforcement learning (GRL), which integrates reinforcement learning with program synthesis to automatically generate and incorporate composite gates (gadgets) into the action space.<n>This enhances the exploration of parameterized quantum circuits (PQCs) for complex tasks like approximating ground states of quantum Hamiltonians, an NP-hard problem.<n>GRL exhibits robust performance as the size and complexity of the problem increases, even with constrained computational resources.
  arXiv  Detail & Related papers  (2024-10-31T22:02:32Z)
• 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 Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• 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)
• Automated Gadget Discovery in Science [0.0]
  We gain insights into an RL agent's learned behavior through a post-hoc analysis based on sequence mining and clustering. Specifically, frequent and compact subroutines, used by the agent to solve a given task, are distilled as gadgets and then grouped by various metrics. This approach for analyzing the policy of a learned agent is agent and environment agnostic and can yield interesting insights into any agent's policy.
  arXiv  Detail & Related papers  (2022-12-24T14:52:22Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Entangling Quantum Generative Adversarial Networks [53.25397072813582]
  We propose a new type of architecture for quantum generative adversarial networks (entangling quantum GAN, EQ-GAN) We show that EQ-GAN has additional robustness against coherent errors and demonstrate the effectiveness of EQ-GAN experimentally in a Google Sycamore superconducting quantum processor.
  arXiv  Detail & Related papers  (2021-04-30T20:38:41Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

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.