Hamiltonian Learning at Scale

• URL: http://arxiv.org/abs/2608.23707v1
• Date: Mon, 24 Aug 2026 18:01:56 GMT
• Title: Hamiltonian Learning at Scale
• Abstract summary: We use network techniques to emulate Hamiltonian learning at scale and with noise.<n>We provide analytic bounds on the Hamiltonian learning estimation errors and perform numerical simulations that highlight learning error's stability.<n>By simulating the protocol at large scale, and empirically studying its practical limitations, our analysis of how errors affect the Hamiltonian learning process provides valuable lessons for future experiments.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Learning a quantum system's Hamiltonian is crucial for understanding and controlling its dynamics and has recently become a topic of widespread interest. To understand the learning protocol's error tolerances, i.e. its stability in the presence of inevitable errors, this work utilizes tensor network techniques to emulate Hamiltonian learning workflows at scale and with noise. Specifically, we employed a Hamiltonian learning technique based on approximate stationary states which are constructed using matrix product tools. We provide analytic bounds on the Hamiltonian learning estimation errors and perform numerical simulations that highlight learning error's stability under two families of errors. Using our workflow, we are able to scale up the protocol and learn mixed-field Ising model Hamiltonians of an $N=300$ site spin chain. By simulating the protocol at large scale, and empirically studying its practical limitations, our analysis of how errors affect the Hamiltonian learning process provides valuable lessons for future experiments. We conclude by discussing the avenues our work opens as well as future work that can support Hamiltonian learning experiments.

Related papers

• Optimal and Robust In-situ Quantum Hamiltonian Learning through Parallelization [5.2946736439833595]
  Hamiltonian learning is a cornerstone for advancing accurate many-body simulations, improving quantum device performance, and enabling quantum-enhanced sensing.<n>We present the first Hamiltonian learning algorithm that both Cramer-Rao lower bound saturated optimal precision and robustness to realistic noise.
  arXiv  Detail & Related papers  (2025-10-09T05:58:37Z)
• The Importance of Being Lazy: Scaling Limits of Continual Learning [60.97756735877614]
  We show that increasing model width is only beneficial when it reduces the amount of feature learning, yielding more laziness.<n>We study the intricate relationship between feature learning, task non-stationarity, and forgetting, finding that high feature learning is only beneficial with highly similar tasks.
  arXiv  Detail & Related papers  (2025-06-20T10:12:38Z)
• Hamiltonian Neural Networks approach to fuzzball geodesics [39.58317527488534]
  Hamiltonian Neural Networks (HNNs) are tools that minimize a loss function to solve Hamilton equations of motion.<n>In this work, we implement several HNNs trained to solve, with high accuracy, the Hamilton equations for a massless probe moving inside a smooth and horizonless geometry known as D1-D5 circular fuzzball.
  arXiv  Detail & Related papers  (2025-02-28T09:25:49Z)
• A Unified Framework for Neural Computation and Learning Over Time [56.44910327178975]
  Hamiltonian Learning is a novel unified framework for learning with neural networks "over time" It is based on differential equations that: (i) can be integrated without the need of external software solvers; (ii) generalize the well-established notion of gradient-based learning in feed-forward and recurrent networks; (iii) open to novel perspectives.
  arXiv  Detail & Related papers  (2024-09-18T14:57:13Z)
• Hamiltonian and Liouvillian learning in weakly-dissipative quantum many-body systems [0.0]
  We present and compare various methods to learn the operator content of the Hamiltonian and the Lindblad operators of the Liouvillian. A central aspect of our approaches is to (re-)parametrize ans"atze by introducing and varying the dependencies between parameters.
  arXiv  Detail & Related papers  (2024-05-10T18:41:26Z)
• An Information Theoretic Approach to Machine Unlearning [43.423418819707784]
  To comply with AI and data regulations, the need to forget private or copyrighted information from trained machine learning models is increasingly important.<n>In this work, we address the zero-shot unlearning scenario, whereby an unlearning algorithm must be able to remove data given only a trained model and the data to be forgotten.<n>We derive a simple but principled zero-shot unlearning method based on the geometry of the model.
  arXiv  Detail & Related papers  (2024-02-02T13:33:30Z)
• Learning Energy Conserving Dynamics Efficiently with Hamiltonian Gaussian Processes [9.581740983484472]
  We present a process model for Hamiltonian systems with efficient decoupled parameterisation. We introduce an energy-conserving shooting method that allows robust inference from both short and long trajectories. We demonstrate the method's success in learning Hamiltonian systems in various data settings.
  arXiv  Detail & Related papers  (2023-03-03T13:51:04Z)
• 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)
• Robust and Efficient Hamiltonian Learning [2.121963121603413]
  We present a robust and efficient Hamiltonian learning method that circumvents limitations based on mild assumptions. The proposed method can efficiently learn any Hamiltonian that is sparse on the Pauli basis using only short-time dynamics and local operations. We numerically test the scaling and the estimation accuracy of the method for transverse field Ising Hamiltonian with random interaction strengths and molecular Hamiltonians.
  arXiv  Detail & Related papers  (2022-01-01T13:48:15Z)
• Symplectic Learning for Hamiltonian Neural Networks [0.0]
  Hamiltonian Neural Networks (HNNs) took a first step towards a unified "gray box" approach. We exploit the symplectic structure of Hamiltonian systems with a different loss function. We mathematically guarantee the existence of an exact Hamiltonian function which the HNN can learn.
  arXiv  Detail & Related papers  (2021-06-22T13:33:12Z)
• Using Data Assimilation to Train a Hybrid Forecast System that Combines Machine-Learning and Knowledge-Based Components [52.77024349608834]
  We consider the problem of data-assisted forecasting of chaotic dynamical systems when the available data is noisy partial measurements. We show that by using partial measurements of the state of the dynamical system, we can train a machine learning model to improve predictions made by an imperfect knowledge-based model.
  arXiv  Detail & Related papers  (2021-02-15T19:56:48Z)
• Learning outside the Black-Box: The pursuit of interpretable models [78.32475359554395]
  This paper proposes an algorithm that produces a continuous global interpretation of any given continuous black-box function. Our interpretation represents a leap forward from the previous state of the art.
  arXiv  Detail & Related papers  (2020-11-17T12:39:44Z)
• Bayesian active learning for production, a systematic study and a reusable library [85.32971950095742]
  In this paper, we analyse the main drawbacks of current active learning techniques. We do a systematic study on the effects of the most common issues of real-world datasets on the deep active learning process. We derive two techniques that can speed up the active learning loop such as partial uncertainty sampling and larger query size.
  arXiv  Detail & Related papers  (2020-06-17T14:51:11Z)

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.