Quantum Algorithms for Nonlinear Differential Equations via Pivot-Shifted Carleman Linearization

• URL: http://arxiv.org/abs/2605.20071v1
• Date: Tue, 19 May 2026 16:26:02 GMT
• Title: Quantum Algorithms for Nonlinear Differential Equations via Pivot-Shifted Carleman Linearization
• Abstract summary: We develop a pivot-shifted framework for quantum algorithms solving quadratic nonlinear ordinary differential equations.<n>By shifting the dynamics by a pivot state prior to Carleman lifting, we enlarge the class of nonlinear systems that can be efficiently simulated on quantum computers.
• Score: 3.4002853946164726
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a pivot-shifted Carleman linearization framework for quantum algorithms solving quadratic nonlinear ordinary differential equations. By shifting the dynamics by a pivot state prior to Carleman lifting, and combining this with a Lyapunov transform and rescaling, we enlarge the class of nonlinear systems that can be efficiently simulated on quantum computers. For systems that exhibit stability in the shifted coordinates, we establish long time convergence of the truncated Carleman embedding. We prove that the truncation order scales only logarithmically with the simulation time and target precision, and we derive end-to-end quantum query complexity bounds for preparing a state proportional to the final solution. By introducing a modified nonlinearity condition, this framework entirely removes the conventional lower bound requirement on the initial condition. For more general systems that remain unstable after shifting, we provide short time convergence guarantees that are similarly free from the initial condition constraints. Numerical experiments on the logistic and the Lotka-Volterra equations demonstrate that an appropriate pivot choice improves stability and accuracy, and yields exponential error decay with truncation order. These results show that pivot shifting provides a practical and theoretically justified route for extending Carleman-based quantum algorithms to a broader class of nonlinear dynamical systems.

Related papers

• Fast-forwarding quantum algorithms for weakly nonlinear dissipative differential equations and beyond [5.509525921849405]
  We study a fast-forwarded quantum algorithm for solving weakly nonlinear dissipative ordinary differential equations.<n>Our approach is a combination of the Carleman embedding technique and the linear combination of Hamiltonian simulation algorithm for linearized systems.
  arXiv  Detail & Related papers  (2026-08-26T14:03:50Z)
• Analytical Series Expansion for Efficient Gradient Evaluation in Multi-Qubit Optimal Control [42.97938764966747]
  We present a unifying framework for gradient-based quantum optimal control.<n>For the case of unitary propagators, we derive a series expansion involving time-independent commutators and time-dependent coefficients.<n>The method is particularly suited for simulating optimal control tasks in quantum systems with local interactions.
  arXiv  Detail & Related papers  (2026-07-29T12:50:52Z)
• Measurement-Efficient Variational Quantum Linear Solver for Carleman-Linearized Nonlinear Dynamics [1.4180331276028664]
  We show that Carleman linearization accurately approximates the weakly nonlinear Duffing equation.<n>We deploy VQLS with symmetry-grouped Hadamard Test evaluations under both global and local cost formulations.<n>Across block-banded test cases, each method achieves near-unity fidelity and vanishing relative residuals.
  arXiv  Detail & Related papers  (2026-05-14T19:45:27Z)
• Efficient Quantum Simulation for Nonlinear Stochastic Differential Equations [7.1884981680595095]
  We develop a quantum algorithm to tackle nonlinear differential equations driven by the Ornstein-Uhlenbeck (OU) process.<n>The query complexity of our algorithm scales logarithmically with the error tolerance and nearly quadratically with the simulation time.
  arXiv  Detail & Related papers  (2026-03-12T19:19:39Z)
• 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)
• 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)
• Time-dependent Neural Galerkin Method for Quantum Dynamics [39.63609604649394]
  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)
• An N-Point Linear Solver for Line and Motion Estimation with Event Cameras [45.67822962085412]
  Event cameras respond primarily to edges--formed by strong gradients--that are well-suited for motion estimation. Recent work has shown that events generated by single lines satisfy a novel constraint which describes a manifold in space-time volume. We show that, with suitable line parametrization, this system of constraints is actually linear in the unknowns.
  arXiv  Detail & Related papers  (2024-04-01T00:47:02Z)
• Improving Pseudo-Time Stepping Convergence for CFD Simulations With Neural Networks [44.99833362998488]
  Navier-Stokes equations may exhibit a highly nonlinear behavior. The system of nonlinear equations resulting from the discretization of the Navier-Stokes equations can be solved using nonlinear iteration methods, such as Newton's method. In this paper, pseudo-transient continuation is employed in order to improve nonlinear convergence.
  arXiv  Detail & Related papers  (2023-10-10T15:45:19Z)
• Hybrid algorithm simulating non-equilibrium steady states of an open quantum system [10.752869788647802]
  Non-equilibrium steady states are a focal point of research in the study of open quantum systems. Previous variational algorithms for searching these steady states have suffered from resource-intensive implementations. We present a novel variational quantum algorithm that efficiently searches for non-equilibrium steady states by simulating the operator-sum form of the Lindblad equation.
  arXiv  Detail & Related papers  (2023-09-13T01:57:27Z)
• Constrained Optimization via Exact Augmented Lagrangian and Randomized Iterative Sketching [55.28394191394675]
  We develop an adaptive inexact Newton method for equality-constrained nonlinear, nonIBS optimization problems. We demonstrate the superior performance of our method on benchmark nonlinear problems, constrained logistic regression with data from LVM, and a PDE-constrained problem.
  arXiv  Detail & Related papers  (2023-05-28T06:33:37Z)
• On optimization of coherent and incoherent controls for two-level quantum systems [77.34726150561087]
  This article considers some control problems for closed and open two-level quantum systems. The closed system's dynamics is governed by the Schr"odinger equation with coherent control. The open system's dynamics is governed by the Gorini-Kossakowski-Sudarshan-Lindblad master equation.
  arXiv  Detail & Related papers  (2022-05-05T09:08:03Z)
• 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)

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.