Learning and certification of local time-dependent quantum dynamics and noise

• URL: http://arxiv.org/abs/2510.08500v1
• Date: Thu, 09 Oct 2025 17:39:40 GMT
• Title: Learning and certification of local time-dependent quantum dynamics and noise
• Authors: Daniel Stilck França, Tim Möbus, Cambyse Rouzé, Albert H. Werner,
• Abstract summary: Hamiltonian learning protocols are essential tools to benchmark quantum computers and simulators.<n>We learn the time-dependent evolution of a locally interacting $nqubit system on a graph of effective dimensionD$.<n>Our protocol outputs function approximating coefficients to accuracy $epsilon$ on an interval with success probability $1-delta$.
• Score: 5.1798081822960365
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hamiltonian learning protocols are essential tools to benchmark quantum computers and simulators. Yet rigorous methods for time-dependent Hamiltonians and Lindbladians remain scarce despite their wide use. We close this gap by learning the time-dependent evolution of a locally interacting $n$-qubit system on a graph of effective dimension $D$ using only preparation of product Pauli eigenstates, evolution under the time-dependent generator for given times, and measurements in product Pauli bases. We assume the time-dependent parameters are well approximated by functions in a known space of dimension $m$ admitting stable interpolation, e.g. by polynomials. Our protocol outputs functions approximating these coefficients to accuracy $\epsilon$ on an interval with success probability $1-\delta$, requiring only $O\big(\epsilon^{-2}poly(m)\log(n\delta^{-1})\big)$ samples and $poly(n,m)$ pre/postprocessing. Importantly, the scaling in $m$ is polynomial, whereas naive extensions of previous methods scale exponentially. The method estimates time derivatives of observable expectations via interpolation, yielding well-conditioned linear systems for the generator's coefficients. The main difficulty in the time-dependent setting is to evaluate these coefficients at finite times while preserving a controlled link between derivatives and dynamical parameters. Our innovation is to combine Lieb-Robinson bounds, process shadows, and semidefinite programs to recover the coefficients efficiently at constant times. Along the way, we extend state-of-the-art Lieb-Robinson bounds on general graphs to time-dependent, dissipative dynamics, a contribution of independent interest. These results provide a scalable tool to verify state-preparation procedures (e.g. adiabatic protocols) and characterize time-dependent noise in quantum devices.

Related papers

• Computing time-dependent reduced models for classical and quantum dynamics [0.0]
  This paper introduces a novel method for approxvolutioning the dynamics of an autonomous system projected onto a fixed subspace.<n>The derivation is based on the Taylor expansion of the exponential map and a new result for computing the time-ordered exponential coupling algorithm of generators.<n>The resulting approximation is accurate for small times, does not require a weak-run assumption, performs better than a truncation of the exponential map at low orders, and guarantees a completely positive and trace-preserving map at the lowest orders.
  arXiv  Detail & Related papers  (2025-10-23T15:51:00Z)
• FFT-Accelerated Auxiliary Variable MCMC for Fermionic Lattice Models: A Determinant-Free Approach with $O(N\log N)$ Complexity [52.3171766248012]
  We introduce a Markov Chain Monte Carlo (MCMC) algorithm that dramatically accelerates the simulation of quantum many-body systems.<n>We validate our algorithm on benchmark quantum physics problems, accurately reproducing known theoretical results.<n>Our work provides a powerful tool for large-scale probabilistic inference and opens avenues for physics-inspired generative models.
  arXiv  Detail & Related papers  (2025-10-13T07:57:21Z)
• MultiPDENet: PDE-embedded Learning with Multi-time-stepping for Accelerated Flow Simulation [48.41289705783405]
  We propose a PDE-embedded network with multiscale time stepping (MultiPDENet)<n>In particular, we design a convolutional filter based on the structure of finite difference with a small number of parameters to optimize.<n>A Physics Block with a 4th-order Runge-Kutta integrator at the fine time scale is established that embeds the structure of PDEs to guide the prediction.
  arXiv  Detail & Related papers  (2025-01-27T12:15:51Z)
• The Sample Complexity of Online Reinforcement Learning: A Multi-model Perspective [55.15192437680943]
  We study the sample complexity of online reinforcement learning in the general setting of nonlinear dynamical systems with continuous state and action spaces.<n>Our algorithm achieves a policy regret of $mathcalO(N epsilon2 + mathrmln(m(epsilon)/epsilon2)$, where $epsilon$ is the time horizon.<n>In the special case where the dynamics are parametrized by a compact and real-valued set of parameters, we prove a policy regret of $mathcalO(sqrt
  arXiv  Detail & Related papers  (2025-01-27T10:01:28Z)
• Polynomial Time Quantum Gibbs Sampling for Fermi-Hubbard Model at any Temperature [9.62464358196899]
  We prove a constant gap of the perturbed Lindbladian corresponding to interacting fermions up to some maximal coupling strength.<n>This is achieved by using theorems about stability of the gap for lattice fermions.<n>As an application, we explain how to calculate partition functions for the considered systems.
  arXiv  Detail & Related papers  (2025-01-02T18:56:02Z)
• Unbiased random circuit compiler for time-dependent Hamiltonian simulation [8.694056486825318]
  Time-dependent Hamiltonian simulation is a critical task in quantum computing. We develop an unbiased random compiler for TDHS. We perform numerical simulations for a spin model under the interaction picture and the adiabatic ground state preparation for molecular systems.
  arXiv  Detail & Related papers  (2022-12-19T13:40:05Z)
• Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes [80.89852729380425]
  We propose the first computationally efficient algorithm that achieves the nearly minimax optimal regret $tilde O(dsqrtH3K)$. Our work provides a complete answer to optimal RL with linear MDPs, and the developed algorithm and theoretical tools may be of independent interest.
  arXiv  Detail & Related papers  (2022-12-12T18:58:59Z)
• Grouped self-attention mechanism for a memory-efficient Transformer [64.0125322353281]
  Real-world tasks such as forecasting weather, electricity consumption, and stock market involve predicting data that vary over time. Time-series data are generally recorded over a long period of observation with long sequences owing to their periodic characteristics and long-range dependencies over time. We propose two novel modules, Grouped Self-Attention (GSA) and Compressed Cross-Attention (CCA) Our proposed model efficiently exhibited reduced computational complexity and performance comparable to or better than existing methods.
  arXiv  Detail & Related papers  (2022-10-02T06:58:49Z)
• Optimal Hamiltonian simulation for time-periodic systems [0.8206877486958002]
  We establish optimal/nearly-optimal Hamiltonian simulation for generic time-dependent systems with time-periodicity, known as Floquet systems. Our results will shed light on nonequilibrium phenomena in condensed matter physics and quantum chemistry, and quantum tasks yielding time-dependency in quantum computation.
  arXiv  Detail & Related papers  (2022-09-12T07:06:04Z)
• 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)
• Hybrid quantum-classical approach for coupled-cluster Green's function theory [4.703471655236035]
  We report on a quantum-classical implementation of the coupled-cluster Green's function (CCGF) method. This method replaces explicit ground state preparation with the task of applying unitary operators to a simple product state. We demonstrate it here for the Anderson impurity model (AIM)
  arXiv  Detail & Related papers  (2021-04-14T17:02:58Z)
• On Function Approximation in Reinforcement Learning: Optimism in the Face of Large State Spaces [208.67848059021915]
  We study the exploration-exploitation tradeoff at the core of reinforcement learning. In particular, we prove that the complexity of the function class $mathcalF$ characterizes the complexity of the function. Our regret bounds are independent of the number of episodes.
  arXiv  Detail & Related papers  (2020-11-09T18:32:22Z)

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.