Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2604.18924

Lindbladian Homotopy Analysis Method to Solve Nonlinear Partial Differential Equations

Eunsik Choi, Jungin E. Kim, Xueling Lu, Yan Wang

math.NAquant-phSubmitted Apr 21, 2026• Announced Apr 22, 2026• 4 citations
v1 · Apr 21, 2026v2 · Apr 26, 2026v3 · Sep 22, 2026
arXivHTMLPDF

Abstract

Quantum scientific computing is to solve engineering and science problems such as simulation and optimization on quantum computerss. Solving ordinary and partial differential equations (PDEs) is essential in simulations. However, existing quantum approaches to solve nonlinear PDEs suffer from the issues of curse of dimensionality and convergence during the linearization process. In this paper, a Lindbladian homotopy analysis method (LHAM) is proposed as a quantum differential equation solver to simulate nonunitary and nonlinear dynamics. The original nonlinear problem is first converted to a recursive sequence of linear PDEs with the homotopy analysis and reformulated as a higher-dimensional lower block triangular linear homogeneous system. The solution is then embedded in the density matrix and obtained through the Lindbladian dynamics simulation. Compared to other methods such as the Carleman linearization and Koopman-von Neumann approach where the dimension of Hilbert space increases polynomially with the inverse of truncation error, the Hilbert space in LHAM increases only logarithmically. LHAM is demonstrated nonlinear PDEs including Burgers' equation and magnetohydrodynamics equations.

Comments
Keywords: quantum computing, homotopy analysis method, Lindblad master equation, nonlinear PDE

Related papers

Variational Quantum Homotopy Perturbation Method to Solve Nonlinear Partial Differential Equations

Jungin E. Kim, Eunsik Choi, Yan Wang

Solving nonlinear partial differential equations is important in various scientific and engineering applications. Recently, quantum computing was introduced as an alternative computational paradigm for solving nonlinear partial differential equations. In this paper, a new method called the variational quantum homotopy perturbation method is proposed to improve the scalability of solving nonlinear partial differential equations through two aspects. First, the dimension of the Hilbert space remains the same after the nonlinear partial differential equation is linearized through the homotopy perturbation. Second, the solutions are obtained with a variational quantum simulation framework, where the number of qubits is decreased with functional encoding and the depth of parametrized circuits is reduced. The additional contribution of this paper is the introduction of new criteria for selecting the homotopy series truncation order and circuit depth for cost-effective variational quantum homotopy perturbation method. The proposed approach is demonstrated with several examples, including the vorticity transport equation and the reduced magnetohydrodynamics equations.

quant-pharXiv:2609.06357•Sep 8, 2026•0 citations

Quantum Homotopy Algorithm for Solving Nonlinear PDEs and Flow Problems

Sachin S. Bharadwaj, Balasubramanya Nadiga, Stephan Eidenbenz +1 more

Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present a near-optimal, robust, and end-to-end quantum algorithm to solve time-dependent, dissipative, nonlinear PDEs. We embed the PDEs in a truncated, high-dimensional linear space on the basis of quantum homotopy analysis. The linearized system is discretized and integrated using finite-difference methods with a compact quantum algorithm. The present approach can adapt its input to the nature of nonlinearity and underlying physics. The complexity estimates improve existing approaches in terms of the time-marching system size, simulation time, accuracy parameters, and post-selection parameters. We provide a general embedding strategy, bounds on stability criteria, accuracy, gate counts, and query complexity. A physically motivated measure of nonlinearity is connected to a parameter similar to the flow Reynolds number $Re_{\textrm{H}}$, whose inverse marks the allowed integration window, for given accuracy and complexity. We illustrate the embedding scheme with numerical simulations of Burgers, Fisher--KPP, damped Kuramoto--Sivashinsky, and real Ginzburg--Landau/Allen--Cahn equations. Together, these examples encompass cubic nonlinearity and saturation, quadratic transport, and fourth-order dissipative stiffness. This work shows the potential of hybrid quantum algorithms for simulating nonlinear problems on near-term and fault-tolerant devices.

quant-pharXiv:2512.21033•Dec 25, 2025•4 citations

HAM-Schrödingerisation: A Generic Framework of Quantum Simulation for Any Nonlinear PDEs

Shijun Liao

