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:2112.01655 · Physical Review A

Quantum algorithm for solving a quadratic nonlinear system of equations

Cheng Xue, Xiao‐Fan Xu, Yu-Chun Wu, Guo‐Ping Guo

Published Sep 22, 2022• 13 citations
arXivHTMLPDF

Abstract

Solving a quadratic nonlinear system of equations (QNSE) is a fundamental, but important, task in nonlinear science. We propose an efficient quantum algorithm for solving $n$-dimensional QNSE. Our algorithm embeds QNSE into a finite-dimensional system of linear equations using the homotopy perturbation method and a linearization technique; then we solve the linear equations with a quantum linear system solver and obtain a state which is $\ensuremath{\epsilon}$-close to the normalized exact solution of the QNSE with success probability $\mathrm{\ensuremath{\Omega}}(1)$. The complexity of our algorithm is $O(\mathrm{polylog}(n/\ensuremath{\epsilon}))$, which provides an exponential improvement over the optimal classical algorithm in dimension $n$, and the dependence on $\ensuremath{\epsilon}$ is almost optimal. Therefore, our algorithm exponentially accelerates the solution of QNSE and has wide applications in all kinds of nonlinear problems, contributing to the research progress of nonlinear science.

DOI
10.1103/physreva.106.032427

Related papers

Quantum homotopy perturbation method for nonlinear dissipative ordinary differential equations

Cheng Xue, Yu-Chun Wu, Guo‐Ping Guo

Abstract While quantum computing provides an exponential advantage in solving linear differential equations, there are relatively few quantum algorithms for solving nonlinear differential equations. In our work, based on the homotopy perturbation method, we propose a quantum algorithm for solving n -dimensional nonlinear dissipative ordinary differential equations (ODEs). Our algorithm first converts the original nonlinear ODEs into the other nonlinear ODEs which can be embedded into finite-dimensional linear ODEs. Then we solve the embedded linear ODEs with quantum linear ODEs algorithm and obtain a state ϵ -close to the normalized exact solution of the original nonlinear ODEs with success probability Ω(1). The complexity of our algorithm is O ( gηT poly(log( nT / ϵ ))), where η , g measure the decay of the solution. Our algorithm provides exponential improvement over the best classical algorithms or previous quantum algorithms in n or ϵ .

arXiv:2111.07486•New Journal of Physics•Dec 1, 2021•40 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

Efficient quantum algorithm for dissipative nonlinear differential equations

Jin-Peng Liu, Herman Øie Kolden, Hari Krovi +3 more

Nonlinear differential equations model diverse phenomena but are notoriously difficult to solve. While there has been extensive previous work on efficient quantum algorithms for linear differential equations, the linearity of quantum mechanics has limited analogous progress for the nonlinear case. Despite this obstacle, we develop a quantum algorithm for dissipative quadratic n-dimensional ordinary differential equations. Assuming [Formula: see text], where R is a parameter characterizing the ratio of the nonlinearity and forcing to the linear dissipation, this algorithm has complexity [Formula: see text], where T is the evolution time, ϵ is the allowed error, and q measures decay of the solution. This is an exponential improvement over the best previous quantum algorithms, whose complexity is exponential in T. While exponential decay precludes efficiency, driven equations can avoid this issue despite the presence of dissipation. Our algorithm uses the method of Carleman linearization, for which we give a convergence theorem. This method maps a system of nonlinear differential equations to an infinite-dimensional system of linear differential equations, which we discretize, truncate, and solve using the forward Euler method and the quantum linear system algorithm. We also provide a lower bound on the worst-case complexity of quantum algorithms for general quadratic differential equations, showing that the problem is intractable for [Formula: see text] Finally, we discuss potential applications, showing that the [Formula: see text] condition can be satisfied in realistic epidemiological models and giving numerical evidence that the method may describe a model of fluid dynamics even for larger values of R.

arXiv:2011.03185•Proceedings of the National Academy of Sciences•Aug 26, 2021•310 citations

Efficient quantum algorithm for solving differential equations with Fourier nonlinearity via Koopman linearization

Judd Katz, Gopikrishnan Muraleedharan, Abhijeet Alase

