Learning Non-Markovian Noise via Ensemble Optimal Control

• URL: http://arxiv.org/abs/2604.16784v1
• Date: Sat, 18 Apr 2026 02:15:58 GMT
• Title: Learning Non-Markovian Noise via Ensemble Optimal Control
• Abstract summary: We study the estimation of parameters pertaining to non-Markovian quantum open systems.<n>A key challenge is identifying the optimal measurement time.<n>We develop an optimized control scheme trained over a representative ensemble to fix the optimal measurement time.
• Score: 2.988764345475669
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the estimation of parameters pertaining to non-Markovian quantum open systems, such as the dissipation rate and environmental memory time. A key challenge is identifying the optimal measurement time, which must allow sufficient time to acquire information about the environment, yet be short enough to avoid dissipation that erases the information. Using machine learning approaches, we develop an optimized control scheme trained over a representative ensemble to fix the optimal measurement time at a prescribed runtime. The protocol is robust to errors in the training process, enhances precision by exploiting non-Markovian memory effects, and achieves measurement uncertainties approaching the quantum limits set by the Cramér-Rao bound.

Related papers

• Active Timepoint Selection for Learning Measure-Valued Trajectories [55.49809248697036]
  Inferring continuous probability paths from snapshots is a fundamental challenge in domains like single-cell biology.<n>We introduce a framework which extends active experimentation to the space of sparse measures.<n>This yields an acquisition policy that iteratively selects measurement times to minimize uncertainty.
  arXiv  Detail & Related papers  (2026-05-28T22:22:35Z)
• Timestep-Aware Block Masking for Efficient Diffusion Model Inference [48.764748095994996]
  Diffusion Probabilistic Models (DPMs) have achieved great success in image generation but suffer from high inference latency.<n>We propose a novel framework to optimize the computational graph of pre-trained DPMs on a per-timestep basis.
  arXiv  Detail & Related papers  (2026-03-20T13:35:03Z)
• Optimal quantum metrology protocols with erasure qubits [0.0]
  We study a hierarchy of precision limits achievable with metrological strategies of differing complexity.<n>The detectability of erasure noise is shown to lead to enhanced precision limits and simplified sensing protocols.
  arXiv  Detail & Related papers  (2026-03-12T11:09:57Z)
• Suppressing Measurement Noise in Logical Qubits Through Measurement Scheduling [1.419616346522232]
  Noise in single-shot measurements limits logical readout fidelity, forming a critical bottleneck for quantum computation.<n>We propose a dynamic measurement scheduling protocol that suppresses logical readout errors by adaptively redistributing measurement tasks from error-prone qubits to stable nodes.<n> Numerical simulations show that logical error rates can be reduced by up to 34% across code distances for 3 to 11, with enhanced robustness in measurement-noise-dominated systems.
  arXiv  Detail & Related papers  (2025-05-12T01:54:40Z)
• Bisimulation metric for Model Predictive Control [44.301098448479195]
  Bisimulation Metric for Model Predictive Control (BS-MPC) is a novel approach that incorporates bisimulation metric loss in its objective function to directly optimize the encoder. BS-MPC improves training stability, robustness against input noise, and computational efficiency by reducing training time. We evaluate BS-MPC on both continuous control and image-based tasks from the DeepMind Control Suite.
  arXiv  Detail & Related papers  (2024-10-06T17:12:10Z)
• Time-adaptive phase estimation [0.0]
  We present Bayesian phase estimation methods that adaptively choose a control phase and the time of coherent evolution based on prior phase knowledge.<n>We find near-optimal performance with respect to known theoretical bounds, and demonstrate some robustness of the estimates to noise that is not accounted for in the model of the estimator.<n>The methods provide optimal solutions accounting for available prior knowledge and experimental imperfections with minimal effort from the user.
  arXiv  Detail & Related papers  (2024-05-14T19:49:22Z)
• Score Matching-based Pseudolikelihood Estimation of Neural Marked Spatio-Temporal Point Process with Uncertainty Quantification [59.81904428056924]
  We introduce SMASH: a Score MAtching estimator for learning markedPs with uncertainty quantification. Specifically, our framework adopts a normalization-free objective by estimating the pseudolikelihood of markedPs through score-matching. The superior performance of our proposed framework is demonstrated through extensive experiments in both event prediction and uncertainty quantification.
  arXiv  Detail & Related papers  (2023-10-25T02:37:51Z)
• Towards Robust Continual Learning with Bayesian Adaptive Moment Regularization [51.34904967046097]
  Continual learning seeks to overcome the challenge of catastrophic forgetting, where a model forgets previously learnt information. We introduce a novel prior-based method that better constrains parameter growth, reducing catastrophic forgetting. Results show that BAdam achieves state-of-the-art performance for prior-based methods on challenging single-headed class-incremental experiments.
  arXiv  Detail & Related papers  (2023-09-15T17:10:51Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Managing Temporal Resolution in Continuous Value Estimation: A Fundamental Trade-off [39.061605300172175]
  We show that managing the temporal resolution can improve policy evaluation efficiency in LQR systems with finite data. These findings show that managing the temporal resolution can provably improve policy evaluation efficiency in LQR systems with finite data.
  arXiv  Detail & Related papers  (2022-12-17T20:45:34Z)
• Fast Quantum Calibration using Bayesian Optimization with State Parameter Estimator for Non-Markovian Environment [11.710177724383954]
  We propose a real-time optimal estimator of qubit states, which utilizes weak measurements and Bayesian optimization to find the optimal control pulses for gate design. Our numerical results demonstrate a significant reduction in the calibration process, obtaining a high gate fidelity.
  arXiv  Detail & Related papers  (2022-05-25T17:31:15Z)
• Temporal Difference Uncertainties as a Signal for Exploration [76.6341354269013]
  An effective approach to exploration in reinforcement learning is to rely on an agent's uncertainty over the optimal policy. In this paper, we highlight that value estimates are easily biased and temporally inconsistent. We propose a novel method for estimating uncertainty over the value function that relies on inducing a distribution over temporal difference errors.
  arXiv  Detail & Related papers  (2020-10-05T18:11:22Z)
• Non-Markovian memory in a measurement-based quantum computer [0.0]
  We study the exact open system dynamics of single qubit gates during a measurement-based quantum computation. We show that the average fidelity is identical for the X-gate and Z-gate and that neither fast application of the projective measurements necessarily implies high gate fidelity.
  arXiv  Detail & Related papers  (2020-05-21T20:18:11Z)

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.