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:2209.08478 · Journal of Computational Physics

Time Complexity Analysis of Quantum Algorithms Via Linear Representations For Nonlinear Ordinary and Partial Differential Equations

Shi Jin, Nana Liu, Yue Yu

Published Jan 1, 2022• 71 citations
arXivHTMLPDF
DOI
10.1016/j.jcp.2023.112149

Related papers

Time complexity analysis of quantum difference methods for linear high dimensional and multiscale partial differential equations

Shi Jin, Nana Liu, Yue Yu

arXiv:2202.04537•Journal of Computational Physics•Sep 21, 2022•36 citations

Quantum Algorithms for Nonlinear Equations in Fluid Mechanics

R. Steijl

In recent years, significant progress has been made in the development of quantum algorithms for linear ordinary differential equations as well as linear partial differential equations. There has not been similar progress in the development of quantum algorithms for nonlinear differential equations. In the present work, the focus is on nonlinear partial differential equations arising as governing equations in fluid mechanics. First, the key challenges related to nonlinear equations in the context of quantum computing are discussed. Then, as the main contribution of this work, quantum circuits are presented that represent the nonlinear convection terms in the Navier–Stokes equations. The quantum algorithms introduced use encoding in the computational basis, and employ arithmetic based on the Quantum Fourier Transform. Furthermore, a floating-point type data representation is used instead of the fixed-point representation typically employed in quantum algorithms. A complexity analysis shows that even with the limited number of qubits available on current and near-term quantum computers (<100), nonlinear product terms can be computed with good accuracy. The importance of including sub-normal numbers in the floating-point quantum arithmetic is demonstrated for a representative example problem. Further development steps required to embed the introduced algorithms into larger-scale algorithms are discussed.

IntechOpen eBooks•Dec 22, 2020•21 citations

Quantum simulation of partial differential equations: Applications and detailed analysis

Shi Jin, Nana Liu, Yue Yu

We study a recently introduced simple method [S. Jin, N. Liu, and Y. Yu, Quantum simulation of partial differential equations via Schr\"odingerisation, arXiv:2212.13969] for solving general linear partial differential equations with quantum simulation. This method converts linear partial differential equations into a Hamiltonian system, using a simple transformation called the warped phase transformation. Here we provide a more-in-depth technical discussion and expand on this approach in a more detailed and pedagogical way. We apply this to examples of partial differential equations, including heat, convection, Fokker-Planck, linear Boltzmann, and Black-Scholes equations. This approach can also be extended to general linear partial differential equations, including the Vlasov-Fokker-Planck equation and the Liouville representation equation for nonlinear ordinary differential equations. Extension to higher-order time derivatives is also possible.

arXiv:2212.14703•Physical Review A•Sep 12, 2023•160 citations

Quantum algorithms for nonlinear partial differential equations

Shi Jin, Nana Liu

Bulletin des Sciences Mathématiques•Jun 20, 2024•31 citations

An efficient quantum partial differential equation solver with chebyshev points

Furkan Oz, Omer San, Kursat Kara

Differential equations are the foundation of mathematical models representing the universe's physics. Hence, it is significant to solve partial and ordinary differential equations, such as Navier-Stokes, heat transfer, convection-diffusion, and wave equations, to model, calculate and simulate the underlying complex physical processes. However, it is challenging to solve coupled nonlinear high dimensional partial differential equations in classical computers because of the vast amount of required resources and time. Quantum computation is one of the most promising methods that enable simulations of more complex problems. One solver developed for quantum computers is the quantum partial differential equation (PDE) solver, which uses the quantum amplitude estimation algorithm (QAEA). This paper proposes an efficient implementation of the QAEA by utilizing Chebyshev points for numerical integration to design robust quantum PDE solvers. A generic ordinary differential equation, a heat equation, and a convection-diffusion equation are solved. The solutions are compared with the available data to demonstrate the effectiveness of the proposed approach. We show that the proposed implementation provides a two-order accuracy increase with a significant reduction in solution time.

Scientific Reports•May 12, 2023•36 citations

Quantum Algorithms for Partial Differential Equations: A Performance Review and Future Trajectories

Thanh Nguyen

Lecture notes in networks and systems•Jan 1, 2025•1 citation
In recent years, significant progress has been made in the development of quantum algorithms for linear ordinary differential equations as well as linear partial differential equations. There has not been similar progress in the development of quantum algorithms for nonlinear differential equations. In the present work, the focus is on nonlinear partial differential equations arising as governing equations in fluid mechanics. First, the key challenges related to nonlinear equations in the context of quantum computing are discussed. Then, as the main contribution of this work, quantum circuits are presented that represent the nonlinear convection terms in the Navier–Stokes equations. The quantum algorithms introduced use encoding in the computational basis, and employ arithmetic based on the Quantum Fourier Transform. Furthermore, a floating-point type data representation is used instead of the fixed-point representation typically employed in quantum algorithms. A complexity analysis shows that even with the limited number of qubits available on current and near-term quantum computers (<100), nonlinear product terms can be computed with good accuracy. The importance of including sub-normal numbers in the floating-point quantum arithmetic is demonstrated for a representative example problem. Further development steps required to embed the introduced algorithms into larger-scale algorithms are discussed.
We study a recently introduced simple method [S. Jin, N. Liu, and Y. Yu, Quantum simulation of partial differential equations via Schr\"odingerisation, arXiv:2212.13969] for solving general linear partial differential equations with quantum simulation. This method converts linear partial differential equations into a Hamiltonian system, using a simple transformation called the warped phase transformation. Here we provide a more-in-depth technical discussion and expand on this approach in a more detailed and pedagogical way. We apply this to examples of partial differential equations, including heat, convection, Fokker-Planck, linear Boltzmann, and Black-Scholes equations. This approach can also be extended to general linear partial differential equations, including the Vlasov-Fokker-Planck equation and the Liouville representation equation for nonlinear ordinary differential equations. Extension to higher-order time derivatives is also possible.
Differential equations are the foundation of mathematical models representing the universe's physics. Hence, it is significant to solve partial and ordinary differential equations, such as Navier-Stokes, heat transfer, convection-diffusion, and wave equations, to model, calculate and simulate the underlying complex physical processes. However, it is challenging to solve coupled nonlinear high dimensional partial differential equations in classical computers because of the vast amount of required resources and time. Quantum computation is one of the most promising methods that enable simulations of more complex problems. One solver developed for quantum computers is the quantum partial differential equation (PDE) solver, which uses the quantum amplitude estimation algorithm (QAEA). This paper proposes an efficient implementation of the QAEA by utilizing Chebyshev points for numerical integration to design robust quantum PDE solvers. A generic ordinary differential equation, a heat equation, and a convection-diffusion equation are solved. The solutions are compared with the available data to demonstrate the effectiveness of the proposed approach. We show that the proposed implementation provides a two-order accuracy increase with a significant reduction in solution time.