Computing time-dependent reduced models for classical and quantum dynamics

• URL: http://arxiv.org/abs/2510.20675v1
• Date: Thu, 23 Oct 2025 15:51:00 GMT
• Title: Computing time-dependent reduced models for classical and quantum dynamics
• Authors: Tommaso Grigoletto,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper introduces a novel method for approximating the dynamics of a large autonomous system projected onto a fixed subspace. The core contribution is a novel recursive algorithm to construct an effective time-dependent generator that is polynomial in the time variable, ensuring accuracy for short time scales. The derivation is based on the Taylor expansion of the exponential map and a new result for computing the time-ordered exponential of polynomial generators. This work is motivated by the challenge of deriving time-convolutionless master equations in quantum physics and the proposed method offers an alternative to typical derivations based on expansions in the coupling strength. The resulting approximation is accurate for small times, does not require a weak-coupling assumption, performs better than a truncation of the exponential map at low orders, and crucially, guarantees a completely positive and trace-preserving map at the lowest orders. The proposed method is validated against several prototypical models: a dephasing spin-boson model, a central spin model, and an Ising spin chain.

Related papers

• An Elementary Approach to Scheduling in Generative Diffusion Models [55.171367482496755]
  An elementary approach to characterizing the impact of noise scheduling and time discretization in generative diffusion models is developed.<n> Experiments across different datasets and pretrained models demonstrate that the time discretization strategy selected by our approach consistently outperforms baseline and search-based strategies.
  arXiv  Detail & Related papers  (2026-01-20T05:06:26Z)
• Floquet-informed Learning of Periodically Driven Hamiltonians [0.0]
  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.
  arXiv  Detail & Related papers  (2025-09-02T13:59:12Z)
• Self-Supervised Coarsening of Unstructured Grid with Automatic Differentiation [55.88862563823878]
  In this work, we present an original algorithm to coarsen an unstructured grid based on the concepts of differentiable physics.<n>We demonstrate performance of the algorithm on two PDEs: a linear equation which governs slightly compressible fluid flow in porous media and the wave equation.<n>Our results show that in the considered scenarios, we reduced the number of grid points up to 10 times while preserving the modeled variable dynamics in the points of interest.
  arXiv  Detail & Related papers  (2025-07-24T11:02:13Z)
• Overcoming the entanglement barrier with sampled tensor networks [0.0]
  We develop a new hybrid-Network/Monte-Carlo (TN-MC) algorithm that samples and evaluates expectation values of generic local operators.<n>The accurate contraction of wave function amplitudes is a consequence of the favorable scaling with time.<n>Our results show that, when computing expectation values of local operators, the entanglement barrier in one-dimensional Hamiltonian evolution can be bypassed.
  arXiv  Detail & Related papers  (2025-05-14T18:14:47Z)
• Generative Learning for Slow Manifolds and Bifurcation Diagrams [0.35587965024910395]
  Conditional score-based generative models (cSGMs) have demonstrated capabilities in generating plausible data from target distributions conditioned on some given label.<n>We present a framework for using cSGMs to quickly initialize on a low-dimensional (reduced-order) slow manifold of a multi-time-scale system.<n>This conditional sampling can help uncover the geometry of the reduced slow-manifold and/or approximately fill in'' missing segments of steady states in a bifurcation diagram.
  arXiv  Detail & Related papers  (2025-04-29T02:38:44Z)
• Latent Space Energy-based Neural ODEs [73.01344439786524]
  This paper introduces novel deep dynamical models designed to represent continuous-time sequences.<n>We train the model using maximum likelihood estimation with Markov chain Monte Carlo.<n> Experimental results on oscillating systems, videos and real-world state sequences (MuJoCo) demonstrate that our model with the learnable energy-based prior outperforms existing counterparts.
  arXiv  Detail & Related papers  (2024-09-05T18:14:22Z)
• Diagrammatic representation and nonperturbative approximation of exact time-convolutionless master equation [0.0]
  We provide a general framework to model non-Markovian dynamics of an open quantum system with a time-local generator. A truncation of the perturbation expansion leads to the perturbative time-convolutionless quantum master equations.
  arXiv  Detail & Related papers  (2023-10-18T05:59:15Z)
• Tree tensor network state approach for solving hierarchical equations of motion [0.0]
  The hierarchical equations of motion (HEOM) method is a numerically exact open quantum system dynamics approach. We show that, the proposed HEOM+TTNS approach yields consistent results with that of the conventional HEOM method. Besides, the simulation with a genuine TTNS is four times faster than a one-dimensional matrix product state decomposition scheme.
  arXiv  Detail & Related papers  (2023-04-11T11:40:15Z)
• 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)
• 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)
• 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)
• Liquid Time-constant Networks [117.57116214802504]
  We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system's dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations.
  arXiv  Detail & Related papers  (2020-06-08T09:53:35Z)

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.