Floquet-informed Learning of Periodically Driven Hamiltonians

• URL: http://arxiv.org/abs/2509.02331v1
• Date: Tue, 02 Sep 2025 13:59:12 GMT
• Title: Floquet-informed Learning of Periodically Driven Hamiltonians
• Authors: Keren Li,
• Abstract summary: We introduce a Floquet-informed learning algorithm that represents the Hamiltonian as a truncated Fourier series.<n>An adaptive rule learns the cutoff of series, removing the need to set known truncation.<n>These features enable practical certification and benchmarking of periodically driven platforms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Characterizing time-periodic Hamiltonians is pivotal for validating and controlling driven quantum platforms, yet prevailing and unadjusted reconstruction methods demand dense time-domain sampling and heavy post-processing. We introduce a scalable Floquet-informed learning algorithm that represents the Hamiltonian as a truncated Fourier series and recasts parameter estimation as a compact linear inverse problem in the Floquet band picture. The algorithm is well-suited to problems satisfying mild smoothness/band-limiting. In this regime, its sample and runtime complexities scale polynomially with the Fourier cutoff, time resolution, and the number of unknown coefficients. For local Hamiltonian models, the coefficients grows polynomially with system size, yielding at most polylogarithmic dependence on the Hilbert-space dimension. Furthermore, numerical experiments on one- and two-dimensional Ising and Heisenberg lattices show fast convergence to time resolution and robustness to higher-order perturbations. An adaptive rule learns the cutoff of Fourier series, removing the need to set known truncation \textit{a priori}. These features enable practical certification and benchmarking of periodically driven platforms with rapidly decaying higher-order content, and extend naturally to near-periodic drives.

Related papers

• FUTON: Fourier Tensor Network for Implicit Neural Representations [56.48739018255443]
  Implicit neural representations (INRs) have emerged as powerful tools for encoding signals, yet dominant-based designs often suffer from slow convergence, overfitting to noise, and poor extrapolation.<n>We introduce FUTON, which models signals as generalized Fourier series whose coefficients are parameterized by a low-rank tensor decomposition.
  arXiv  Detail & Related papers  (2026-02-13T19:31:44Z)
• 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)
• High-order Magnus Expansion for Hamiltonian Simulation [2.6968321526169508]
  We develop a high-order quantum algorithm for quantum dynamics with time-dependent Hamiltonians.<n>The algorithm achieves cost scaling with the commutator structure in the high-precision regime and only logarithmically on the Hamiltonian's time variation.
  arXiv  Detail & Related papers  (2025-09-07T13:44:55Z)
• Grassmann Variational Monte Carlo with neural wave functions [45.935798913942904]
  We formalize the framework introduced by Pfau et al.citepfau2024accurate in terms of Grassmann geometry of the Hilbert space.<n>We validate our approach on the Heisenberg quantum spin model on the square lattice, achieving highly accurate energies and physical observables for a large number of excited states.
  arXiv  Detail & Related papers  (2025-07-14T13:53:13Z)
• A deep solver for backward stochastic Volterra integral equations [44.99833362998488]
  We present the first deep-learning solver for backward Volterra integral equations (BSVIEs)<n>The method trains a neural network to approximate the two solution fields in a single stage.<n>These results open practical access to a family of high-dimensional, path-dependent problems in control and quantitative finance.
  arXiv  Detail & Related papers  (2025-05-23T18:41:54Z)
• Fourier Low-rank and Sparse Tensor for Efficient Tensor Completion [11.949952079083026]
  We propose a novel model, underlineFourier underlineLow-rank and underlineSparse underlineTensor (FLoST)<n>FLoST decomposes the tensor along the temporal dimension using a transform.<n>It captures low-frequency components with low-rank and high-frequency fluctuations with sparsity, resulting in a hybrid structure that efficiently models both smooth and localized variations.
  arXiv  Detail & Related papers  (2025-05-16T13:54:07Z)
• Scalable Signature Kernel Computations for Long Time Series via Local Neumann Series Expansions [46.685771141109306]
  The signature kernel is a recent state-of-the-art tool for analyzing high-dimensional sequential data.<n>We present a novel method for efficiently computing the signature kernel of long, high-dimensional time series.<n>This method achieves substantial performance improvements over state-of-the-art approaches for computing the signature kernel.
  arXiv  Detail & Related papers  (2025-02-27T18:59:20Z)
• 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)
• Spectral decomposition and high-accuracy Greens functions: Overcoming the Nyquist-Shannon limit via complex-time Krylov expansion [0.0]
  We show how a fundamental limitation can be overcome using complex-time Krylov spaces. At the example of the critical $S-1/2$ Heisenberg model and light bipolarons in the two-dimensional Su-Schrieffer-Heeger model, we demonstrate the enormous improvements in accuracy.
  arXiv  Detail & Related papers  (2024-11-14T18:45:59Z)
• Explicit error bounds with commutator scaling for time-dependent product and multi-product formulas [0.8009842832476994]
  We derive an explicit error bound of generic PFs for smooth time-dependent Hamiltonians. Our results will shed light on various applications of quantum computers.
  arXiv  Detail & Related papers  (2024-10-18T07:48:21Z)
• 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)
• 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)
• High-frequency expansions for time-periodic Lindblad generators [68.8204255655161]
  Floquet engineering of isolated systems is often based on the concept of the effective time-independent Floquet Hamiltonian. We show that the emerging non-Markovianity of the Floquet generator can entirely be attributed to the micromotion of the open driven system.
  arXiv  Detail & Related papers  (2021-07-21T12:48:39Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)

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.