Quantum algorithms for general nonlinear dynamics based on the Carleman embedding

• URL: http://arxiv.org/abs/2509.07155v1
• Date: Mon, 08 Sep 2025 19:09:05 GMT
• Title: Quantum algorithms for general nonlinear dynamics based on the Carleman embedding
• Authors: David Jennings, Kamil Korzekwa, Matteo Lostaglio, Andrew T Sornborger, Yigit Subasi, Guoming Wang,
• Abstract summary: We show that efficient quantum algorithms exist for a much wider class of nonlinear systems than previously known.<n>We also obtain several results related to the Poincar'e-Dulac theorem and diagonalization of the Car matrix.
• Score: 2.5272147028897476
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Important nonlinear dynamics, such as those found in plasma and fluid systems, are typically hard to simulate on classical computers. Thus, if fault-tolerant quantum computers could efficiently solve such nonlinear problems, it would be a transformative change for many industries. In a recent breakthrough [Liu et al., PNAS 2021], the first efficient quantum algorithm for solving nonlinear differential equations was constructed, based on a single condition $R<1$, where $R$ characterizes the ratio of nonlinearity to dissipation. This result, however, is limited to the class of purely dissipative systems with negative log-norm, which excludes application to many important problems. In this work, we correct technical issues with this and other prior analysis, and substantially extend the scope of nonlinear dynamical systems that can be efficiently simulated on a quantum computer in a number of ways. Firstly, we extend the existing results from purely dissipative systems to a much broader class of stable systems, and show that every quadratic Lyapunov function for the linearized system corresponds to an independent $R$-number criterion for the convergence of the Carlemen scheme. Secondly, we extend our stable system results to physically relevant settings where conserved polynomial quantities exist. Finally, we provide extensive results for the class of non-resonant systems. With this, we are able to show that efficient quantum algorithms exist for a much wider class of nonlinear systems than previously known, and prove the BQP-completeness of nonlinear oscillator problems of exponential size. In our analysis, we also obtain several results related to the Poincar\'{e}-Dulac theorem and diagonalization of the Carleman matrix, which could be of independent interest.

Related papers

• Alleviating Post-Linearization Challenges for Solving Nonlinear Systems on a Quantum Computer [0.0]
  Carleman linearization provides a high dimensional infinite linear system corresponding to a finite nonlinear system.<n>We decompose the Hamiltonian into the weighted sum of non-unitary operators, namely the Sigma basis.<n>Once the Hamiltonian is decomposed, we then use the concept of unitary completion to construct the circuit.
  arXiv  Detail & Related papers  (2026-02-06T14:56:39Z)
• Quantum algorithms for viscosity solutions to nonlinear Hamilton-Jacobi equations based on an entropy penalisation method [40.18480271945435]
  We present a framework for efficient extraction of the viscosity solutions of nonlinear Hamilton-Jacobi equations with convex Hamiltonians.<n>These viscosity solutions play a central role in areas such as front propagation, mean-field games, optimal control, machine learning, and a direct application to the forced Burgers' equation.<n>We provide quantum algorithms, both analog and digital, for extracting pointwise values, gradients, minima, and function evaluations at the minimiser of the viscosity solution.
  arXiv  Detail & Related papers  (2025-12-08T14:19:32Z)
• Quantum-Accelerated Solution of Nonlinear Equations from Variational Principles [0.0]
  We introduce a novel algorithm tailored for fault-tolerant quantum computers (FTQCs)<n>Our approach recasts the static nonlinear problem as a time-evolution process, enabling an effective linearization amenable to quantum acceleration.<n>This work paves the way toward leveraging fault-tolerant quantum computing for complex nonlinear systems across physics and engineering disciplines.
  arXiv  Detail & Related papers  (2025-08-25T02:19:17Z)
• 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)
• Nonlinear dynamics as a ground-state solution on quantum computers [39.58317527488534]
  We present variational quantum algorithms (VQAs) that encode both space and time in qubit registers. The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation.
  arXiv  Detail & Related papers  (2024-03-25T14:06:18Z)
• Improving the convergence of an iterative algorithm for solving arbitrary linear equation systems using classical or quantum binary optimization [39.58317527488534]
  We propose a novel method for solving linear systems. We transform the linear system into a binary optimization problem, drawing inspiration from the geometry of the original problem. We demonstrate that by leveraging partial knowledge of the problem's intrinsic geometry, we can decompose the original problem into smaller, independent sub-problems.
  arXiv  Detail & Related papers  (2023-09-18T16:51:03Z)
• 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)
• A Polynomial Time Quantum Algorithm for Exponentially Large Scale Nonlinear Differential Equations via Hamiltonian Simulation [1.6003521378074745]
  We introduce a class of systems of nonlinear ODEs that can be efficiently solved on quantum computers.<n>Specifically, we employ the Koopman-von Neumann linearization to map the system of nonlinear ODEs to Hamiltonian dynamics.<n>This is the first concrete example of solving systems of nonlinear ODEs with exponential quantum speedup.
  arXiv  Detail & Related papers  (2023-05-01T04:22:56Z)
• Exact solutions of interacting dissipative systems via weak symmetries [77.34726150561087]
  We analytically diagonalize the Liouvillian of a class Markovian dissipative systems with arbitrary strong interactions or nonlinearity. This enables an exact description of the full dynamics and dissipative spectrum. Our method is applicable to a variety of other systems, and could provide a powerful new tool for the study of complex driven-dissipative quantum systems.
  arXiv  Detail & Related papers  (2021-09-27T17:45:42Z)
• 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)
• 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.