Achieving fast high-fidelity optimal control of many-body quantum dynamics

• URL: http://arxiv.org/abs/2008.06076v5
• Date: Wed, 27 Oct 2021 15:29:24 GMT
• Title: Achieving fast high-fidelity optimal control of many-body quantum dynamics
• Authors: Jesper Hasseriis Mohr Jensen, Frederik Skovbo M{\o}ller, Jens Jakob S{\o}rensen, Jacob Friis Sherson
• Abstract summary: We demonstrate the efficiency of a recent exact-gradient optimal control methodology by applying it to a challenging many-body problem. We observe fidelities in the range 0.99-0.9999 with associated minimal process duration estimates. Overall, the comparison suggests significant methodological improvements also for many-body systems in the ideal open-loop setting.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We demonstrate the efficiency of a recent exact-gradient optimal control methodology by applying it to a challenging many-body problem, crossing the superfluid to Mott-insulator phase transition in the Bose-Hubbard model. The system size necessitates a matrix product state representation and this seamlessly integrates with the requirements of the algorithm. We observe fidelities in the range 0.99-0.9999 with associated minimal process duration estimates displaying an exponential fidelity-duration trade-off across several orders of magnitude. The corresponding optimal solutions are characterized in terms of a predominantly linear sweep across the critical point followed by bang-bang-like structure. This is quite different from the smooth and monotonic solutions identified by earlier gradient-free optimizations which are hampered in locating the higher complexity protocols in the regime of high-fidelities at low process durations. Overall, the comparison suggests significant methodological improvements also for many-body systems in the ideal open-loop setting. Acknowledging that idealized open-loop control may deteriorate in actual experiments, we discuss the merits of using such an approach in combination with closed-loop control -- in particular, high-fidelity physical insights extracted with the former can be used to formulate practical, low-dimensional search spaces for the latter.

Related papers

• A Simulation-Free Deep Learning Approach to Stochastic Optimal Control [12.699529713351287]
  We propose a simulation-free algorithm for the solution of generic problems in optimal control (SOC) Unlike existing methods, our approach does not require the solution of an adjoint problem.
  arXiv  Detail & Related papers  (2024-10-07T16:16:53Z)
• 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)
• Optimized trajectory unraveling for classical simulation of noisy quantum dynamics [4.772237365196053]
  We show that for an arbitrary decoherence channel, one can optimize the unraveling scheme to lower the threshold for entanglement phase transition. We also present a algorithm that adaptively optimize the unraveling basis for given noise channels. We assess the possibility of using a quasi-local unraveling to efficiently simulate open systems with an arbitrarily small but finite decoherence rate.
  arXiv  Detail & Related papers  (2023-06-29T17:59:01Z)
• An Optimization-based Deep Equilibrium Model for Hyperspectral Image Deconvolution with Convergence Guarantees [71.57324258813675]
  We propose a novel methodology for addressing the hyperspectral image deconvolution problem. A new optimization problem is formulated, leveraging a learnable regularizer in the form of a neural network. The derived iterative solver is then expressed as a fixed-point calculation problem within the Deep Equilibrium framework.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• No-Regret Constrained Bayesian Optimization of Noisy and Expensive Hybrid Models using Differentiable Quantile Function Approximations [0.0]
  Constrained Upper Quantile Bound (CUQB) is a conceptually simple, deterministic approach that avoids constraint approximations. We show that CUQB significantly outperforms traditional Bayesian optimization in both constrained and unconstrained cases.
  arXiv  Detail & Related papers  (2023-05-05T19:57:36Z)
• Log Barriers for Safe Black-box Optimization with Application to Safe Reinforcement Learning [72.97229770329214]
  We introduce a general approach for seeking high dimensional non-linear optimization problems in which maintaining safety during learning is crucial. Our approach called LBSGD is based on applying a logarithmic barrier approximation with a carefully chosen step size. We demonstrate the effectiveness of our approach on minimizing violation in policy tasks in safe reinforcement learning.
  arXiv  Detail & Related papers  (2022-07-21T11:14:47Z)
• On optimization of coherent and incoherent controls for two-level quantum systems [77.34726150561087]
  This article considers some control problems for closed and open two-level quantum systems. The closed system's dynamics is governed by the Schr"odinger equation with coherent control. The open system's dynamics is governed by the Gorini-Kossakowski-Sudarshan-Lindblad master equation.
  arXiv  Detail & Related papers  (2022-05-05T09:08:03Z)
• Optimization on manifolds: A symplectic approach [127.54402681305629]
  We propose a dissipative extension of Dirac's theory of constrained Hamiltonian systems as a general framework for solving optimization problems. Our class of (accelerated) algorithms are not only simple and efficient but also applicable to a broad range of contexts.
  arXiv  Detail & Related papers  (2021-07-23T13:43:34Z)
• Pushing the Envelope of Rotation Averaging for Visual SLAM [69.7375052440794]
  We propose a novel optimization backbone for visual SLAM systems. We leverage averaging to improve the accuracy, efficiency and robustness of conventional monocular SLAM systems. Our approach can exhibit up to 10x faster with comparable accuracy against the state-art on public benchmarks.
  arXiv  Detail & Related papers  (2020-11-02T18:02:26Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)
• Convergence and sample complexity of gradient methods for the model-free linear quadratic regulator problem [27.09339991866556]
  We show that ODE searches for optimal control for an unknown computation system by directly searching over the corresponding space of controllers. We take a step towards demystifying the performance and efficiency of such methods by focusing on the gradient-flow dynamics set of stabilizing feedback gains and a similar result holds for the forward disctization of the ODE.
  arXiv  Detail & Related papers  (2019-12-26T16:56: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.