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

Symmetry

Some New Quantum Numerical Techniques for Solving Nonlinear Equations

Kamsing Nonlaopon, Awais Gul Khan, Farah Ameen, Muhammad Uzair Awan, Clemente Cesarano

Published Sep 3, 2022• 6 citations
Publisher

Abstract

In this paper, we introduce some new quantum numerical techniques of midpoint and trapezoidal type essentially by using the decomposition technique. We also check the order of convergence of our suggested iterative methods. Numerical examples demonstrate that the new q-iterative methods can generate solutions to the nonlinear equations with acceptable accuracy.

DOI
10.3390/sym14091829

Related papers

Quantum Iterative Methods for Solving Differential Equations with Application to Computational Fluid Dynamics

Chelsea A. Williams, Antonio A. Gentile, Vincent E. Elfving +2 more

Abstract Quantum methods are proposed for solving differential equations that are based on a gradual improvement of the solution via an iterative process, and are targeted at applications in fluid dynamics. First, the Jacobi iteration is implemented on a quantum register that utilizes a linear combination of unitaries (LCU) approach to store the trajectory information. Second, quantum methods are extended to Gauss‐Seidel iterative methods. Additionally, a quantum‐suitable resolvent decomposition is proposed based on the Woodbury identity. From a technical perspective, tools are developed and utilized for the block encoding of specific matrices as well as their multiplication. The approach is benchmarked on paradigmatic fluid dynamics problems. These results stress that instead of inverting large matrices, one can program quantum computers to perform multigrid‐type computations and leverage corresponding advances in scientific computing.

arXiv:2404.08605•Advanced Quantum Technologies•Oct 24, 2025•8 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

Efficient geometric integrators for nonadiabatic quantum dynamics. I. The adiabatic representation

Seonghoon Choi, Jiří J. L. Vaníček

Geometric integrators of the Schrödinger equation conserve exactly many invariants of the exact solution. Among these integrators, the split-operator algorithm is explicit and easy to implement but, unfortunately, is restricted to systems whose Hamiltonian is separable into kinetic and potential terms. Here, we describe several implicit geometric integrators applicable to both separable and nonseparable Hamiltonians and, in particular, to the nonadiabatic molecular Hamiltonian in the adiabatic representation. These integrators combine the dynamic Fourier method with the recursive symmetric composition of the trapezoidal rule or implicit midpoint method, which results in an arbitrary order of accuracy in the time step. Moreover, these integrators are exactly unitary, symplectic, symmetric, time-reversible, and stable and, in contrast to the split-operator algorithm, conserve energy exactly, regardless of the accuracy of the solution. The order of convergence and conservation of geometric properties are proven analytically and demonstrated numerically on a two-surface NaI model in the adiabatic representation. Although each step of the higher order integrators is more costly, these algorithms become the most efficient ones if higher accuracy is desired; a thousand-fold speedup compared to the second-order trapezoidal rule (the Crank-Nicolson method) was observed for a wavefunction convergence error of 10−10. In a companion paper [J. Roulet, S. Choi, and J. Vaníček, J. Chem. Phys. 150, 204113 (2019)], we discuss analogous, arbitrary-order compositions of the split-operator algorithm and apply both types of geometric integrators to a higher-dimensional system in the diabatic representation.

arXiv:1902.04661•The Journal of Chemical Physics•May 28, 2019•25 citations

Solving differential equations

Alexander M. Dalzell, Sam McArdle, Mario Berta +10 more

This chapter covers quantum algorithms for numerically solving differential equations and the areas of application where such capabilities might be useful, such as computational fluid dynamics, semiconductor chip design, and many engineering workflows. We focus mainly on algorithms for linear differential equations (covering both partial and ordinary linear differential equations), but we also mention the additional nuances that arise for nonlinear differential equations. We discuss important caveats related to both the data input and output aspects of an end-to-end differential equation solver, and we place these quantum methods in the context of existing classical methods currently in use for these problems.

Cambridge University Press eBooks•Apr 24, 2025•1 citation

A quantum algorithm for solving systems of nonlinear algebraic equations

Qian, Peng, Huang, Wei-Cong, Gui‐Lu Long

We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of the corresponding classical ones when the set of equations has many variables and not so high orders. Different with most popular way of representing the results by state vector, we get the results in computation basis which is readable directly.

arXiv:1903.05608•Mar 13, 2019•9 citations

Numerical Investigation of the Quantum Inverse Algorithm on Small Molecules

Mauro Cainelli, Reo Baba, Yuki Kurashige

We evaluate the accuracy of the quantum inverse (Q-Inv) algorithm, in which the multiplication of Ĥ – k to the reference wave function is replaced by the Fourier transformed multiplication of e –iλ Ĥ, as a function of the integration parameters and the iteration power k for various systems, including H 2, LiH, BeH 2 and the notorious H 4 molecule at square geometry. We further consider the possibility of employing the Gaussian-quadrature rule as an alternate integration method and compared it to the results employing trapezoidal integration. The Q-Inv algorithm is compared to the inverse iteration method using the Ĥ –1 inverse (I-Iter) and the exact inverse by lower-upper decomposition. Energy values are evaluated as the expectation values of the Hamiltonian. Results suggest that the Q-Inv method provides lower energy results than the I-Iter method up to a certain k, after which the energy increases due to errors in the numerical integration that are dependent on the integration interval. A combined Gaussian-quadrature and trapezoidal integration method proved to be more effective at reaching convergence while decreasing the number of operations. For systems like H 4, in which the Q-Inv cannot reach the expected error threshold, we propose a combination of Q-Inv and I-Iter methods to further decrease the error with k at lower computational cost. Finally, we summarize the recommended procedure when treating unknown systems.

