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

AppliedMath

QPDE: Quantum Neural Network Based Stabilization Parameter Prediction for Numerical Solvers for Partial Differential Equations

Sangeeta Yadav

Published Jul 13, 2023• 6 citations
Publisher

Abstract

We propose a Quantum Neural Network (QNN) for predicting stabilization parameter for solving Singularly Perturbed Partial Differential Equations (SPDE) using the Streamline Upwind Petrov Galerkin (SUPG) stabilization technique. SPDE-Q-Net, a QNN, is proposed for approximating an optimal value of the stabilization parameter for SUPG for 2-dimensional convection-diffusion problems. Our motivation for this work stems from the recent progress made in quantum computing and the striking similarities observed between neural networks and quantum circuits. Just like how weight parameters are adjusted in traditional neural networks, the parameters of the quantum circuit, specifically the qubits’ degrees of freedom, can be fine-tuned to learn a nonlinear function. The performance of SPDE-Q-Net is found to be at par with SPDE-Net, a traditional neural network-based technique for stabilization parameter prediction in terms of the numerical error in the solution. Also, SPDE-Q-Net is found to be faster than SPDE-Net, which projects the future benefits which can be earned from the speed-up capabilities of quantum computing.

DOI
10.3390/appliedmath3030029

Related papers

Physics-informed quantum neural network for solving forward and inverse problems of partial differential equations

Yang Xiao, Liming Yang, Chang Shu +4 more

Recently, physics-informed neural networks (PINNs) have aroused an upsurge in the field of scientific computing including solving partial differential equations (PDEs), which convert the task of solving PDEs into an optimization challenge by adopting governing equations and definite conditions or observation data as loss functions. Essentially, the underlying logic of PINNs is based on the universal approximation and differentiability properties of classical neural networks (NNs). Recent research has revealed that quantum neural networks (QNNs), known as parameterized quantum circuits, also exhibit universal approximation and differentiability properties. This observation naturally suggests the application of PINNs to QNNs. In this work, we introduce a physics-informed quantum neural network (PI-QNN) by employing the QNN as the function approximator for solving forward and inverse problems of PDEs. The performance of the proposed PI-QNN is evaluated by various forward and inverse PDE problems. Numerical results indicate that PI-QNN demonstrates superior convergence over PINN when solving PDEs with exact solutions that are strongly correlated with trigonometric functions. Moreover, its accuracy surpasses that of PINN by two to three orders of magnitude, while requiring fewer trainable parameters. However, the computational time of PI-QNN exceeds that of PINN due to its operation on classical computers. This limitation may improve with the advent of commercial quantum computers in the future. Furthermore, we briefly investigate the impact of network architecture on PI-QNN performance by examining two different QNN architectures. The results suggest that increasing the number of trainable network layers can enhance the expressiveness of PI-QNN. However, an excessive number of data encoding layers significantly increases computational time, rendering the marginal gains in performance insufficient to compensate for the shortcomings in computational efficiency.

Physics of Fluids•Sep 1, 2024•31 citations

Quantum-Enhanced Convergence of Physics-Informed Neural Networks

Nils Klement, Veronika Eyring, Mierk Schwabe

Partial differential equations (PDEs) form the backbone of simulations of many natural phenomena, for example in climate modeling, material science, and even financial markets. The application of physics-informed neural networks to accelerate the solution of PDEs is promising, but not competitive with numerical solvers yet. Here, we show how quantum computing can improve the ability of physics-informed neural networks to solve partial differential equations. For this, we develop hybrid networks consisting of quantum circuits combined with classical layers and systematically test them on various non linear PDEs and boundary conditions in comparison with purely classical networks. We demonstrate that the advantage of using quantum networks lies in their ability to achieve an accurate approximation of the solution in substantially fewer training epochs, particularly for more complex problems. These findings provide the basis for targeted developments of hybrid quantum neural networks with the goal to significantly accelerate numerical modeling.

quant-pharXiv:2601.15046•Jan 22, 2026•6 citations

Trainable embedding quantum physics informed neural networks for solving nonlinear PDEs

Stefan Berger, Norbert Hosters, Matthias Möller

