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

Entropy

Quantum-Solving Algorithm for d’Alembert Solutions of the Wave Equation

Yuanyue Zhu

Published Dec 29, 2022• 1 citation
Publisher

Abstract

When faced with a quantum-solving problem for partial differential equations, people usually transform such problems into Hamiltonian simulation problems or quantum-solving problems for linear equation systems. In this paper, we propose a third approach to solving partial differential equations that differs from the two approaches. By using the duality quantum algorithm, we construct a quantum-solving algorithm for solving the first-order wave equation, which represents a typical class of partial differential equations. Numerical results of the quantum circuit have high precision consistency with the theoretical d'Alembert solution. Then the routine is applied to the wave equation with either a dissipation or dispersion term. As shown by complexity analysis for all these cases of the wave equation, our algorithm has a quadratic acceleration for each iteration compared to the classical algorithm.

DOI
10.3390/e25010062

Related papers

A fast quantum algorithm for solving partial differential equations

Azim Farghadan, Mohammad Mahdi Masteri Farahani, Mohsen Akbari

The numerical solution of partial differential equations (PDEs) is essential in computational physics. Over the past few decades, various quantum-based methods have been developed to formulate and solve PDEs. Solving PDEs incurs high-time complexity for high-dimensional real-world problems, and using traditional methods becomes practically inefficient. This paper presents a fast hybrid classical-quantum paradigm based on successive over-relaxation (SOR) to accelerate solving PDEs. Using the discretization method, this approach reduces the PDE solution to solving a system of linear equations, which is then addressed using the block SOR method. The block SOR method is employed to address qubit limitations, where the entire system of linear equations is decomposed into smaller subsystems. These subsystems are iteratively solved block-wise using Advantage quantum computers developed by D-Wave Systems, and the solutions are subsequently combined to obtain the overall solution. The performance of the proposed method is evaluated by solving the heat equation for a square plate with fixed boundary temperatures and comparing the results with the best existing method. Experimental results show that the proposed method can accelerate the solution of high-dimensional PDEs by using a limited number of qubits up to 2 times the existing method.

arXiv:2410.21930•Scientific Reports•Feb 13, 2025•8 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

A Quantum Algorithm for Multidimensional Partial Differential Equations with Practical Case Studies

Manu Chaudhary, Kareem El-Araby, Devon Bontrager +12 more

Partial differential equations (PDEs) play a central role in scientific and engineering analysis, with applications spanning fluid dynamics, heat and mass transfer, electromagnetism, quantum mechanics, and financial modeling, where they are used to describe diffusion processes, wave propagation, and the evolution of complex systems over space and time. Solving multidimensional partial differential equations (PDEs) is a computationally challenging problem, even for the most advanced classical systems. Over the past decade, quantum computing has attracted significant interest as a potential approach for solving complex computational problems, including multidimensional PDEs. Although a variety of approaches have been proposed for solving PDEs, most of the existing techniques are based on variational quantum algorithms (VQAs). Despite being promising, these VQA-based approaches suffer from low accuracy, long execution times, and limited scalability. In this work, we propose a scalable and efficient quantum algorithm for solving multidimensional PDEs. Our algorithm has two variants. One variant is based on the finite difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, whereas the other is based on FDM, C2Q, and column-by-column decomposition (CCD). We have also evaluated our algorithm using several practical case studies; namely, Poisson, heat, Black–Scholes, and Navier–Stokes equations. The results show that our proposed approach achieves higher accuracy, greater scalability, and faster execution time than the VQA-based approaches. We validated these findings on both noise-free and noisy simulators, as well as on a hardware emulator and real IBM quantum hardware.

Algorithms•Jul 7, 2026•0 citations

A Practical Quantum Solver for Multidimensional Partial Differential Equations

Manu Chaudhary, Kareem El-Araby, Alvir Nobel +9 more