arXiv:2404.07512•Journal of Chemical Theory and Computation•Sep 11, 2024•1 citation
In this paper, we introduce some new quantum numerical techniques of midpoint and trapezoidal type essentially by using the decomposition technique. We also check the order of convergence of our suggested iterative methods. Numerical examples demonstrate that the new q-iterative methods can generate solutions to the nonlinear equations with acceptable accuracy.
Abstract Quantum methods are proposed for solving differential equations that are based on a gradual improvement of the solution via an iterative process, and are targeted at applications in fluid dynamics. First, the Jacobi iteration is implemented on a quantum register that utilizes a linear combination of unitaries (LCU) approach to store the trajectory information. Second, quantum methods are extended to Gauss‐Seidel iterative methods. Additionally, a quantum‐suitable resolvent decomposition is proposed based on the Woodbury identity. From a technical perspective, tools are developed and utilized for the block encoding of specific matrices as well as their multiplication. The approach is benchmarked on paradigmatic fluid dynamics problems. These results stress that instead of inverting large matrices, one can program quantum computers to perform multigrid‐type computations and leverage corresponding advances in scientific computing.
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.
Geometric integrators of the Schrödinger equation conserve exactly many invariants of the exact solution. Among these integrators, the split-operator algorithm is explicit and easy to implement but, unfortunately, is restricted to systems whose Hamiltonian is separable into kinetic and potential terms. Here, we describe several implicit geometric integrators applicable to both separable and nonseparable Hamiltonians and, in particular, to the nonadiabatic molecular Hamiltonian in the adiabatic representation. These integrators combine the dynamic Fourier method with the recursive symmetric composition of the trapezoidal rule or implicit midpoint method, which results in an arbitrary order of accuracy in the time step. Moreover, these integrators are exactly unitary, symplectic, symmetric, time-reversible, and stable and, in contrast to the split-operator algorithm, conserve energy exactly, regardless of the accuracy of the solution. The order of convergence and conservation of geometric properties are proven analytically and demonstrated numerically on a two-surface NaI model in the adiabatic representation. Although each step of the higher order integrators is more costly, these algorithms become the most efficient ones if higher accuracy is desired; a thousand-fold speedup compared to the second-order trapezoidal rule (the Crank-Nicolson method) was observed for a wavefunction convergence error of 10−10. In a companion paper [J. Roulet, S. Choi, and J. Vaníček, J. Chem. Phys. 150, 204113 (2019)], we discuss analogous, arbitrary-order compositions of the split-operator algorithm and apply both types of geometric integrators to a higher-dimensional system in the diabatic representation.
This chapter covers quantum algorithms for numerically solving differential equations and the areas of application where such capabilities might be useful, such as computational fluid dynamics, semiconductor chip design, and many engineering workflows. We focus mainly on algorithms for linear differential equations (covering both partial and ordinary linear differential equations), but we also mention the additional nuances that arise for nonlinear differential equations. We discuss important caveats related to both the data input and output aspects of an end-to-end differential equation solver, and we place these quantum methods in the context of existing classical methods currently in use for these problems.
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables nnn, which means our algorithm's complexity is less than O(n3)O(n^{3})O(n3) of the corresponding classical ones when the set of equations has many variables and not so high orders. Different with most popular way of representing the results by state vector, we get the results in computation basis which is readable directly.
We evaluate the accuracy of the quantum inverse (Q-Inv) algorithm, in which the multiplication of Ĥ – k to the reference wave function is replaced by the Fourier transformed multiplication of e –iλ Ĥ, as a function of the integration parameters and the iteration power k for various systems, including H 2, LiH, BeH 2 and the notorious H 4 molecule at square geometry. We further consider the possibility of employing the Gaussian-quadrature rule as an alternate integration method and compared it to the results employing trapezoidal integration. The Q-Inv algorithm is compared to the inverse iteration method using the Ĥ –1 inverse (I-Iter) and the exact inverse by lower-upper decomposition. Energy values are evaluated as the expectation values of the Hamiltonian. Results suggest that the Q-Inv method provides lower energy results than the I-Iter method up to a certain k, after which the energy increases due to errors in the numerical integration that are dependent on the integration interval. A combined Gaussian-quadrature and trapezoidal integration method proved to be more effective at reaching convergence while decreasing the number of operations. For systems like H 4, in which the Q-Inv cannot reach the expected error threshold, we propose a combination of Q-Inv and I-Iter methods to further decrease the error with k at lower computational cost. Finally, we summarize the recommended procedure when treating unknown systems.