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

Exponential operator methods for solving partial differential equations in quantum mechanics

Hai Shen

Published Jan 1, 1991• 0 citations
OpenAlex

Related papers

Operator Method in Quantum Mechanics

Elsevier eBooks•Jan 1, 1981•4 citations

Review and perspectives in quantum computing for partial differential equations in structural mechanics

Giorgio Tosti Balducci, Boyang Chen, Matthias Möller +2 more

Structural mechanics is commonly modeled by (systems of) partial differential equations (PDEs). Except for very simple cases where analytical solutions exist, the use of numerical methods is required to find approximate solutions. However, for many problems of practical interest, the computational cost of classical numerical solvers running on classical, that is, silicon-based computer hardware, becomes prohibitive. Quantum computing, though still in its infancy, holds the promise of enabling a new generation of algorithms that can execute the most cost-demanding parts of PDE solvers up to exponentially faster than classical methods, at least theoretically. Also, increasing research and availability of quantum computing hardware spurs the hope of scientists and engineers to start using quantum computers for solving PDE problems much faster than classically possible. This work reviews the contributions that deal with the application of quantum algorithms to solve PDEs in structural mechanics. The aim is not only to discuss the theoretical possibility and extent of advantage for a given PDE, boundary conditions and input/output to the solver, but also to examine the hardware requirements of the methods proposed in literature.

Frontiers in Mechanical Engineering•Sep 1, 2022•49 citations

Some Partial Differential Operators of Quantum Mechanics

Robert D. Richtmyer

Springer eBooks•Jan 1, 1978•0 citations

Utilizing Quantum Computing for Solving Multidimensional Partial Differential Equations

Manu Chaudhary

Quantum computing has the potential to revolutionize computational problem-solving by leveraging the quantum mechanical phenomena such as superposition and entanglement, enabling fundamentally different computational strategies compared to classical computing. Classical methods for solving complex and high dimensional partial differential equations (PDEs), crucial for modeling diverse physical phenomena, suffer from an exponential growth in computational complexity known as the curse of dimensionality. This can limit their effectiveness for certain high-resolution simulations and real-time computational applications. In contrast, quantum computing inherently exploits superposition and entanglement to efficiently represent and simultaneously manipulate large-scale discretized PDEs, using exponentially fewer resources compared to classical systems. There are currently many quantum techniques available for solving partial differential equations (PDEs), which are mainly based on variational quantum circuits. However, the existing quantum PDE solvers, particularly those based on variational quantum eigensolver (VQE) techniques, suffer from several limitations. These include low accuracy, high execution times, and low scalability on quantum simulators as well as on noisy intermediate-scale quantum (NISQ) devices, especially for multidimensional PDEs. 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 and evaluated our proposed concepts using a number of case studies including multidimensional Poisson equation, multidimensional heat equation, Black Scholes equation for financial option pricing, and Navier-Stokes equation for computational fluid dynamics (CFD), achieving promising results. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQE-based solvers on noise-free and noisy quantum simulators from IBM. Additionally, we validated our approach on hardware emulators and actual quantum hardware, employing noise mitigation techniques. This work establishes a practical and effective approach for solving PDEs using quantum computing for engineering and scientific applications.

•Jan 1, 2025•0 citations

Differential equations in quantum mechanics

Valerio Magnasco

Elsevier eBooks•Jan 1, 2013•1 citation

A Novel Variational Quantum Algorithm for Solving High-Dimensional Partial Differential Equations in Climate Modeling

Marcin Eryk Gierak, Henryk Kasprzak, Feliks Karpiński

This paper proposes a variational quantum algorithm to address the large-scale and low computational efficiency issues of high-dimensional partial differential equations (PDEs) in climate science. In this method, parameterized quantum circuits encode the discrete solutions of PDEs into quantum states. Then, through repeated quantum measurements, we can obtain the expectation values of the operators. By iteratively adjusting the circuit parameters, a hybrid quantum-classical optimization loop can reduce the error in the solution. The Schrödinger equation and the Poisson equation are benchmark partial differential equations for numerical experiments, and they are four-dimensional and five-dimensional, respectively. According to the above results, the convergence speed is relatively fast; after 100 iterations, the median relative errors of all test cases are less than 1.6% and 3.1%, respectively, with the final target loss ranging between 0.014 and 0.045. The above comparison indicates that in high-dimensional and ill-posed problems, quantum solvers can achieve the same or better accuracy and robustness compared to traditional methods. Resource analysis indicates that quantum algorithms use less memory and fewer sub-exponential growth gates and runtime in larger systems. According to the above findings, variational quantum solvers can be used for complex scientific computing problems. In addition, they hope that future climate models will be more accurate and efficient.