Quantum computing has the potential to transform computational problem-solving by leveraging quantum mechanical principles of superposition and entanglement. This capability is particularly important for the numerical solution of complex and/or multidimensional partial differential equations (PDEs). There are currently many quantum techniques available for solving PDEs, which are mainly based on variational quantum algorithms (VQAs). However, the existing quantum PDE solvers, particularly those based on VQAs suffer from limitations such as low accuracy, high execution times, and low scalability on both simulators as well as on real quantum devices. In this work, we propose an efficient and scalable algorithm for solving multidimensional PDEs. We present two variants of our algorithm: the first leverages finite-difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, while the second employs FDM, C2Q, and column-by-column decomposition (CCD). Both variants are designed to enhance accuracy and scalability while reducing execution times. We have validated our proposed algorithm by solving several practically useful PDEs such as Poisson, heat, Black-Scholes, and Navier-Stokes equations. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQA-based solvers on noise-free and noisy quantum simulators from IBM and achieved promising results on real quantum hardware.

International Conference for High Performance Computing, Networking, Storage and Analysis (SC)•Nov 7, 2025•2 citations

High-precision quantum algorithms for partial differential equations

Andrew M. Childs, Jin-Peng Liu, Aaron Ostrander

Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity p o l y ( 1 / ϵ ) , where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be p o l y ( d , log ⁡ ( 1 / ϵ ) ) , where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.

arXiv:2002.07868•Quantum•Nov 10, 2021•219 citations

Quantum computing for partial differential equations in practice

Niels M. P. Neumann, Jasper Verbree, Carmen Rosa Hoek

Quantum computers have the potential to solve some complex problems much faster than classical equivalents. Significant research efforts are aimed at determining which algorithms give which advantages for different use-cases. An application where quantum computers can possibly bring great advantages is solving (partial) differential equations, which has a broad set of applications, for instance in wave-propagation models. Few differential equations admit an analytical solution. For most heuristic methods are required to approximate a solution. Well-known heuristic techniques include the finite element and finite difference method, where the considered space is partitioned and systems of linear equations resulting from this partitioning need to be solved. Quantum computing puts forward new methods to solve these systems of linear equations and hence these differential equations. First, the HHL algorithm gives an efficient way to solve a linear system of equations. The HHL algorithm comes with drawbacks, but in this specific use-case some of these objections might be circumvented. Quantum computers furthermore offer the variational approach: an optimization-based path to solving differential equations. With this approach, the devices might even ‘learn’ the noise patterns emerging in present day quantum computers and compensate for it. In this work we revisit quantum methods for solving partial differential equations and consider how well they work in solving differential equations in practice. We also discuss possible caveats and bottlenecks of the approaches.