This paper proposes a novel approach for solving nonlinear partial differential equations (PDEs) with a quantum computer, the trainable embedding quantum physics informed neural network (TE-QPINN). We combine quantum machine learning (QML) with physics informed neural networks (PINNs) in a hybrid approach. By leveraging the advantages of classical and quantum computers, we can create algorithms that have a potential to be run on noisy intermediate-scale quantum devices (NISQ). We use feedforward neural networks (FNN) as problem-agnostic embedding functions, giving the used quantum circuit greater expressibility than previously introduced embedding. This expressibility allows us to solve a wide range of problems without using a problem specific ansatz. Additionally, we introduce a hybrid backpropagation algorithm that allows efficient updates of the used weights and biases in the FNN embedding functions. In this paper we showcase the capabilities of TE-QPINNs of a wide range of problems, including the two-dimensional Poisson, Burgers and Navier-Stokes equations. In direct comparison with classical PINNs, this approach showed an ability to achieve superior results while using the same number of parameters, highlighting their potential for more efficient optimization in high-dimensional parameter spaces, which could be transformative for future applications.

Scientific Reports•May 29, 2025•26 citations

Quantum Physics-Informed Neural Networks for Solving Integro and Fractional PDEs

Deepak Gupta, Ratikanta Behera

Quantum neural networks have emerged as powerful models for approximating nonlinear functions. Yet their use in solving integro-differential equations (IDEs) and fractional integro-partial differential equations (FIPDEs), which involve inherently nonlocal operators, remains unexplored. This work introduces a quantum physics-informed neural network (QPINN) framework that combines a quantum neural network with the governing equations of general nonlinear IDEs and FIPDEs. The proposed quantum network uses an affine feature map and variational quantum circuits to produce trial solutions with explicit trigonometric structure. We prove a quantitative $L^{2}(μ)$ universal approximation theorem for this architecture, achieving a convergence rate of $\mathcal{O}(n^{-1/2})$. This extends classical Fourier approximation theory to quantum circuits for physics-informed learning. We propose two QPINN variants: the numerical-quadrature QPINN (N-QPINN), which handles nonlocal integrals and fractional operators via high-order numerical quadrature while computing local derivatives through automatic differentiation of quantum trial solutions; and the auxiliary-function QPINN (A-QPINN), which eliminates numerical quadrature by introducing auxiliary variables that reformulate each integro-differential equation as an equivalent coupled system of partial differential equations, enabling a multi-output quantum neural network to simultaneously represent the solution and its associated variables. A series of numerical experiments demonstrates that the proposed QPINN framework accurately captures the behavior of nonlinear IDEs and FIPDEs and outperforms classical physics-informed neural networks.

math.APCross-listedarXiv:2606.26865•Jun 26, 2026•1 citation

Learning PDEs for Portfolio Optimization with Quantum Physics-Informed Neural Networks

Letao Wang, Abdel Lisser, Sreejith Sreekumar +1 more

Partial differential equations (PDEs) play a crucial role in financial mathematics, particularly in portfolio optimization, and solving them using classical numerical or neural network methods has always posed significant challenges. Here, we investigate the potential role of quantum circuits for solving PDEs. We design a parameterized quantum circuit (PQC) for implementing a polynomial based on tensor rank decomposition, reducing the quantum resource complexity from exponential to polynomial when the corresponding tensor rank is moderate. Building on this circuit, we develop a Quantum Physics-Informed Neural Network (QPINN) and a Quantum-inspired PINN, both of which guarantee the existence of an approximation of the PDE solution, and this approximation can be represented as a polynomial that incorporates tensor rank decomposition. Numerical experiments are conducted on the Hamilton--Jacobi--Bellman (HJB) PDE arising from the Merton portfolio optimization problem, which determines the optimal investment fraction between a risky and a risk-free asset. The results show that our quantum models achieve lower losses and approximation errors than a classical fully connected PINN while using substantially fewer trainable parameters. Our quantum models further outperform a classical PINN constructed to share a similar inductive bias, providing experimental evidence of quantum-induced improvement in the tested settings and highlighting a resource-efficient pathway toward classical and near-term quantum solvers for PDEs with exploitable solution structure.

quant-pharXiv:2604.03346•Quantum Machine Intelligence•Apr 6, 2026•1 citation

On Quantum Bsde Solver for High-Dimensional Parabolic Pdes

Hui Su, Huan-Hsin Tseng

