Fixing Divergence in Carleman Linearization via Analytical Continuation

• URL: http://arxiv.org/abs/2607.05873v1
• Date: Tue, 07 Jul 2026 06:07:27 GMT
• Title: Fixing Divergence in Carleman Linearization via Analytical Continuation
• Abstract summary: Quantum algorithms for efficiently solving differential equations are being explored.<n>One promising approach is based on Carleman linearization, which transforms nonlinear differential equations into linear systems.<n>We identify that this divergence originates from the Laurent expansion outside its neighborhood of convergence.<n>We validate this divergence-correction method on both the logistic equation and some other partial differential equations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Nonlinear differential equations play a crucial role in modeling a wide range of phenomena, yet their solutions remain notoriously difficult to obtain. With the rapid development of quantum computing, quantum algorithms for efficiently solving such equations are actively being explored. One promising approach is based on Carleman linearization, which transforms nonlinear differential equations into linear systems. However, this method suffers from exponential divergence beyond a certain time scale. By reformulating the solutions in terms of eigenvalues and eigenvectors, we identify that this divergence originates from the Laurent expansion outside its neighborhood of convergence. To address this issue, we insert a regularized function to the divergent solution hinted by analytical continuation. We validate this divergence-correction method on both the logistic equation and some other partial differential equations like KPP-Fisher equations and Phase-Field models under periodic conditions. We implement our method for the logistic equation using the Linear Combination of Unitaries (LCU) quantum algorithm, providing a detailed complexity and error analysis.

Related papers

• Solving Differential Equations Using Continuous-Variable Quantum Annealing [0.0]
  We develop a continuous-variable quantum annealing formulation for solving linear differential equations.<n>The proposed formulation reproduces the corresponding analytical solutions.<n>These results establish a potential route toward solving differential equations without the discretization overhead inherent in qubit-based implementations.
  arXiv  Detail & Related papers  (2026-08-05T09:06:29Z)
• Quantum algorithms for the fractional Poisson equation via rational approximation [20.497126318288906]
  We present a quantum algorithm for solving the fractional equation ((-)s u = f) with (s in (0,1)) on bounded domains.<n>The proposed approach combines rational approximation techniques with quantum linear system solvers to achieve exponential quantum advantage.
  arXiv  Detail & Related papers  (2026-04-01T08:08:33Z)
• Quantum simulation of Liouville equation in geometrical optics with partial transmission and reflection via Schrödingerization [42.22857110018992]
  This paper investigates quantum simulation algorithms for the Liouville equation in geometrical optics with partial transmission and reflection at sharp interfaces.<n>By means of a warped phase transformation in one higher dimension, the Schrdingerization method converts linear partial differential equations into a system of Schrdinger-type equations with unitary evolution.<n>We present detailed constructions of the resulting quantum algorithms and show through complexity analysis that the proposed methods achieve quantum advantage in the precision parameter $$ over their classical counterparts.
  arXiv  Detail & Related papers  (2026-03-12T14:47:16Z)
• 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)
• 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)
• Preconditioned FEM-based Neural Networks for Solving Incompressible Fluid Flows and Related Inverse Problems [41.94295877935867]
  numerical simulation and optimization of technical systems described by partial differential equations is expensive.<n>A comparatively new approach in this context is to combine the good approximation properties of neural networks with the classical finite element method.<n>In this paper, we extend this approach to saddle-point and non-linear fluid dynamics problems, respectively.
  arXiv  Detail & Related papers  (2024-09-06T07:17:01Z)
• Quantum Algorithms for Nonlinear Dynamics: Revisiting Carleman Linearization with No Dissipative Conditions [0.7373617024876725]
  We explore the embedding of nonlinear dynamical systems into linear ordinary differential equations (ODEs) via the Carleman linearization method.<n>Our analysis extends these findings by exploring error bounds beyond the traditional dissipative condition.<n>We prove how this resonance condition leads to a linear convergence with respect to the truncation level $N$ in Carleman linearization.
  arXiv  Detail & Related papers  (2024-05-21T12:09:34Z)
• Quantum algorithms for linear and non-linear fractional reaction-diffusion equations [3.409316136755434]
  We investigate efficient quantum algorithms for nonlinear fractional reaction-diffusion equations with periodic boundary conditions. We present a novel algorithm that combines the linear combination of Hamiltonian simulation technique with the interaction picture formalism.
  arXiv  Detail & Related papers  (2023-10-29T04:48:20Z)
• Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations [31.986350313948435]
  We construct quantum algorithms to compute the solution and/or physical observables of nonlinear ordinary differential equations. We compare the quantum linear systems algorithms based methods and the quantum simulation methods arising from different numerical approximations.
  arXiv  Detail & Related papers  (2022-09-18T05:50:23Z)
• Semi-supervised Learning of Partial Differential Operators and Dynamical Flows [68.77595310155365]
  We present a novel method that combines a hyper-network solver with a Fourier Neural Operator architecture. We test our method on various time evolution PDEs, including nonlinear fluid flows in one, two, and three spatial dimensions. The results show that the new method improves the learning accuracy at the time point of supervision point, and is able to interpolate and the solutions to any intermediate time.
  arXiv  Detail & Related papers  (2022-07-28T19:59:14Z)
• The Connection between Discrete- and Continuous-Time Descriptions of Gaussian Continuous Processes [60.35125735474386]
  We show that discretizations yielding consistent estimators have the property of invariance under coarse-graining' This result explains why combining differencing schemes for derivatives reconstruction and local-in-time inference approaches does not work for time series analysis of second or higher order differential equations.
  arXiv  Detail & Related papers  (2021-01-16T17:11:02Z)
• Optimal oracle inequalities for solving projected fixed-point equations [53.31620399640334]
  We study methods that use a collection of random observations to compute approximate solutions by searching over a known low-dimensional subspace of the Hilbert space. We show how our results precisely characterize the error of a class of temporal difference learning methods for the policy evaluation problem with linear function approximation.
  arXiv  Detail & Related papers  (2020-12-09T20:19:32Z)

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.