Learning Passive Continuous-Time Dynamics with Multistep Port-Hamiltonian Gaussian Processes
- URL: http://arxiv.org/abs/2510.00384v2
- Date: Sat, 04 Oct 2025 05:12:01 GMT
- Title: Learning Passive Continuous-Time Dynamics with Multistep Port-Hamiltonian Gaussian Processes
- Abstract summary: We propose the multistep port-Hamiltonian Gaussian process (MS-PHS GP) to learn physically consistent continuous-time dynamics and a posterior over the Hamiltonian from noisy, irregularly-sampled trajectories.<n>MS-PHS GP enables closed-form conditioning of both the vector field and the Hamiltonian surface without latent states, while enforcing energy balance and passivity by design.<n>We demonstrate improved vector-field recovery and well-calibrated Hamiltonian uncertainty on mass-spring, Van der Pol, and Duffing benchmarks.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We propose the multistep port-Hamiltonian Gaussian process (MS-PHS GP) to learn physically consistent continuous-time dynamics and a posterior over the Hamiltonian from noisy, irregularly-sampled trajectories. By placing a GP prior on the Hamiltonian surface $H$ and encoding variable-step multistep integrator constraints as finite linear functionals, MS-PHS GP enables closed-form conditioning of both the vector field and the Hamiltonian surface without latent states, while enforcing energy balance and passivity by design. We state a finite-sample vector-field bound that separates the estimation and variable-step discretization terms. Lastly, we demonstrate improved vector-field recovery and well-calibrated Hamiltonian uncertainty on mass-spring, Van der Pol, and Duffing benchmarks.
Related papers
- Quantum simulation of the Liouville equation in classical mechanics with discontinuous potential via Schrödingerization [42.22857110018992]
We develop quantum simulation algorithms for the Liouville equation of classical mechanics with discontinuous potential.<n>We combine Hamiltonian-preserving schemes by Jin and Wen in Commun. Math. Sci. 3(3), 285-315 (2005) with the Schrdingerization method, which embeds the resulting nonunitary semi-discrete dynamics into a unitary Schrdinger type system.
arXiv Detail & Related papers (2026-06-13T02:49:05Z) - Stochastic Port-Hamiltonian Neural Networks: Universal Approximation with Passivity Guarantees [0.688204255655161]
We introduce port-Hamiltonian neural networks, which parameterize the Hamiltonian with a feedforward network.<n>Experiments show improved long horizon rollouts and reduced energy error relative to a multilayer perceptron baseline.
arXiv Detail & Related papers (2026-03-10T09:16:15Z) - Learning Hamiltonian Flow Maps: Mean Flow Consistency for Large-Timestep Molecular Dynamics [16.337945610431785]
We introduce a framework to learn Hamiltonian Flow Maps by predicting the mean phase-space evolution over a chosen time span.<n>Our method in particular improves upon molecular dynamics simulations using machine-learned force fields.
arXiv Detail & Related papers (2026-01-29T18:47:46Z) - Learning Generalized Hamiltonian Dynamics with Stability from Noisy Trajectory Data [4.680663665263333]
We introduce a robust framework for learning various generalized Hamiltonian dynamics from noisy, sparse phase-space data.<n>It is challenging for a single Hamiltonian network model to capture the distinctive and varying motion dynamics and physics of a phase space.
arXiv Detail & Related papers (2025-09-08T23:29:04Z) - High-order Equivariant Flow Matching for Density Functional Theory Hamiltonian Prediction [14.957565545353942]
deep learning methods are gaining attention as a way to bypass this step by directly predicting the Hamiltonian.<n>We propose QHFlow, a high-order equivariant flow matching framework that generates Hamiltonian matrices conditioned on molecular geometry.<n>Flow matching models continuous-time trajectories between simple priors and complex targets, learning the structured distributions over Hamiltonians instead of direct regression.
arXiv Detail & Related papers (2025-05-24T18:23:28Z) - Kernpiler: Compiler Optimization for Quantum Hamiltonian Simulation with Partial Trotterization [38.59115551211364]
Existing compilation techniques for Hamiltonian simulation struggle to provide gate counts feasible on current quantum computers.<n>We propose partial Trotterization, where sets of non-commuting Hamiltonian terms are directly compiled allowing for less error per Trotter step.<n>We demonstrate with numerical simulations across spin and fermionic Hamiltonians that compared to state of the art methods such as Qiskit's Rustiq and Qiskit's Paulievolutiongate, our novel compiler presents up to 10x gate and depth count reductions.
arXiv Detail & Related papers (2025-04-09T18:41:31Z) - Phase estimation with partially randomized time evolution [36.989845156791525]
Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers.<n>In this paper we use randomization to speed up product formulas, one of the standard approaches to Hamiltonian simulation.<n>We perform a detailed resource estimate for single-ancilla phase estimation using partially randomized product formulas for benchmark systems in quantum chemistry.
arXiv Detail & Related papers (2025-03-07T18:09:32Z) - 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) - Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
We use FNOs to model the evolution of random quantum spin systems.
We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
arXiv Detail & Related papers (2024-09-05T07:18:09Z) - Learning of Hamiltonian Dynamics with Reproducing Kernel Hilbert Spaces [0.7510165488300369]
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.
arXiv Detail & Related papers (2023-12-15T12:19:48Z) - Hamiltonian variational ansatz without barren plateaus [0.0]
Variational quantum algorithms are one of the most promising applications of a near-term quantum computer.
Despite their huge potential, the utility of variational quantum algorithms beyond tens of qubits is still questioned.
arXiv Detail & Related papers (2023-02-16T19:01:26Z) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - MCMC Variational Inference via Uncorrected Hamiltonian Annealing [42.26118870861363]
We propose a framework to use an AIS-like procedure with Uncorrected Hamiltonian MCMC.
Our method leads to tight and differentiable lower bounds on log Z.
arXiv Detail & Related papers (2021-07-08T23:59:45Z) - 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.