Recently, Jin et al. proposed a quantum simulation technique for any linear partial differential equations (PDEs), called Schrödingerisation [1-3]. In this paper, the Schrödingerisation technique for quantum simulation is expanded to any nonlinear PDEs by combining it with the homotopy analysis method (HAM) [4-6]. The HAM can transfer a nonlinear PDE into a series of linear PDEs with guaranteeing convergence of the series. In this way, any nonlinear PDEs can be solved by quantum simulation using a quantum computer. For simplicity, we call the procedure “HAM-Schrödingerisation quantum algorithm”. Quantum computing is a groundbreaking technique. Hopefully, the “HAM-Schrödingerisation quantum algorithm” can open a door to highly efficient simulation of complicated turbulent flows by means of quantum computing in future.

arXiv:2406.15821•Advances in Applied Mathematics and Mechanics•Sep 29, 2025•5 citations

Quantum Frozen--Oseen homotopy analysis method with LCHS for solving nonlinear partial differential equations

Jinhao Yuan, Leyu Chen, Tiegang Liu +1 more

Nonlinear partial differential equations (PDEs) underpin computational fluid dynamics, yet resolving nonlinear transport on fine grids remains computationally demanding. Quantum linear-evolution algorithms offer a possible route to large-scale simulation but cannot directly propagate nonlinear coupling. Here we develop a Frozen--Oseen quantum homotopy method (FOQHAM) framework that links transport-aware auxiliary-operator selection to the size of the resulting linear representation. We freeze the full Fréchet derivative at a prescribed flow profile, retaining transport and profile-gradient coupling and close each prescribed finite-order homotopy hierarchy as a fixed affine linear system by product lifting. We formulate its propagation through Linear Combinations of Hamiltonian Simulations (LCHS), without outer homotopy iterations or profile updates. For spatially semidiscrete equations, we establish local approximation bounds and exact closure of the finite-order hierarchy. Classical tests on Burgers, Korteweg--de Vries, Zakharov--Kuznetsov, and one- and two-dimensional isothermal compressible Navier--Stokes equations provide numerical evidence of accurate non-iterative approximations in the tested regimes. The framework thus connects nonlinear PDE approximation to quantum linear evolution and offers a conditional path toward quantum acceleration.

math.NACross-listedarXiv:2609.39170•Oct 1, 2026•0 citations

Hamiltonian simulation for nonlinear partial differential equation by Schrödingerization

Shoya Sasaki, Katsuhiro Endo, Mayu Muramatsu

Hamiltonian simulation is a fundamental algorithm in quantum computing that has attracted considerable interest owing to its potential to efficiently solve the governing equations of large-scale classical systems. Exponential speedup through Hamiltonian simulation has been rigorously demonstrated in the case of coupled harmonic oscillators. The question arises as to whether Hamiltonian simulations in other physical systems also accelerate exponentially. Schrödingerization is a technique that transforms the governing equations of classical systems into the Schrödinger equation. However, since the Schrödinger equation is a linear equation, Hamiltonian simulation is often limited to linear equations. The research on Hamiltonian simulation methods for nonlinear governing equations remains relatively limited. In this study, we propose a Hamiltonian simulation method for nonlinear partial differential equations (PDEs). The proposed method is named Carleman linearization + Schrödingerization (CLS), which combines Carleman linearization (CL) and warped phase transformation (WPT). CL is first applied to transform a nonlinear PDE into a linear differential equation. This linearized equation is then mapped to the Schrödinger equation via WPT. The original nonlinear PDE can be solved efficiently by the Hamiltonian simulation of the resulting Schrödinger equation. By applying this method, we transform the original governing equation into the Schrödinger equation. Solving the transformed Schrödinger equation then enables the analysis of the original nonlinear equation. As a specific application, we apply this method to the nonlinear reaction-diffusion equation to demonstrate that Hamiltonian simulations are applicable to nonlinear PDEs.

arXiv:2508.01640•Scientific Reports•Apr 6, 2026•5 citations

A Scalable Approach to Solve the Carleman Linearized Burgers' Equation on a Quantum Computer

Reuben Demirdjian, Yvan Quinn, Vincent P. Su +2 more

