Rigorous Time-dependent Hamiltonian Learning via Continuous Weak Measurements

• URL: http://arxiv.org/abs/2607.16047v1
• Date: Fri, 17 Jul 2026 15:20:57 GMT
• Title: Rigorous Time-dependent Hamiltonian Learning via Continuous Weak Measurements
• Abstract summary: We develop a protocol for learning time-dependent many-body Hamiltonians from continuous weak measurement records.<n>We derive explicit reconstruction-error bounds and a sample-complexity theorem that cleanly separates the finite-sampling statistical noise from the deterministic bias of the iterative state update.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Characterizing the Hamiltonian that a quantum processor actually implements is central to calibrating and validating current quantum hardware. Many devices, however, operate with generators that are time dependent by design. Here we develop a rigorous and experimentally friendly protocol for learning time-dependent many-body Hamiltonians from continuous weak measurement records. The key observation is that interaction sparsity reduces the global reconstruction to a set of local inverse problems, whose number is controlled by the interaction connectivity rather than by the system size. Pure separable probe states suffice to drive these inversions, and a graph-coloring construction embeds them into a small number of global product-state preparations. We derive explicit reconstruction-error bounds and a sample-complexity theorem that cleanly separates the finite-sampling statistical noise from the deterministic bias of the iterative state update, and we validate the protocol on time-dependent spin chains with up to $n=8$ qubits. Beyond these results, our analysis provides a rigorous foundation for time-dependent Hamiltonian learning from continuous monitoring in many-body systems, establishing a framework that extends naturally to many platforms and probe ensembles.

Related papers

• Optimal Ansatz-free Hamiltonian Learning In Situ [3.3230675313521716]
  We show that an algorithm can learn an ansatz-free Hamiltonian $H$ in total evolution time of $(frac2log(frac))$.<n>Our results demonstrate the fundamental cost of experimentally friendly Hamiltonian learning and provide a practical route to rigorous in situ characterization of near-term quantum platforms.
  arXiv  Detail & Related papers  (2026-06-17T18:21:30Z)
• Robust Group Anomaly Detection for Quasi-Periodic Network Time Series [47.60720976101336]
  We propose a framework to identify unusual and interesting time series within a network time series database.<n>We develop a surrogate-based optimization algorithm that can efficiently train the seq2GMM model.
  arXiv  Detail & Related papers  (2025-06-20T08:11:04Z)
• Time Independence Does Not Limit Information Flow. II. The Case with Ancillas [2.9563030892242517]
  We show that the light cone for time-independent Hamiltonians is the same as that for time-dependent systems when local ancillas are allowed.<n>We develop time-independent protocols for approximate quantum state transfer with the same run-times as their corresponding time-dependent protocols.
  arXiv  Detail & Related papers  (2025-05-23T18:00:02Z)
• Graph Spatiotemporal Process for Multivariate Time Series Anomaly Detection with Missing Values [67.76168547245237]
  We introduce a novel framework called GST-Pro, which utilizes a graphtemporal process and anomaly scorer to detect anomalies. Our experimental results show that the GST-Pro method can effectively detect anomalies in time series data and outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-01-11T10:10:16Z)
• Dissipation-enabled bosonic Hamiltonian learning via new information-propagation bounds [1.0499611180329802]
  We show that a bosonic Hamiltonian can be efficiently learned from simple quantum experiments. Our work demonstrates that a broad class of bosonic Hamiltonians can be efficiently learned from simple quantum experiments.
  arXiv  Detail & Related papers  (2023-07-27T17:35:07Z)
• Quantum state preparation via engineered ancilla resetting [0.0]
  We study a protocol that incorporates periodic quantum resetting to prepare ground states of frustration-free parent Hamiltonians. This protocol uses a steering Hamiltonian that enables local coupling between the system and ancillary degrees of freedom. Our numerical results show that ancilla system entanglement is essential for faster convergence.
  arXiv  Detail & Related papers  (2023-05-15T13:34:07Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Efficient and robust estimation of many-qubit Hamiltonians [0.0]
  Characterizing the interactions and dynamics of quantum mechanical systems is an essential task in development of quantum technologies. We propose an efficient protocol for characterizing the underlying Hamiltonian dynamics and the noise of a multi-qubit device. This protocol can be used to parallelize to learn the Hamiltonian, rendering it applicable for the characterization of both current and future quantum devices.
  arXiv  Detail & Related papers  (2022-05-19T13:52:32Z)
• Time Dependent Hamiltonian Simulation Using Discrete Clock Constructions [42.3779227963298]
  We provide a framework for encoding time dependent dynamics as time independent systems. First, we create a time dependent simulation algorithm based on performing qubitization on the augmented clock system. Second, we define a natural generalization of multiproduct formulas for time-ordered exponentials.
  arXiv  Detail & Related papers  (2022-03-21T21:29:22Z)
• 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)
• Consistency of mechanistic causal discovery in continuous-time using Neural ODEs [85.7910042199734]
  We consider causal discovery in continuous-time for the study of dynamical systems. We propose a causal discovery algorithm based on penalized Neural ODEs.
  arXiv  Detail & Related papers  (2021-05-06T08:48:02Z)

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.