Statistically Characterising Robustness and Fidelity of Quantum Controls and Quantum Control Algorithms

• URL: http://arxiv.org/abs/2207.07801v1
• Date: Sat, 16 Jul 2022 01:19:57 GMT
• Title: Statistically Characterising Robustness and Fidelity of Quantum Controls and Quantum Control Algorithms
• Authors: Irtaza Khalid, Carrie A. Weidner, Edmond A. Jonckheere, Sophie G. Shermer, Frank C. Langbein
• Abstract summary: The robustness-infidelity measure (RIM$_p$) is introduced to quantify the robustness and fidelity of a controller. Based on the RIM$_p$, an algorithmic robustness-infidelity measure (ARIM) is developed to quantify the expected robustness and fidelity of controllers.
• Score: 0.5599792629509229
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Robustness of quantum operations or controls is important to build reliable quantum devices. The robustness-infidelity measure (RIM$_p$) is introduced to statistically quantify the robustness and fidelity of a controller as the p-order Wasserstein distance between the fidelity distribution of the controller under any uncertainty and an ideal fidelity distribution. The RIM$_p$ is the p-th root of the p-th raw moment of the infidelity distribution. Using a metrization argument, we justify why RIM$_1$ (the average infidelity) suffices as a practical robustness measure. Based on the RIM$_p$, an algorithmic robustness-infidelity measure (ARIM) is developed to quantify the expected robustness and fidelity of controllers found by a control algorithm. The utility of the RIM and ARIM is demonstrated by considering the problem of robust control of spin- 12 networks using energy landscape shaping subject to Hamiltonian uncertainty. The robustness and fidelity of individual control solutions as well as the expected robustness and fidelity of controllers found by different popular quantum control algorithms are characterized. For algorithm comparisons, stochastic and non-stochastic optimization objectives are considered, with the goal of effective RIM optimization in the latter. Although high fidelity and robustness are often conflicting objectives, some high fidelity, robust controllers can usually be found, irrespective of the choice of the quantum control algorithm. However, for noisy optimization objectives, adaptive sequential decision making approaches such as reinforcement learning have a cost advantage compared to standard control algorithms and, in contrast, the infidelities obtained are more consistent with higher RIM values for low noise levels.

Related papers

• ODAR: Principled Adaptive Routing for LLM Reasoning via Active Inference [60.958331943869126]
  ODAR-Expert is an adaptive routing framework that optimize the accuracy-efficiency trade-off via principled resource allocation.<n>We show strong and consistent gains, including 98.2% accuracy on MATH and 54.8% on Humanity's Last Exam.
  arXiv  Detail & Related papers  (2026-02-27T05:22:01Z)
• Comparing and correcting robustness metrics for quantum optimal control [1.6927349660459692]
  We present a novel, systematic study demonstrating important numerical differences between adjoint end-point and toggling-frame approaches.<n>We also introduce a critical discretization correction to the widely-used robustness-frame estimator.<n>Our approach uniquely handles control and fidelity constraints while cleanly isolating robustness for dedicated optimization.
  arXiv  Detail & Related papers  (2026-02-10T22:44:16Z)
• Improved High-probability Convergence Guarantees of Decentralized SGD [74.39742894097348]
  We show that $mathttDSGD$ converges in HP under the same conditions on the cost as in the mean-squared error (MSE) sense.<n>Our improved analysis yields linear-up in the number of users, demonstrating that $mathttDSGD$ maintains performance in the HP sense.
  arXiv  Detail & Related papers  (2025-10-07T17:15:08Z)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Smolyak algorithm assisted robust control of quantum systems [2.114161005361522]
  We propose a novel approach that models uncertainties as random variables and quantifies robustness using the expectation of infidelity. We demonstrate the effectiveness of our Smolyak algorithm assisted gradient-based methods including smGOAT and smGRAPE in robust control problems regarding state transfer and quantum gate realization.
  arXiv  Detail & Related papers  (2024-10-18T08:40:59Z)