Efficiently solving nonlinear ordinary and partial differential equations using a quantum computer is a major challenge due its inherent linearity. To circumvent this challenge, the Carleman linearization method has been proposed to transform a nonlinear ordinary differential equation into a linear system of equations, the primary advantage being that existing quantum linear systems algorithms may then be applied to obtain a solution. However, this methodology also brings forth several major challenges that must be addressed to attain a quantum advantage. Herein, we address several of these challenges enabling us to solve the Carleman linearized one-dimensional Burgers' equation on real and simulated quantum hardware. All simulations were performed on BlueQubit's platform allowing for quantum circuits to be run on GPU or QPU's seamlessly. We first demonstrate that the Carleman linearized Burgers' equation can be efficiently loaded onto a quantum computer using the linear combination of non-unitaries method, an alternative to the linear combintaiton of unitaries approach. Once loaded, the linear system is then solved using the variational quantum linear solver. Since a naive implementation of this solver is hindered by the barren plateau phenomenon, we introduce a multigridding method to solve the problem in a series of stages with the solution of the previous stage acting as a warm start for the next stage. This approach is found to significantly improve the accuracy of the solution compared with a naive cold start. Finally, circuits with a combined number of spatial and temporal discretization points totaling up to $2^{80} \approx 10^{24}$ are transpiled onto real quantum hardware demonstrating that the proposed methodology could feasibly produce a quantum advantage on future hardware.

