Learning of Hamiltonian Dynamics with Reproducing Kernel Hilbert Spaces
- URL: http://arxiv.org/abs/2312.09734v2
- Date: Thu, 24 Oct 2024 10:16:58 GMT
- Title: Learning of Hamiltonian Dynamics with Reproducing Kernel Hilbert Spaces
- Authors: Torbjørn Smith, Olav Egeland,
- Abstract summary: This paper presents a method for learning Hamiltonian dynamics from a limited set of data points.
The Hamiltonian vector field is found by regularized optimization over a reproducing kernel Hilbert space of vector fields that are inherently Hamiltonian.
The performance of the method is validated in simulations for two Hamiltonian systems.
- Score: 0.7510165488300369
- License:
- Abstract: This paper presents a method for learning Hamiltonian dynamics from a limited set of data points. The Hamiltonian vector field is found by regularized optimization over a reproducing kernel Hilbert space of vector fields that are inherently Hamiltonian, and where the vector field is required to be odd or even. This is done with a symplectic kernel, and it is shown how this symplectic kernel can be modified to be odd or even. The performance of the method is validated in simulations for two Hamiltonian systems. The simulations show that the learned dynamics reflect the energy-preservation of the Hamiltonian dynamics, and that the restriction to symplectic and odd dynamics gives improved accuracy over a large domain of the phase space.
Related papers
- Learning dissipative Hamiltonian dynamics with reproducing kernel Hilbert spaces and random Fourier features [0.7510165488300369]
This paper presents a new method for learning dissipative Hamiltonian dynamics from a limited and noisy dataset.
The performance of the method is validated in simulations for two dissipative Hamiltonian systems.
arXiv Detail & Related papers (2024-10-24T11:35:39Z) - Truncated Gaussian basis approach for simulating many-body dynamics [0.0]
The approach constructs an effective Hamiltonian within a reduced subspace, spanned by fermionic Gaussian states, and diagonalizes it to obtain approximate eigenstates and eigenenergies.
Symmetries can be exploited to perform parallel computation, enabling to simulate systems with much larger sizes.
For quench dynamics we observe that time-evolving wave functions in the truncated subspace facilitates the simulation of long-time dynamics.
arXiv Detail & Related papers (2024-10-05T15:47:01Z) - Quantum Simulation of Nonlinear Dynamical Systems Using Repeated Measurement [42.896772730859645]
We present a quantum algorithm based on repeated measurement to solve initial-value problems for nonlinear ordinary differential equations.
We apply this approach to the classic logistic and Lorenz systems in both integrable and chaotic regimes.
arXiv Detail & Related papers (2024-10-04T18:06:12Z) - Learning Hamiltonian Dynamics with Reproducing Kernel Hilbert Spaces and Random Features [0.7510165488300369]
The performance of the method is validated in simulations for three Hamiltonian systems.
It is demonstrated that the use of an odd symplectic kernel improves prediction accuracy and data efficiency.
arXiv Detail & Related papers (2024-04-11T12:49:30Z) - Coarse-Graining Hamiltonian Systems Using WSINDy [0.0]
We show that WSINDy can successfully identify a reduced Hamiltonian system in the presence of large intrinsics.
WSINDy naturally preserves the Hamiltonian structure by restricting to a trial basis of Hamiltonian vector fields.
We also provide a contribution to averaging theory by proving that first-order averaging at the level of vector fields preserves Hamiltonian structure in nearly-periodic Hamiltonian systems.
arXiv Detail & Related papers (2023-10-09T17:20:04Z) - Vectorization of the density matrix and quantum simulation of the von
Neumann equation of time-dependent Hamiltonians [65.268245109828]
We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations.
We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix.
A quantum algorithm to simulate the dynamics of the density matrix is proposed.
arXiv Detail & Related papers (2023-06-14T23:08:51Z) - Mapping Molecular Hamiltonians into Hamiltonians of Modular cQED
Processors [50.893896302254944]
We introduce a general method to map the Hamiltonian of an arbitrary model system into the Hamiltonian of a circuit Quantum Electrodynamics (cQED) processor.
The method is illustrated as applied to quantum dynamics simulations of the Fenna-Matthews-Olson complex and the spin-boson model of charge transfer.
arXiv Detail & Related papers (2023-06-10T04:52:58Z) - Capturing dynamical correlations using implicit neural representations [85.66456606776552]
We develop an artificial intelligence framework which combines a neural network trained to mimic simulated data from a model Hamiltonian with automatic differentiation to recover unknown parameters from experimental data.
In doing so, we illustrate the ability to build and train a differentiable model only once, which then can be applied in real-time to multi-dimensional scattering data.
arXiv Detail & Related papers (2023-04-08T07:55:36Z) - Fermionic approach to variational quantum simulation of Kitaev spin
models [50.92854230325576]
Kitaev spin models are well known for being exactly solvable in a certain parameter regime via a mapping to free fermions.
We use classical simulations to explore a novel variational ansatz that takes advantage of this fermionic representation.
We also comment on the implications of our results for simulating non-Abelian anyons on quantum computers.
arXiv Detail & Related papers (2022-04-11T18:00:01Z) - Learning Neural Hamiltonian Dynamics: A Methodological Overview [109.40968389896639]
Hamiltonian dynamics endows neural networks with accurate long-term prediction, interpretability, and data-efficient learning.
We systematically survey recently proposed Hamiltonian neural network models, with a special emphasis on methodologies.
arXiv Detail & Related papers (2022-02-28T22:54:39Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z)
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.