• Automatically Adaptive Conformal Risk Control [49.95190019041905]
  We propose a methodology for achieving approximate conditional control of statistical risks by adapting to the difficulty of test samples. Our framework goes beyond traditional conditional risk control based on user-provided conditioning events to the algorithmic, data-driven determination of appropriate function classes for conditioning.
  arXiv  Detail & Related papers  (2024-06-25T08:29:32Z)
• Robustness of Dynamic Quantum Control: Differential Sensitivity Bound [0.0]
  A new robustness measure based on the differential sensitivity of the gate fidelity error to parametric uncertainties is introduced. It is shown how a maximum allowable perturbation over a set of Hamiltonian uncertainties that guarantees a given fidelity error, can be reliably computed.
  arXiv  Detail & Related papers  (2023-12-30T18:36:53Z)
• Robust Control of Single-Qubit Gates at the Quantum Speed Limit [0.0]
  We investigate the underlying robust time-optimal control problem so as to make the best balance. Based on the Taylor expansion of the system's unitary propagator, we formulate the design problem as the optimal control of an augmented finite-dimensional system. Numerical simulations for single-qubit systems show that the obtained time-optimal control pulses can effectively suppress gate errors.
  arXiv  Detail & Related papers  (2023-09-11T10:10:58Z)
• Robust Control for Dynamical Systems With Non-Gaussian Noise via Formal Abstractions [59.605246463200736]
  We present a novel controller synthesis method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous control system into a finite-state model that captures noise by probabilistic transitions between discrete states. We use state-of-the-art verification techniques to provide guarantees on the interval Markov decision process and compute a controller for which these guarantees carry over to the original control system.
  arXiv  Detail & Related papers  (2023-01-04T10:40:30Z)
• Robust Quantum Control: Analysis & Synthesis via Averaging [0.2320417845168326]
  An approach is presented for robustness analysis and quantum (unitary) control synthesis based on the classic method of averaging. The result is a multicriterion optimization competing the nominal (uncertainty-free) fidelity with a well known robustness measure: the size of an interaction (error) Hamiltonian.
  arXiv  Detail & Related papers  (2022-08-30T12:09:40Z)
• Actor-Critic based Improper Reinforcement Learning [61.430513757337486]
  We consider an improper reinforcement learning setting where a learner is given $M$ base controllers for an unknown Markov decision process. We propose two algorithms: (1) a Policy Gradient-based approach; and (2) an algorithm that can switch between a simple Actor-Critic scheme and a Natural Actor-Critic scheme.
  arXiv  Detail & Related papers  (2022-07-19T05:55:02Z)
• Probabilistic robust linear quadratic regulators with Gaussian processes [73.0364959221845]
  Probabilistic models such as Gaussian processes (GPs) are powerful tools to learn unknown dynamical systems from data for subsequent use in control design. We present a novel controller synthesis for linearized GP dynamics that yields robust controllers with respect to a probabilistic stability margin.
  arXiv  Detail & Related papers  (2021-05-17T08:36:18Z)
• Risk-sensitive Optimization for Robust Quantum Controls [0.0]
  We show that the robustness of high-precision controls can be remarkably enhanced through sampling-based optimization of a risk-sensitive loss function. We propose two algorithms, which are tunable as the risk-sensitive GRAPE and the adaptive risk-sensitive GRAPE.
  arXiv  Detail & Related papers  (2021-04-03T06:44:10Z)
• Closing the Closed-Loop Distribution Shift in Safe Imitation Learning [80.05727171757454]
  We treat safe optimization-based control strategies as experts in an imitation learning problem. We train a learned policy that can be cheaply evaluated at run-time and that provably satisfies the same safety guarantees as the expert.
  arXiv  Detail & Related papers  (2021-02-18T05:11:41Z)
• Enforcing robust control guarantees within neural network policies [76.00287474159973]
  We propose a generic nonlinear control policy class, parameterized by neural networks, that enforces the same provable robustness criteria as robust control. We demonstrate the power of this approach on several domains, improving in average-case performance over existing robust control methods and in worst-case stability over (non-robust) deep RL methods.
  arXiv  Detail & Related papers  (2020-11-16T17:14:59Z)

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.