Group-Theoretic Reinforcement Learning of Dynamical Decoupling Sequences

• URL: http://arxiv.org/abs/2512.13890v1
• Date: Mon, 15 Dec 2025 20:48:08 GMT
• Title: Group-Theoretic Reinforcement Learning of Dynamical Decoupling Sequences
• Authors: Charles Marrder, Shuo Sun, Murray J. Holland,
• Abstract summary: Dynamical decoupling seeks to mitigate phase decoherence in pulsebits by applying a sequence of effectively instantaneous electromagnetic pulses.<n>We demonstrate that our agent can learn sequences that dephas without requiring explicit knowledge of the underlying noise spectrum.
• Score: 9.136190419305427
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Dynamical decoupling seeks to mitigate phase decoherence in qubits by applying a carefully designed sequence of effectively instantaneous electromagnetic pulses. Although analytic solutions exist for pulse timings that are optimal under specific noise regimes, identifying the optimal timings for a realistic noise spectrum remains challenging. We propose a reinforcement learning (RL)-based method for designing pulse sequences on qubits. Our novel action set enables the RL agent to efficiently navigate this inherently non-convex optimization landscape. The action set, derived from Thompson's group $F$, is applicable to a broad class of sequential decision problems whose states can be represented as bounded sequences. We demonstrate that our RL agent can learn pulse sequences that minimize dephasing without requiring explicit knowledge of the underlying noise spectrum. This work opens the possibility for real-time learning of optimal dynamical decoupling sequences on qubits which are dephasing-limited. The model-free nature of our algorithm suggests that the agent may ultimately learn optimal pulse sequences even in the presence of unmodeled physical effects, such as pulse errors or non-Gaussian noise.

Related papers

• Dendritic Resonate-and-Fire Neuron for Effective and Efficient Long Sequence Modeling [66.0841376808143]
  Dendritic Resonate-and-Fire (RF) neurons can efficiently extract frequency from input signals and encode them into spike trains.<n>RF neurons exhibit limited effective memory capacity and a trade-off between energy efficiency and training speed on complex tasks.<n>We propose a Dendritic Resonate-and-Fire (D-RF) model, which explicitly incorporates a multi-dendritic and soma architecture.
  arXiv  Detail & Related papers  (2025-09-21T18:15:45Z)
• Efficient learning and optimizing non-Gaussian correlated noise in digitally controlled qubit systems [1.5293427903448027]
  We show how to achieve higher-order spectral estimation for noise-optimized circuit design.<n>Remarkably, we find that the digitally driven qubit dynamics can be solely determined by the complexity of the applied control.
  arXiv  Detail & Related papers  (2025-02-08T02:09:40Z)
• Provable Guarantees for Generative Behavior Cloning: Bridging Low-Level Stability and High-Level Behavior [51.60683890503293]
  We propose a theoretical framework for studying behavior cloning of complex expert demonstrations using generative modeling. We show that pure supervised cloning can generate trajectories matching the per-time step distribution of arbitrary expert trajectories.
  arXiv  Detail & Related papers  (2023-07-27T04:27:26Z)
• Optimistic Active Exploration of Dynamical Systems [52.91573056896633]
  We develop an algorithm for active exploration called OPAX. We show how OPAX can be reduced to an optimal control problem that can be solved at each episode. Our experiments show that OPAX is not only theoretically sound but also performs well for zero-shot planning on novel downstream tasks.
  arXiv  Detail & Related papers  (2023-06-21T16:26:59Z)
• Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits [55.03293214439741]
  In contextual bandits, an agent sequentially makes actions from a time-dependent action set based on past experience. We propose the first online continuous hyperparameter tuning framework for contextual bandits. We show that it could achieve a sublinear regret in theory and performs consistently better than all existing methods on both synthetic and real datasets.
  arXiv  Detail & Related papers  (2023-02-18T23:31:20Z)
• Self-Adapting Noise-Contrastive Estimation for Energy-Based Models [0.0]
  Training energy-based models with noise-contrastive estimation (NCE) is theoretically feasible but practically challenging. Previous works have explored modelling the noise distribution as a separate generative model, and then concurrently training this noise model with the EBM. This thesis proposes a self-adapting NCE algorithm which uses static instances of the EBM along its training trajectory as the noise distribution.
  arXiv  Detail & Related papers  (2022-11-03T15:17:43Z)
• Losing momentum in continuous-time stochastic optimisation [42.617042045455506]
  momentum-based optimisation algorithms have become particularly widespread. In this work, we analyse a continuous-time model for gradient descent with momentum. We also train a convolutional neural network in an image classification problem.
  arXiv  Detail & Related papers  (2022-09-08T10:46:05Z)
• Extracting Quantum Dynamical Resources: Consumption of Non-Markovianity for Noise Reduction [0.0]
  We show that the key resource responsible for noise suppression is non-Markovianity (or temporal correlations) We propose two methods to identify optimal pulse sequences for noise reduction. The corresponding tools are built on operational grounds and are easily implemented in the current generation of quantum devices.
  arXiv  Detail & Related papers  (2021-10-06T09:31:34Z)
• Designing arbitrary single-axis rotations robust against perpendicular time-dependent noise [0.0]
  We introduce a protocol to design bounded and continuous control fields that implement arbitrary single-axis rotations. We show the versatility of our method by presenting a set of non-negative-only control pulses.
  arXiv  Detail & Related papers  (2021-03-15T16:26:57Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Robust quantum gates using smooth pulses and physics-informed neural networks [0.0]
  We present the first general method for obtaining truly smooth pulses that minimizes sensitivity to noise. We parametrize the Hamiltonian using a neural network, which allows the use of a large number of optimization parameters. We demonstrate the capability of our approach by finding smooth shapes which suppress the effects of noise within the logical subspace as well as leakage out of that subspace.
  arXiv  Detail & Related papers  (2020-11-04T19:31:36Z)
• Process tomography of Robust Dynamical Decoupling in Superconducting Qubits [91.3755431537592]
  The Rigetti quantum computing platform was used to test different dynamical decoupling sequences. The performance of the sequences was characterized by Quantum Process Tomography and analyzed using the quantum channels formalism.
  arXiv  Detail & Related papers  (2020-06-18T14:48:18Z)

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.