Dynamical Decoupling using Universal Optimal Tracking

• URL: http://arxiv.org/abs/2606.21762v1
• Date: Fri, 19 Jun 2026 21:25:00 GMT
• Title: Dynamical Decoupling using Universal Optimal Tracking
• Abstract summary: We introduce a universal optimal tracking approach that extends the original tracking concept to a fully state-independent setting for designing DD sequences.<n> Experimental demonstrations on a superconducting-qubit platform confirm the suppression of error accumulation under static control imperfections.<n>These results establish optimal tracking as a practical and hardware-agnostic approach to designing short, robust DD sequences suitable for noisy quantum devices.
• Score: 0.3070939646558157
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Dynamical decoupling (DD) is a widely used and resource-efficient technique for error suppression, but conventional DD relies on periodically repeating a short pulse block to refocus the qubit state during idle periods. Imperfections in this block cause residual errors to accumulate, ultimately degrading state recovery over long idle times. Here, we introduce a universal optimal tracking approach that extends the original tracking concept to a fully state-independent setting for designing DD sequences. By monitoring the qubit's evolution at predefined waypoints during optimization, the method dynamically compensates residual errors while preserving regular refocusing. Experimental demonstrations on a superconducting-qubit platform confirm the suppression of error accumulation under static control imperfections, in agreement with numerical predictions. Complementary simulations further show that optimal-tracking-based sequences maintain strong performance under time-dependent noise. These results establish optimal tracking as a practical and hardware-agnostic approach to designing short, robust DD sequences suitable for noisy quantum devices.

Related papers

• Distributed Optimization with Streaming Data: A Temporal Weighting Perspective [26.702871313273942]
  We study decentralized optimization from streaming data through a structured time-varying formulation.<n>We analyze multi-iteration decentralized first-order methods, including decentralized gradient descent.<n>We specialize our analysis to uniform and exponentially discounted weights, as well as their finite-memory emphwindowed counterparts.
  arXiv  Detail & Related papers  (2026-08-10T13:02:58Z)
• Stabilizing Extrapolation in Looped Transformers via Learned Stochastic Stopping [56.14767235650558]
  Looped Transformers, which repeatedly apply a shared transformer block, are an architecturally natural fit for variable-length computation tasks.<n>We trace this variance to the spurious correlation in simple algorithmic tasks between sequence length and number of loops.<n>Our work suggests that "when to stop" should be treated as a training design choice, not merely an inference-time-allocation rule.
  arXiv  Detail & Related papers  (2026-06-29T08:58:09Z)
• SATB-VR: Training Few-Step Video Restoration Diffusion Model using SNR-Aware Trajectory Blending [55.764018145256216]
  We present SATB-VR, a few-step paradigm that jump-starts the denoising process via an auxiliary predictor.<n>We show that SATB-VR performs favorably against existing approaches on synthetic, real-world, and AIGC benchmarks.
  arXiv  Detail & Related papers  (2026-06-27T01:32:16Z)
• DiRecT: Safe Diffusion-Based Planning via Receding-Horizon Denoising [4.249024052507976]
  We introduce DiRecT, a training-free algorithm for constrained sampling from diffusion models via optimal control (SOC)<n>Inspired by model predictive control, we derive a receding-horizon surrogate for the otherwise intractable constrained SOC formulation.<n>Experiments demonstrate that DiRecT substantially improves deployment safety and task performance over existing diffusion-based planning baselines.
  arXiv  Detail & Related papers  (2026-06-13T15:41:26Z)
• Hierarchical ODE: Learning Continuous-Time Physical Prototypes for Early Link Failure Detection [7.172511482356683]
  Time series prototype learning is fundamentally challenged by observational ambiguity.<n>We propose a hierarchical ordinary differential equation clustering network, which utilizes neural ordinary differential equation to model latent state evolution.<n>This formulation enforces temporal continuity to effectively disentangle smooth feature trends from noise, while our adaptive hierarchical mechanism autonomously determines the appropriate number of prototypes.
  arXiv  Detail & Related papers  (2026-06-12T09:06:07Z)
• Clipping Bottleneck: Stabilizing RLVR via Stochastic Recovery of Near-Boundary Signals [83.0127582612634]
  Near-boundary Rescue (NSR) is a minimal, plug-and-play modification that retains out-of-bound tokens to recover lost signals.<n>NSR substantially improves training stability and delivers consistent gains over strong baselines such as DAPO and GSPO.
  arXiv  Detail & Related papers  (2026-05-21T16:45:31Z)
• Multi-scale Coarse-to-fine Modeling for Test-time Human Motion Control [51.92884966472683]
  MSCoT is a multi-scale, coarse-to-fine model for test-time human motion synthesis and control.<n> MSCoT discretizes motion into a multi-scale hierarchical representation and predicts the entire token sequence at each temporal scale.
  arXiv  Detail & Related papers  (2026-05-14T15:09:49Z)
• Conservative Continuous-Time Treatment Optimization [9.553261527696067]
  We develop a conservative continuous-time control framework for treatment optimization from irregularly sampled patient trajectories.<n>Experiments on benchmark datasets show improved robustness and performance compared to non-conservative baselines.
  arXiv  Detail & Related papers  (2026-03-17T17:01:23Z)
• Deep Reinforcement Learning Optimization for Uncertain Nonlinear Systems via Event-Triggered Robust Adaptive Dynamic Programming [0.3848364262836075]
  This work proposes a unified control architecture that couples a Reinforcement Learning (RL)-driven controller with a disturbance-rejection Extended State Observer (ESO)<n>The ESO is utilized to estimate the system states and the lumped disturbance in real time, forming the foundation for effective disturbance compensation.
  arXiv  Detail & Related papers  (2025-12-05T22:52:22Z)
• Adaptive Deadline and Batch Layered Synchronized Federated Learning [66.93447103966439]
  Federated learning (FL) enables collaborative model training across distributed edge devices while preserving data privacy, and typically operates in a round-based synchronous manner.<n>We propose ADEL-FL, a novel framework that jointly optimize per-round deadlines and user-specific batch sizes for layer-wise aggregation.
  arXiv  Detail & Related papers  (2025-05-29T19:59:18Z)
• CT-OT Flow: Estimating Continuous-Time Dynamics from Discrete Temporal Snapshots [14.39808568320318]
  Continuous-Time Optimal Transport Flow (CT-OT Flow) is a framework that infers high-resolution time labels and reconstructs a continuous-time data distribution.<n>CT-OT Flow reduces distributional and trajectory errors compared with OT-CFM, [SF](2)M, TrajectoryNet, MFM, and ENOT.
  arXiv  Detail & Related papers  (2025-05-23T00:12:49Z)
• Error-quantified Conformal Inference for Time Series [55.11926160774831]
  Uncertainty quantification in time series prediction is challenging due to the temporal dependence and distribution shift on sequential data.<n>We propose itError-quantified Conformal Inference (ECI) by smoothing the quantile loss function.<n>ECI can achieve valid miscoverage control and output tighter prediction sets than other baselines.
  arXiv  Detail & Related papers  (2025-02-02T15:02:36Z)
• Towards Understanding the Generalizability of Delayed Stochastic Gradient Descent [63.43247232708004]
  A gradient descent performed in an asynchronous manner plays a crucial role in training large-scale machine learning models.<n>Existing generalization error bounds are rather pessimistic and cannot reveal the correlation between asynchronous delays and generalization.<n>Our theoretical results indicate that asynchronous delays reduce the generalization error of the delayed SGD algorithm.
  arXiv  Detail & Related papers  (2023-08-18T10:00:27Z)

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.