Journal of Applied Automation Technologies•Aug 25, 2025•0 citations
Structural mechanics is commonly modeled by (systems of) partial differential equations (PDEs). Except for very simple cases where analytical solutions exist, the use of numerical methods is required to find approximate solutions. However, for many problems of practical interest, the computational cost of classical numerical solvers running on classical, that is, silicon-based computer hardware, becomes prohibitive. Quantum computing, though still in its infancy, holds the promise of enabling a new generation of algorithms that can execute the most cost-demanding parts of PDE solvers up to exponentially faster than classical methods, at least theoretically. Also, increasing research and availability of quantum computing hardware spurs the hope of scientists and engineers to start using quantum computers for solving PDE problems much faster than classically possible. This work reviews the contributions that deal with the application of quantum algorithms to solve PDEs in structural mechanics. The aim is not only to discuss the theoretical possibility and extent of advantage for a given PDE, boundary conditions and input/output to the solver, but also to examine the hardware requirements of the methods proposed in literature.
Quantum computing has the potential to revolutionize computational problem-solving by leveraging the quantum mechanical phenomena such as superposition and entanglement, enabling fundamentally different computational strategies compared to classical computing. Classical methods for solving complex and high dimensional partial differential equations (PDEs), crucial for modeling diverse physical phenomena, suffer from an exponential growth in computational complexity known as the curse of dimensionality. This can limit their effectiveness for certain high-resolution simulations and real-time computational applications. In contrast, quantum computing inherently exploits superposition and entanglement to efficiently represent and simultaneously manipulate large-scale discretized PDEs, using exponentially fewer resources compared to classical systems. There are currently many quantum techniques available for solving partial differential equations (PDEs), which are mainly based on variational quantum circuits. However, the existing quantum PDE solvers, particularly those based on variational quantum eigensolver (VQE) techniques, suffer from several limitations. These include low accuracy, high execution times, and low scalability on quantum simulators as well as on noisy intermediate-scale quantum (NISQ) devices, especially for multidimensional PDEs. 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 and evaluated our proposed concepts using a number of case studies including multidimensional Poisson equation, multidimensional heat equation, Black Scholes equation for financial option pricing, and Navier-Stokes equation for computational fluid dynamics (CFD), achieving promising results. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQE-based solvers on noise-free and noisy quantum simulators from IBM. Additionally, we validated our approach on hardware emulators and actual quantum hardware, employing noise mitigation techniques. This work establishes a practical and effective approach for solving PDEs using quantum computing for engineering and scientific applications.
This paper proposes a variational quantum algorithm to address the large-scale and low computational efficiency issues of high-dimensional partial differential equations (PDEs) in climate science. In this method, parameterized quantum circuits encode the discrete solutions of PDEs into quantum states. Then, through repeated quantum measurements, we can obtain the expectation values of the operators. By iteratively adjusting the circuit parameters, a hybrid quantum-classical optimization loop can reduce the error in the solution. The Schrödinger equation and the Poisson equation are benchmark partial differential equations for numerical experiments, and they are four-dimensional and five-dimensional, respectively. According to the above results, the convergence speed is relatively fast; after 100 iterations, the median relative errors of all test cases are less than 1.6% and 3.1%, respectively, with the final target loss ranging between 0.014 and 0.045. The above comparison indicates that in high-dimensional and ill-posed problems, quantum solvers can achieve the same or better accuracy and robustness compared to traditional methods. Resource analysis indicates that quantum algorithms use less memory and fewer sub-exponential growth gates and runtime in larger systems. According to the above findings, variational quantum solvers can be used for complex scientific computing problems. In addition, they hope that future climate models will be more accurate and efficient.