quant-pharXiv:2607.08976•Jul 13, 2026•0 citations
Quantum scientific computing is to solve engineering and science problems such as simulation and optimization on quantum computerss. Solving ordinary and partial differential equations (PDEs) is essential in simulations. However, existing quantum approaches to solve nonlinear PDEs suffer from the issues of curse of dimensionality and convergence during the linearization process. In this paper, a Lindbladian homotopy analysis method (LHAM) is proposed as a quantum differential equation solver to simulate nonunitary and nonlinear dynamics. The original nonlinear problem is first converted to a recursive sequence of linear PDEs with the homotopy analysis and reformulated as a higher-dimensional lower block triangular linear homogeneous system. The solution is then embedded in the density matrix and obtained through the Lindbladian dynamics simulation. Compared to other methods such as the Carleman linearization and Koopman-von Neumann approach where the dimension of Hilbert space increases polynomially with the inverse of truncation error, the Hilbert space in LHAM increases only logarithmically. LHAM is demonstrated nonlinear PDEs including Burgers' equation and magnetohydrodynamics equations.
Solving nonlinear partial differential equations is important in various scientific and engineering applications. Recently, quantum computing was introduced as an alternative computational paradigm for solving nonlinear partial differential equations. In this paper, a new method called the variational quantum homotopy perturbation method is proposed to improve the scalability of solving nonlinear partial differential equations through two aspects. First, the dimension of the Hilbert space remains the same after the nonlinear partial differential equation is linearized through the homotopy perturbation. Second, the solutions are obtained with a variational quantum simulation framework, where the number of qubits is decreased with functional encoding and the depth of parametrized circuits is reduced. The additional contribution of this paper is the introduction of new criteria for selecting the homotopy series truncation order and circuit depth for cost-effective variational quantum homotopy perturbation method. The proposed approach is demonstrated with several examples, including the vorticity transport equation and the reduced magnetohydrodynamics equations.
Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present a near-optimal, robust, and end-to-end quantum algorithm to solve time-dependent, dissipative, nonlinear PDEs. We embed the PDEs in a truncated, high-dimensional linear space on the basis of quantum homotopy analysis. The linearized system is discretized and integrated using finite-difference methods with a compact quantum algorithm. The present approach can adapt its input to the nature of nonlinearity and underlying physics. The complexity estimates improve existing approaches in terms of the time-marching system size, simulation time, accuracy parameters, and post-selection parameters. We provide a general embedding strategy, bounds on stability criteria, accuracy, gate counts, and query complexity. A physically motivated measure of nonlinearity is connected to a parameter similar to the flow Reynolds number ReHRe_{\textrm{H}}ReH​, whose inverse marks the allowed integration window, for given accuracy and complexity. We illustrate the embedding scheme with numerical simulations of Burgers, Fisher--KPP, damped Kuramoto--Sivashinsky, and real Ginzburg--Landau/Allen--Cahn equations. Together, these examples encompass cubic nonlinearity and saturation, quadratic transport, and fourth-order dissipative stiffness. This work shows the potential of hybrid quantum algorithms for simulating nonlinear problems on near-term and fault-tolerant devices.
Recently, Jin et al. proposed a quantum simulation technique for any linear partial differential equations (PDEs), called Schrödingerisation [1-3]. In this paper, the Schrödingerisation technique for quantum simulation is expanded to any nonlinear PDEs by combining it with the homotopy analysis method (HAM) [4-6]. The HAM can transfer a nonlinear PDE into a series of linear PDEs with guaranteeing convergence of the series. In this way, any nonlinear PDEs can be solved by quantum simulation using a quantum computer. For simplicity, we call the procedure “HAM-Schrödingerisation quantum algorithm”. Quantum computing is a groundbreaking technique. Hopefully, the “HAM-Schrödingerisation quantum algorithm” can open a door to highly efficient simulation of complicated turbulent flows by means of quantum computing in future.
Nonlinear partial differential equations (PDEs) underpin computational fluid dynamics, yet resolving nonlinear transport on fine grids remains computationally demanding. Quantum linear-evolution algorithms offer a possible route to large-scale simulation but cannot directly propagate nonlinear coupling. Here we develop a Frozen--Oseen quantum homotopy method (FOQHAM) framework that links transport-aware auxiliary-operator selection to the size of the resulting linear representation. We freeze the full Fréchet derivative at a prescribed flow profile, retaining transport and profile-gradient coupling and close each prescribed finite-order homotopy hierarchy as a fixed affine linear system by product lifting. We formulate its propagation through Linear Combinations of Hamiltonian Simulations (LCHS), without outer homotopy iterations or profile updates. For spatially semidiscrete equations, we establish local approximation bounds and exact closure of the finite-order hierarchy. Classical tests on Burgers, Korteweg--de Vries, Zakharov--Kuznetsov, and one- and two-dimensional isothermal compressible Navier--Stokes equations provide numerical evidence of accurate non-iterative approximations in the tested regimes. The framework thus connects nonlinear PDE approximation to quantum linear evolution and offers a conditional path toward quantum acceleration.
Hamiltonian simulation is a fundamental algorithm in quantum computing that has attracted considerable interest owing to its potential to efficiently solve the governing equations of large-scale classical systems. Exponential speedup through Hamiltonian simulation has been rigorously demonstrated in the case of coupled harmonic oscillators. The question arises as to whether Hamiltonian simulations in other physical systems also accelerate exponentially. Schrödingerization is a technique that transforms the governing equations of classical systems into the Schrödinger equation. However, since the Schrödinger equation is a linear equation, Hamiltonian simulation is often limited to linear equations. The research on Hamiltonian simulation methods for nonlinear governing equations remains relatively limited. In this study, we propose a Hamiltonian simulation method for nonlinear partial differential equations (PDEs). The proposed method is named Carleman linearization + Schrödingerization (CLS), which combines Carleman linearization (CL) and warped phase transformation (WPT). CL is first applied to transform a nonlinear PDE into a linear differential equation. This linearized equation is then mapped to the Schrödinger equation via WPT. The original nonlinear PDE can be solved efficiently by the Hamiltonian simulation of the resulting Schrödinger equation. By applying this method, we transform the original governing equation into the Schrödinger equation. Solving the transformed Schrödinger equation then enables the analysis of the original nonlinear equation. As a specific application, we apply this method to the nonlinear reaction-diffusion equation to demonstrate that Hamiltonian simulations are applicable to nonlinear PDEs.
Efficiently solving nonlinear ordinary and partial differential equations using a quantum computer is a major challenge due its inherent linearity. To circumvent this challenge, the Carleman linearization method has been proposed to transform a nonlinear ordinary differential equation into a linear system of equations, the primary advantage being that existing quantum linear systems algorithms may then be applied to obtain a solution. However, this methodology also brings forth several major challenges that must be addressed to attain a quantum advantage. Herein, we address several of these challenges enabling us to solve the Carleman linearized one-dimensional Burgers' equation on real and simulated quantum hardware. All simulations were performed on BlueQubit's platform allowing for quantum circuits to be run on GPU or QPU's seamlessly. We first demonstrate that the Carleman linearized Burgers' equation can be efficiently loaded onto a quantum computer using the linear combination of non-unitaries method, an alternative to the linear combintaiton of unitaries approach. Once loaded, the linear system is then solved using the variational quantum linear solver. Since a naive implementation of this solver is hindered by the barren plateau phenomenon, we introduce a multigridding method to solve the problem in a series of stages with the solution of the previous stage acting as a warm start for the next stage. This approach is found to significantly improve the accuracy of the solution compared with a naive cold start. Finally, circuits with a combined number of spatial and temporal discretization points totaling up to 280≈10242^{80} \approx 10^{24}280≈1024 are transpiled onto real quantum hardware demonstrating that the proposed methodology could feasibly produce a quantum advantage on future hardware.