Quantum algorithms offer an exponential advantage with respect to the number of dependent variables for solving certain nonlinear ordinary differential equations (ODEs). These algorithms typically begin by transforming the original nonlinear ODE into a higher-dimensional linear ODE using a linearization technique, most commonly Carleman linearization. Existing works restrict their analysis to ODEs where the nonlinearities are polynomial functions of the dependent variables, significantly limiting their applicability. In this work we construct an efficient quantum algorithm for solving ODEs with `Fourier' nonlinear terms expressible as $d{\bf u}/dt = G_0 + G_1 e^{i{\bf u}}$, where ${\bf u}$ denotes a vector of $n$ complex variables evolving with $t$, $G_0$ is an $n$-dimensional complex vector, $G_1$ is an $n \times n$ complex matrix and $e^{i{\bf u}}$ denotes the vector with entries $\{e^{iu_j}\}$. To tackle the Fourier nonlinear term, which is not expressible as a finite sum of polynomials of ${\bf u}$, our algorithm employs a generalization of the Carleman linearization technique known as Koopman linearization. We also make other methodological advances towards relaxing the stringent dissipativity condition required for efficient solution extraction and towards integrated readout of classical quantities from the solution state. Our results open avenues to the development of efficient quantum algorithms for a significantly wider class of high-dimensional nonlinear ODEs, thereby broadening the scope of their applications.

quant-pharXiv:2512.06488•Dec 9, 2025•4 citations

Quantum Newton’s Method for Solving the System of Nonlinear Equations

Cheng Xue, Yu-Chun Wu, Guo‐Ping Guo

While quantum computing provides an exponential advantage in solving the system of linear equations, there is little work to solve the system of nonlinear equations with quantum computing. We propose quantum Newton’s method (QNM) for solving [Formula: see text]-dimensional system of nonlinear equations based on Newton’s method. In QNM, we solve the system of linear equations in each iteration of Newton’s method with quantum linear system solver. We use a specific quantum data structure and [Formula: see text] tomography with sample error [Formula: see text] to implement the classical-quantum data conversion process between the two iterations of QNM, thereby constructing the whole process of QNM. The complexity of QNM in each iteration is [Formula: see text]. Through numerical simulation, we find that when [Formula: see text], QNM is still effective, so the complexity of QNM is sublinear with [Formula: see text], which provides quantum advantage compared with the optimal classical algorithm.

arXiv:2109.08470•SPIN•Sep 1, 2021•12 citations

Solving Nonlinear Partial Differential Equations via a Hybrid Newton Method Using Quantum Linear System Solver

Maximilian Mandelt Buxadé, Stefan Langer, Philipp Bekemeyer

To approximate solutions of complex nonlinear partial differential equations remains a computational challenge, especially for sets of equations relevant in industry, such as Euler or Navier-Stokes equations. Even the most sophisticated computational fluid dynamic algorithms coupled with powerful supercomputers can not find approximate solutions for several design challenges in both adequate time and scale-resolving accuracy. One difficulty arises from solving high dimensional, strongly nonlinear partial differential equations, such as the Navier-Stokes equations, which capture the underlying physics. For nearly all classical algorithms, methods closely related to Newton's method are used to approximate a solution to the problem. Approximately solving the large-scale linear systems of equations occurring in this iterative scheme is generally a main contributor to the total computational complexity. In this paper a new quantum linear system solver supporting Newton's classical method to solve nonlinear partial differential equations is introduced. We present a new variant of the HHL algorithm, requiring less apriori information regarding the eigenvalues of the corresponding matrix. We apply this quantum linear system solver in a hybrid quantum-classical fashion to solve nonlinear partial differential equations. Moreover, a resource estimation for advanced use-cases of practical relevance is provided. Our results demonstrate how quantum computation may improve existing classical methodologies for solving nonlinear partial differential equations. This approach provides another promising application of quantum computers and presents a possible way forward for handling nonlinearities on inherently linear quantum systems.

quant-pharXiv:2603.23258•Mar 25, 2026•1 citation
Solving a quadratic nonlinear system of equations (QNSE) is a fundamental, but important, task in nonlinear science. We propose an efficient quantum algorithm for solving nnn-dimensional QNSE. Our algorithm embeds QNSE into a finite-dimensional system of linear equations using the homotopy perturbation method and a linearization technique; then we solve the linear equations with a quantum linear system solver and obtain a state which is \ensuremathϵ\ensuremath{\epsilon}\ensuremathϵ-close to the normalized exact solution of the QNSE with success probability \ensuremathΩ(1)\mathrm{\ensuremath{\Omega}}(1)\ensuremathΩ(1). The complexity of our algorithm is O(polylog(n/\ensuremathϵ))O(\mathrm{polylog}(n/\ensuremath{\epsilon}))O(polylog(n/\ensuremathϵ)), which provides an exponential improvement over the optimal classical algorithm in dimension nnn, and the dependence on \ensuremathϵ\ensuremath{\epsilon}\ensuremathϵ is almost optimal. Therefore, our algorithm exponentially accelerates the solution of QNSE and has wide applications in all kinds of nonlinear problems, contributing to the research progress of nonlinear science.
Abstract While quantum computing provides an exponential advantage in solving linear differential equations, there are relatively few quantum algorithms for solving nonlinear differential equations. In our work, based on the homotopy perturbation method, we propose a quantum algorithm for solving n -dimensional nonlinear dissipative ordinary differential equations (ODEs). Our algorithm first converts the original nonlinear ODEs into the other nonlinear ODEs which can be embedded into finite-dimensional linear ODEs. Then we solve the embedded linear ODEs with quantum linear ODEs algorithm and obtain a state ϵ -close to the normalized exact solution of the original nonlinear ODEs with success probability Ω(1). The complexity of our algorithm is O ( gηT poly(log( nT / ϵ ))), where η , g measure the decay of the solution. Our algorithm provides exponential improvement over the best classical algorithms or previous quantum algorithms in n or ϵ .
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.
Nonlinear differential equations model diverse phenomena but are notoriously difficult to solve. While there has been extensive previous work on efficient quantum algorithms for linear differential equations, the linearity of quantum mechanics has limited analogous progress for the nonlinear case. Despite this obstacle, we develop a quantum algorithm for dissipative quadratic n-dimensional ordinary differential equations. Assuming [Formula: see text], where R is a parameter characterizing the ratio of the nonlinearity and forcing to the linear dissipation, this algorithm has complexity [Formula: see text], where T is the evolution time, ϵ is the allowed error, and q measures decay of the solution. This is an exponential improvement over the best previous quantum algorithms, whose complexity is exponential in T. While exponential decay precludes efficiency, driven equations can avoid this issue despite the presence of dissipation. Our algorithm uses the method of Carleman linearization, for which we give a convergence theorem. This method maps a system of nonlinear differential equations to an infinite-dimensional system of linear differential equations, which we discretize, truncate, and solve using the forward Euler method and the quantum linear system algorithm. We also provide a lower bound on the worst-case complexity of quantum algorithms for general quadratic differential equations, showing that the problem is intractable for [Formula: see text] Finally, we discuss potential applications, showing that the [Formula: see text] condition can be satisfied in realistic epidemiological models and giving numerical evidence that the method may describe a model of fluid dynamics even for larger values of R.
Quantum algorithms offer an exponential advantage with respect to the number of dependent variables for solving certain nonlinear ordinary differential equations (ODEs). These algorithms typically begin by transforming the original nonlinear ODE into a higher-dimensional linear ODE using a linearization technique, most commonly Carleman linearization. Existing works restrict their analysis to ODEs where the nonlinearities are polynomial functions of the dependent variables, significantly limiting their applicability. In this work we construct an efficient quantum algorithm for solving ODEs with `Fourier' nonlinear terms expressible as du/dt=G0+G1eiud{\bf u}/dt = G_0 + G_1 e^{i{\bf u}}du/dt=G0​+G1​eiu, where u{\bf u}u denotes a vector of nnn complex variables evolving with ttt, G0G_0G0​ is an nnn-dimensional complex vector, G1G_1G1​ is an n×nn \times nn×n complex matrix and eiue^{i{\bf u}}eiu denotes the vector with entries {eiuj}\{e^{iu_j}\}{eiuj​}. To tackle the Fourier nonlinear term, which is not expressible as a finite sum of polynomials of u{\bf u}u, our algorithm employs a generalization of the Carleman linearization technique known as Koopman linearization. We also make other methodological advances towards relaxing the stringent dissipativity condition required for efficient solution extraction and towards integrated readout of classical quantities from the solution state. Our results open avenues to the development of efficient quantum algorithms for a significantly wider class of high-dimensional nonlinear ODEs, thereby broadening the scope of their applications.
While quantum computing provides an exponential advantage in solving the system of linear equations, there is little work to solve the system of nonlinear equations with quantum computing. We propose quantum Newton’s method (QNM) for solving [Formula: see text]-dimensional system of nonlinear equations based on Newton’s method. In QNM, we solve the system of linear equations in each iteration of Newton’s method with quantum linear system solver. We use a specific quantum data structure and [Formula: see text] tomography with sample error [Formula: see text] to implement the classical-quantum data conversion process between the two iterations of QNM, thereby constructing the whole process of QNM. The complexity of QNM in each iteration is [Formula: see text]. Through numerical simulation, we find that when [Formula: see text], QNM is still effective, so the complexity of QNM is sublinear with [Formula: see text], which provides quantum advantage compared with the optimal classical algorithm.
To approximate solutions of complex nonlinear partial differential equations remains a computational challenge, especially for sets of equations relevant in industry, such as Euler or Navier-Stokes equations. Even the most sophisticated computational fluid dynamic algorithms coupled with powerful supercomputers can not find approximate solutions for several design challenges in both adequate time and scale-resolving accuracy. One difficulty arises from solving high dimensional, strongly nonlinear partial differential equations, such as the Navier-Stokes equations, which capture the underlying physics. For nearly all classical algorithms, methods closely related to Newton's method are used to approximate a solution to the problem. Approximately solving the large-scale linear systems of equations occurring in this iterative scheme is generally a main contributor to the total computational complexity. In this paper a new quantum linear system solver supporting Newton's classical method to solve nonlinear partial differential equations is introduced. We present a new variant of the HHL algorithm, requiring less apriori information regarding the eigenvalues of the corresponding matrix. We apply this quantum linear system solver in a hybrid quantum-classical fashion to solve nonlinear partial differential equations. Moreover, a resource estimation for advanced use-cases of practical relevance is provided. Our results demonstrate how quantum computation may improve existing classical methodologies for solving nonlinear partial differential equations. This approach provides another promising application of quantum computers and presents a possible way forward for handling nonlinearities on inherently linear quantum systems.