Automated Gadget Discovery in Science

• URL: http://arxiv.org/abs/2212.12743v1
• Date: Sat, 24 Dec 2022 14:52:22 GMT
• Title: Automated Gadget Discovery in Science
• Authors: Lea M. Trenkwalder, Andrea L\'opez Incera, Hendrik Poulsen Nautrup, Fulvio Flamini, Hans J. Briegel
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In recent years, reinforcement learning (RL) has become increasingly successful in its application to science and the process of scientific discovery in general. However, while RL algorithms learn to solve increasingly complex problems, interpreting the solutions they provide becomes ever more challenging. In this work, 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 process of gadget discovery develops in three stages: First, we use an RL agent to generate data, then, we employ a mining algorithm to extract gadgets and finally, the obtained gadgets are grouped by a density-based clustering algorithm. We demonstrate our method by applying it to two quantum-inspired RL environments. First, we consider simulated quantum optics experiments for the design of high-dimensional multipartite entangled states where the algorithm finds gadgets that correspond to modern interferometer setups. Second, we consider a circuit-based quantum computing environment where the algorithm discovers various gadgets for quantum information processing, such as quantum teleportation. 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.

Related papers

• A Quantum Range-Doppler Algorithm for Synthetic Aperture Radar Image Formation [48.123217909844946]
  We show how in general reference functions, a key element in many SAR focusing algorithms, can be mapped to quantum gates. We find that the core of the quantum range-Doppler algorithm has a computational complexity $O(N)$, less than its classical counterpart.
  arXiv  Detail & Related papers  (2025-04-29T14:24:23Z)
• 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. We propose a principled approach based on the systematic discovery and introduction of composite gates. 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)
• From Easy to Hard: Tackling Quantum Problems with Learned Gadgets For Real Hardware [0.0]
  Reinforcement learning has proven to be a powerful approach, but many limitations remain due to the exponential scaling of the space of possible operations on qubits. We develop an algorithm that automatically learns composite gates ("$gadgets$") and adds them as additional actions to the reinforcement learning agent to facilitate the search. We show that with GRL we can find very compact PQCs that improve the error in estimating the ground state of TFIM by up to $107$ fold.
  arXiv  Detail & Related papers  (2024-10-31T22:02:32Z)
• Hardware-efficient variational quantum algorithm in trapped-ion quantum computer [0.0]
  We study a hardware-efficient variational quantum algorithm ansatz tailored for the trapped-ion quantum simulator, HEA-TI. We leverage programmable single-qubit rotations and global spin-spin interactions among all ions, reducing the dependence on resource-intensive two-qubit gates in conventional gate-based methods.
  arXiv  Detail & Related papers  (2024-07-03T14:02:20Z)
• 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)
• Simultaneous Discovery of Quantum Error Correction Codes and Encoders with a Noise-Aware Reinforcement Learning Agent [0.0]
  In this work, we significantly expand the power ofReinforcement learning approaches to QEC code discovery. Explicitly, we train an RL agent that automatically discovers both QEC codes and their encoding circuits for a given gate set. We introduce the concept of a noise-aware meta-agent, which learns to produce encoding strategies simultaneously for a range of noise models.
  arXiv  Detail & Related papers  (2023-11-08T15:19:16Z)
• Multimodal deep representation learning for quantum cross-platform verification [60.01590250213637]
  Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms. We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities. We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
  arXiv  Detail & Related papers  (2023-11-07T04:35:03Z)
• Parametrized Complexity of Quantum Inspired Algorithms [0.0]
  Two promising areas of quantum algorithms are quantum machine learning and quantum optimization. Motivated by recent progress in quantum technologies and in particular quantum software, research and industrial communities have been trying to discover new applications of quantum algorithms.
  arXiv  Detail & Related papers  (2021-12-22T06:19:36Z)
• Towards Multi-Agent Reinforcement Learning using Quantum Boltzmann Machines [2.015864965523243]
  We propose an extension to the original concept in order to solve more challenging problems. We add an experience replay buffer and use different networks for approximating the target and policy values. Quantum sampling proves to be a promising method for reinforcement learning tasks, but is currently limited by the QPU size.
  arXiv  Detail & Related papers  (2021-09-22T17:59:24Z)
• Quantum speedup for track reconstruction in particle accelerators [51.00143435208596]
  We identify four fundamental routines present in every local tracking method and analyse how they scale in the context of a standard tracking algorithm. Although the found quantum speedups are mild, this constitutes to the best of our knowledge, the first rigorous evidence of a quantum advantage for a high-energy physics data processing task.
  arXiv  Detail & Related papers  (2021-04-23T13:32:14Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Discovering Reinforcement Learning Algorithms [53.72358280495428]
  Reinforcement learning algorithms update an agent's parameters according to one of several possible rules. This paper introduces a new meta-learning approach that discovers an entire update rule. It includes both 'what to predict' (e.g. value functions) and 'how to learn from it' by interacting with a set of environments.
  arXiv  Detail & Related papers  (2020-07-17T07:38:39Z)
• Quantum Geometric Machine Learning for Quantum Circuits and Control [78.50747042819503]
  We review and extend the application of deep learning to quantum geometric control problems. We demonstrate enhancements in time-optimal control in the context of quantum circuit synthesis problems. Our results are of interest to researchers in quantum control and quantum information theory seeking to combine machine learning and geometric techniques for time-optimal control problems.
  arXiv  Detail & Related papers  (2020-06-19T19:12:14Z)

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.