A Quantum Algorithm for Multidimensional Partial Differential Equations with Practical Case Studies
Authors:
- Manu ChaudharyMCManu Chaudhary
- Kareem El-ArabyKEKareem El-Araby
- Devon BontragerDBDevon Bontrager
- Alvir NobelANAlvir Nobel
- Shima MohagheghSMShima Mohaghegh
- Kieran EganKEKieran Egan
- Manish SinghMSManish Singh
- Trey CampbellTCTrey Campbell
- Jacob SpryJSJacob Spry
- Luis AvilesLALuis Aviles
- Naveed MahmudNaveed Mahmud
- Pranav ReddyPRPranav Reddy
Open Access
- 7 July 2026
- journal article
- research article
- Published by MDPI AG in Algorithms
- Vol. 19 (7) , 556
Abstract
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.Keywords
This publication has 34 references indexed in Scilit:
- Incompressible Navier–Stokes solve on noisy quantum hardware via a hybrid quantum–classical schemeComputers & Fluids, 2024
- Unsupervised random quantum networks for PDEsQuantum Information Processing, 2024
- A variational quantum algorithm-based numerical method for solving potential and Stokes flowsOcean Engineering, 2023
- Application of a variational hybrid quantum-classical algorithm to heat conduction equation and analysis of time complexityPhysics of Fluids, 2022
- Variational quantum algorithmsNature Reviews Physics, 2021
- t|ket⟩: a retargetable compiler for NISQ devicesQuantum Science and Technology, 2020
- Approximation of high-dimensional parametric PDEsActa Numerica, 2015
- Quantum algorithm and circuit design solving the Poisson equationNew Journal of Physics, 2013
- The Volatility Surface2012
- The Pricing of Options and Corporate LiabilitiesJournal of Political Economy, 1973