We propose a quantum machine learning framework for approximating solutions to high-dimensional parabolic partial differential equations (PDEs) that can be reformulated as backward stochastic differential equations (BSDEs). In contrast to popular quantum-classical network hybrid approaches, this study employs the pure Variational Quantum Circuit (VQC) as the core solver without trainable classical neural networks. The quantum BSDE solver performs pathwise approximation via temporal discretization and Monte Carlo simulation, framed as model-based reinforcement learning. We benchmark VQCbased and classical deep neural network (DNN) solvers on two canonical PDEs as representatives: the Black-Scholes and nonlinear Hamilton-Jacobi-Bellman (HJB) equations. The VQC achieves lower variance and improved accuracy in most cases, particularly in highly nonlinear regimes and for out-of-themoney options, demonstrating greater robustness than DNNs. These results, obtained via quantum circuit simulation, highlight the potential of VQCs as scalable and stable solvers for highdimensional stochastic control problems.

arXiv:2506.14612•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•1 citation
We propose a Quantum Neural Network (QNN) for predicting stabilization parameter for solving Singularly Perturbed Partial Differential Equations (SPDE) using the Streamline Upwind Petrov Galerkin (SUPG) stabilization technique. SPDE-Q-Net, a QNN, is proposed for approximating an optimal value of the stabilization parameter for SUPG for 2-dimensional convection-diffusion problems. Our motivation for this work stems from the recent progress made in quantum computing and the striking similarities observed between neural networks and quantum circuits. Just like how weight parameters are adjusted in traditional neural networks, the parameters of the quantum circuit, specifically the qubits’ degrees of freedom, can be fine-tuned to learn a nonlinear function. The performance of SPDE-Q-Net is found to be at par with SPDE-Net, a traditional neural network-based technique for stabilization parameter prediction in terms of the numerical error in the solution. Also, SPDE-Q-Net is found to be faster than SPDE-Net, which projects the future benefits which can be earned from the speed-up capabilities of quantum computing.
Recently, physics-informed neural networks (PINNs) have aroused an upsurge in the field of scientific computing including solving partial differential equations (PDEs), which convert the task of solving PDEs into an optimization challenge by adopting governing equations and definite conditions or observation data as loss functions. Essentially, the underlying logic of PINNs is based on the universal approximation and differentiability properties of classical neural networks (NNs). Recent research has revealed that quantum neural networks (QNNs), known as parameterized quantum circuits, also exhibit universal approximation and differentiability properties. This observation naturally suggests the application of PINNs to QNNs. In this work, we introduce a physics-informed quantum neural network (PI-QNN) by employing the QNN as the function approximator for solving forward and inverse problems of PDEs. The performance of the proposed PI-QNN is evaluated by various forward and inverse PDE problems. Numerical results indicate that PI-QNN demonstrates superior convergence over PINN when solving PDEs with exact solutions that are strongly correlated with trigonometric functions. Moreover, its accuracy surpasses that of PINN by two to three orders of magnitude, while requiring fewer trainable parameters. However, the computational time of PI-QNN exceeds that of PINN due to its operation on classical computers. This limitation may improve with the advent of commercial quantum computers in the future. Furthermore, we briefly investigate the impact of network architecture on PI-QNN performance by examining two different QNN architectures. The results suggest that increasing the number of trainable network layers can enhance the expressiveness of PI-QNN. However, an excessive number of data encoding layers significantly increases computational time, rendering the marginal gains in performance insufficient to compensate for the shortcomings in computational efficiency.
Partial differential equations (PDEs) form the backbone of simulations of many natural phenomena, for example in climate modeling, material science, and even financial markets. The application of physics-informed neural networks to accelerate the solution of PDEs is promising, but not competitive with numerical solvers yet. Here, we show how quantum computing can improve the ability of physics-informed neural networks to solve partial differential equations. For this, we develop hybrid networks consisting of quantum circuits combined with classical layers and systematically test them on various non linear PDEs and boundary conditions in comparison with purely classical networks. We demonstrate that the advantage of using quantum networks lies in their ability to achieve an accurate approximation of the solution in substantially fewer training epochs, particularly for more complex problems. These findings provide the basis for targeted developments of hybrid quantum neural networks with the goal to significantly accelerate numerical modeling.
This paper proposes a novel approach for solving nonlinear partial differential equations (PDEs) with a quantum computer, the trainable embedding quantum physics informed neural network (TE-QPINN). We combine quantum machine learning (QML) with physics informed neural networks (PINNs) in a hybrid approach. By leveraging the advantages of classical and quantum computers, we can create algorithms that have a potential to be run on noisy intermediate-scale quantum devices (NISQ). We use feedforward neural networks (FNN) as problem-agnostic embedding functions, giving the used quantum circuit greater expressibility than previously introduced embedding. This expressibility allows us to solve a wide range of problems without using a problem specific ansatz. Additionally, we introduce a hybrid backpropagation algorithm that allows efficient updates of the used weights and biases in the FNN embedding functions. In this paper we showcase the capabilities of TE-QPINNs of a wide range of problems, including the two-dimensional Poisson, Burgers and Navier-Stokes equations. In direct comparison with classical PINNs, this approach showed an ability to achieve superior results while using the same number of parameters, highlighting their potential for more efficient optimization in high-dimensional parameter spaces, which could be transformative for future applications.
Quantum neural networks have emerged as powerful models for approximating nonlinear functions. Yet their use in solving integro-differential equations (IDEs) and fractional integro-partial differential equations (FIPDEs), which involve inherently nonlocal operators, remains unexplored. This work introduces a quantum physics-informed neural network (QPINN) framework that combines a quantum neural network with the governing equations of general nonlinear IDEs and FIPDEs. The proposed quantum network uses an affine feature map and variational quantum circuits to produce trial solutions with explicit trigonometric structure. We prove a quantitative L2(μ)L^{2}(μ)L2(μ) universal approximation theorem for this architecture, achieving a convergence rate of O(n−1/2)\mathcal{O}(n^{-1/2})O(n−1/2). This extends classical Fourier approximation theory to quantum circuits for physics-informed learning. We propose two QPINN variants: the numerical-quadrature QPINN (N-QPINN), which handles nonlocal integrals and fractional operators via high-order numerical quadrature while computing local derivatives through automatic differentiation of quantum trial solutions; and the auxiliary-function QPINN (A-QPINN), which eliminates numerical quadrature by introducing auxiliary variables that reformulate each integro-differential equation as an equivalent coupled system of partial differential equations, enabling a multi-output quantum neural network to simultaneously represent the solution and its associated variables. A series of numerical experiments demonstrates that the proposed QPINN framework accurately captures the behavior of nonlinear IDEs and FIPDEs and outperforms classical physics-informed neural networks.
Partial differential equations (PDEs) play a crucial role in financial mathematics, particularly in portfolio optimization, and solving them using classical numerical or neural network methods has always posed significant challenges. Here, we investigate the potential role of quantum circuits for solving PDEs. We design a parameterized quantum circuit (PQC) for implementing a polynomial based on tensor rank decomposition, reducing the quantum resource complexity from exponential to polynomial when the corresponding tensor rank is moderate. Building on this circuit, we develop a Quantum Physics-Informed Neural Network (QPINN) and a Quantum-inspired PINN, both of which guarantee the existence of an approximation of the PDE solution, and this approximation can be represented as a polynomial that incorporates tensor rank decomposition. Numerical experiments are conducted on the Hamilton--Jacobi--Bellman (HJB) PDE arising from the Merton portfolio optimization problem, which determines the optimal investment fraction between a risky and a risk-free asset. The results show that our quantum models achieve lower losses and approximation errors than a classical fully connected PINN while using substantially fewer trainable parameters. Our quantum models further outperform a classical PINN constructed to share a similar inductive bias, providing experimental evidence of quantum-induced improvement in the tested settings and highlighting a resource-efficient pathway toward classical and near-term quantum solvers for PDEs with exploitable solution structure.
We propose a quantum machine learning framework for approximating solutions to high-dimensional parabolic partial differential equations (PDEs) that can be reformulated as backward stochastic differential equations (BSDEs). In contrast to popular quantum-classical network hybrid approaches, this study employs the pure Variational Quantum Circuit (VQC) as the core solver without trainable classical neural networks. The quantum BSDE solver performs pathwise approximation via temporal discretization and Monte Carlo simulation, framed as model-based reinforcement learning. We benchmark VQCbased and classical deep neural network (DNN) solvers on two canonical PDEs as representatives: the Black-Scholes and nonlinear Hamilton-Jacobi-Bellman (HJB) equations. The VQC achieves lower variance and improved accuracy in most cases, particularly in highly nonlinear regimes and for out-of-themoney options, demonstrating greater robustness than DNNs. These results, obtained via quantum circuit simulation, highlight the potential of VQCs as scalable and stable solvers for highdimensional stochastic control problems.