Smolyak algorithm assisted robust control of quantum systems

• URL: http://arxiv.org/abs/2410.14286v2
• Date: Sat, 02 Nov 2024 04:03:54 GMT
• Title: Smolyak algorithm assisted robust control of quantum systems
• Authors: Zigui Zhang, Zibo Miao, Yu Chen, Xiu-Hao Deng,
• Abstract summary: 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.
• Score: 2.114161005361522
• License:
• Abstract: Efficient and systematic numerical methods for robust control design are crucial in quantum systems due to inevitable uncertainties or disturbances. We propose a novel approach that models uncertainties as random variables and quantifies robustness using the expectation of infidelity. By reformulating the robustness measure as a weighted tensor product quadrature, we employ the Smolyak sparse grid algorithm to develop a parametric robust quantum control scheme. This scheme significantly reduces computational cost while improving accuracy. 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, with ultrahigh fidelity and strong robustness achieved. Our results contribute to improving the reliability and security of quantum computing and communication systems in the presence of real-world imperfections.

Related papers

• Machine-learning-inspired quantum control in many-body dynamics [6.817811305553492]
  We introduce a promising and versatile control neural network tailored to optimize control fields. We address the problem of suppressing defect density and enhancing cat-state fidelity during the passage across the critical point in the quantum Ising model. In comparison to gradient-based power-law quench methods, our approach demonstrates significant advantages for both small system sizes and long-term evolutions.
  arXiv  Detail & Related papers  (2024-04-09T01:47:55Z)
• Binary Quantum Control Optimization with Uncertain Hamiltonians [4.194844657284146]
  We consider a discrete optimization formulation of a binary optimal quantum control problem involving Hamiltonians with predictable uncertainties. We propose a sample-based reformulation that optimize both risk-neutral and risk-averse measurements of control policies. We demonstrate that the controls of our model achieve significantly higher quality and robustness compared to the controls of a deterministic model.
  arXiv  Detail & Related papers  (2024-01-18T16:51:01Z)
• Hybrid algorithm simulating non-equilibrium steady states of an open quantum system [10.752869788647802]
  Non-equilibrium steady states are a focal point of research in the study of open quantum systems. Previous variational algorithms for searching these steady states have suffered from resource-intensive implementations. We present a novel variational quantum algorithm that efficiently searches for non-equilibrium steady states by simulating the operator-sum form of the Lindblad equation.
  arXiv  Detail & Related papers  (2023-09-13T01:57:27Z)
• 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)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• 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)
• 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.