SPIE Quantum Technologies for Defence and Security•Nov 15, 2024•1 citation
When faced with a quantum-solving problem for partial differential equations, people usually transform such problems into Hamiltonian simulation problems or quantum-solving problems for linear equation systems. In this paper, we propose a third approach to solving partial differential equations that differs from the two approaches. By using the duality quantum algorithm, we construct a quantum-solving algorithm for solving the first-order wave equation, which represents a typical class of partial differential equations. Numerical results of the quantum circuit have high precision consistency with the theoretical d'Alembert solution. Then the routine is applied to the wave equation with either a dissipation or dispersion term. As shown by complexity analysis for all these cases of the wave equation, our algorithm has a quadratic acceleration for each iteration compared to the classical algorithm.
The numerical solution of partial differential equations (PDEs) is essential in computational physics. Over the past few decades, various quantum-based methods have been developed to formulate and solve PDEs. Solving PDEs incurs high-time complexity for high-dimensional real-world problems, and using traditional methods becomes practically inefficient. This paper presents a fast hybrid classical-quantum paradigm based on successive over-relaxation (SOR) to accelerate solving PDEs. Using the discretization method, this approach reduces the PDE solution to solving a system of linear equations, which is then addressed using the block SOR method. The block SOR method is employed to address qubit limitations, where the entire system of linear equations is decomposed into smaller subsystems. These subsystems are iteratively solved block-wise using Advantage quantum computers developed by D-Wave Systems, and the solutions are subsequently combined to obtain the overall solution. The performance of the proposed method is evaluated by solving the heat equation for a square plate with fixed boundary temperatures and comparing the results with the best existing method. Experimental results show that the proposed method can accelerate the solution of high-dimensional PDEs by using a limited number of qubits up to 2 times the existing method.
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.
Partial differential equations (PDEs) play a central role in scientific and engineering analysis, with applications spanning fluid dynamics, heat and mass transfer, electromagnetism, quantum mechanics, and financial modeling, where they are used to describe diffusion processes, wave propagation, and the evolution of complex systems over space and time. Solving multidimensional partial differential equations (PDEs) is a computationally challenging problem, even for the most advanced classical systems. Over the past decade, quantum computing has attracted significant interest as a potential approach for solving complex computational problems, including multidimensional PDEs. Although a variety of approaches have been proposed for solving PDEs, most of the existing techniques are based on variational quantum algorithms (VQAs). Despite being promising, these VQA-based approaches suffer from low accuracy, long execution times, and limited scalability. In this work, we propose a scalable and efficient quantum algorithm for solving multidimensional PDEs. Our algorithm has two variants. One variant is based on the finite difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, whereas the other is based on FDM, C2Q, and column-by-column decomposition (CCD). We have also evaluated our algorithm using several practical case studies; namely, Poisson, heat, Black–Scholes, and Navier–Stokes equations. The results show that our proposed approach achieves higher accuracy, greater scalability, and faster execution time than the VQA-based approaches. We validated these findings on both noise-free and noisy simulators, as well as on a hardware emulator and real IBM quantum hardware.
Quantum computing has the potential to transform computational problem-solving by leveraging quantum mechanical principles of superposition and entanglement. This capability is particularly important for the numerical solution of complex and/or multidimensional partial differential equations (PDEs). There are currently many quantum techniques available for solving PDEs, which are mainly based on variational quantum algorithms (VQAs). However, the existing quantum PDE solvers, particularly those based on VQAs suffer from limitations such as low accuracy, high execution times, and low scalability on both simulators as well as on real quantum devices. In this work, we propose an efficient and scalable algorithm for solving multidimensional PDEs. We present two variants of our algorithm: the first leverages finite-difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, while the second employs FDM, C2Q, and column-by-column decomposition (CCD). Both variants are designed to enhance accuracy and scalability while reducing execution times. We have validated our proposed algorithm by solving several practically useful PDEs such as Poisson, heat, Black-Scholes, and Navier-Stokes equations. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQA-based solvers on noise-free and noisy quantum simulators from IBM and achieved promising results on real quantum hardware.
Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity p o l y ( 1 / ϵ ) , where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be p o l y ( d , log ⁡ ( 1 / ϵ ) ) , where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.
Quantum computers have the potential to solve some complex problems much faster than classical equivalents. Significant research efforts are aimed at determining which algorithms give which advantages for different use-cases. An application where quantum computers can possibly bring great advantages is solving (partial) differential equations, which has a broad set of applications, for instance in wave-propagation models. Few differential equations admit an analytical solution. For most heuristic methods are required to approximate a solution. Well-known heuristic techniques include the finite element and finite difference method, where the considered space is partitioned and systems of linear equations resulting from this partitioning need to be solved. Quantum computing puts forward new methods to solve these systems of linear equations and hence these differential equations. First, the HHL algorithm gives an efficient way to solve a linear system of equations. The HHL algorithm comes with drawbacks, but in this specific use-case some of these objections might be circumvented. Quantum computers furthermore offer the variational approach: an optimization-based path to solving differential equations. With this approach, the devices might even ‘learn’ the noise patterns emerging in present day quantum computers and compensate for it. In this work we revisit quantum methods for solving partial differential equations and consider how well they work in solving differential equations in practice. We also discuss possible caveats and bottlenecks of the approaches.