Simulating Time Dependent and Nonlinear Classical Oscillators through Nonlinear Schrödingerization

• URL: http://arxiv.org/abs/2505.17170v1
• Date: Thu, 22 May 2025 17:48:42 GMT
• Title: Simulating Time Dependent and Nonlinear Classical Oscillators through Nonlinear Schrödingerization
• Authors: Abhinav Muraleedharan, Nathan Wiebe,
• Abstract summary: We present quantum algorithms for simulating the dynamics of a broad class of classical oscillator systems.<n>Our work extends the applicability of quantum algorithms to simulate the dynamics of non-conservative and nonlinear classical systems.
• Score: 0.5729426778193399
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present quantum algorithms for simulating the dynamics of a broad class of classical oscillator systems containing $2^n$ coupled oscillators (Eg: $2^n$ masses coupled by springs), including those with time-dependent forces, time-varying stiffness matrices, and weak nonlinear interactions. This generalization of the Harmonic oscillator simulation algorithm is achieved through an approach that we call ``Nonlinear Schr\"{o}dingerization'', which involves reduction of the dynamical system to a nonlinear Schr\"{o}dinger equation and then reduced to a time-independent Schrodinger Equation through perturbative techniques. The linearization of the equation is performed using an approach that allows the dynamics of a nonlinear Schr\"odinger equation to be approximated as a linear Schr\"odinger equation in a higher dimensional space. This allows Hamiltonian Simulation algorithms to be applied to simulate the dynamics of resulting system. When the properties of the classical dynamical systems can be efficiently queried, and when the initial state can be efficiently prepared, the complexity of our quantum algorithm is polynomial in $n$, and almost linear in evolution time for most dynamical systems. Our work extends the applicability of quantum algorithms to simulate the dynamics of non-conservative and nonlinear classical systems, addressing key limitations in previous approaches.

Related papers

• Quantum simulation of a noisy classical nonlinear dynamics [2.6874004806796528]
  We consider the problem of simulating dynamics of classical nonlinear dissipative systems with $Ngg 1$ of freedom.<n>To make the problem tractable for quantum computers, we add a weak Gaussian noise to the equation of motion and the initial state.<n>For any constant nonzero noise rate, the runtime quantum scales to $log(N)$, evolution time, inverse error tolerance, and the relative strength of nonlinearity and dissipation.
  arXiv  Detail & Related papers  (2025-07-08T17:25:40Z)
• A time-marching quantum algorithm for simulation of the nonlinear Lorenz dynamics [0.0]
  We develop a quantum algorithm that implements the time evolution of a second order time-discretized version of the Lorenz model.<n> Notably, we showcase that it accurately captures the structural characteristics of the Lorenz system.
  arXiv  Detail & Related papers  (2025-06-26T15:08:00Z)
• Generative System Dynamics in Recurrent Neural Networks [56.958984970518564]
  We investigate the continuous time dynamics of Recurrent Neural Networks (RNNs)<n>We show that skew-symmetric weight matrices are fundamental to enable stable limit cycles in both linear and nonlinear configurations.<n> Numerical simulations showcase how nonlinear activation functions not only maintain limit cycles, but also enhance the numerical stability of the system integration process.
  arXiv  Detail & Related papers  (2025-04-16T10:39:43Z)
• Exponential Quantum Speedup for Simulating Classical Lattice Dynamics [0.0]
  We introduce a rigorous quantum framework for simulating general harmonic lattice dynamics.<n>We exploit well established quantum Hamiltonian simulation techniques.<n>We demonstrate the applicability of the method across a broad class of lattice models.
  arXiv  Detail & Related papers  (2025-04-07T19:41:22Z)
• Time-dependent Neural Galerkin Method for Quantum Dynamics [42.81677042059531]
  We introduce a classical computational method for quantum dynamics that relies on a global-in-time variational principle.<n>Our scheme computes the entire state trajectory over a finite time window by minimizing a loss function that enforces the Schr"odinger's equation.<n>We showcase the method by simulating global quantum quenches in the paradigmatic Transverse-Field Ising model in both 1D and 2D.
  arXiv  Detail & Related papers  (2024-12-16T13:48:54Z)
• Quantum Simulation of Nonlinear Dynamical Systems Using Repeated Measurement [42.896772730859645]
  We present a quantum algorithm based on repeated measurement to solve initial-value problems for nonlinear ordinary differential equations. We apply this approach to the classic logistic and Lorenz systems in both integrable and chaotic regimes.
  arXiv  Detail & Related papers  (2024-10-04T18:06:12Z)
• The cost of solving linear differential equations on a quantum computer: fast-forwarding to explicit resource counts [0.0]
  We give the first non-asymptotic computation of the cost of encoding the solution to general linear ordinary differential equations into quantum states. We show that the stability properties of a large class of classical dynamics allow their fast-forwarding. We find that the history state can always be output with complexity $O(T1/2)$ for any stable linear system.
  arXiv  Detail & Related papers  (2023-09-14T17:25:43Z)
• Quantum simulation of discrete linear dynamical systems and simple iterative methods in linear algebra via Schrodingerisation [32.104513049339936]
  We introduce the quantum Jacobi and quantum power methods for solving the quantum linear systems of equations. The proposed quantum simulation can be performed on either discrete-variable quantum systems or on hybrid continuous-variable and discrete-variable quantum systems.
  arXiv  Detail & Related papers  (2023-04-06T04:55:15Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Designing Kerr Interactions for Quantum Information Processing via Counterrotating Terms of Asymmetric Josephson-Junction Loops [68.8204255655161]
  static cavity nonlinearities typically limit the performance of bosonic quantum error-correcting codes. Treating the nonlinearity as a perturbation, we derive effective Hamiltonians using the Schrieffer-Wolff transformation. Results show that a cubic interaction allows to increase the effective rates of both linear and nonlinear operations.
  arXiv  Detail & Related papers  (2021-07-14T15:11:05Z)
• 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)
• Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms [74.17312533172291]
  We describe a method for mapping any finite nonlinear dynamical system to an infinite linear dynamical system (embedding) We then explore an approach for approximating the resulting infinite linear system with finite linear systems (truncation)
  arXiv  Detail & Related papers  (2020-12-12T00:01:10Z)

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.