.png){kind=icon}
Return
QUANTUM RANDOM FEATURE METHOD FOR SOLVING PARTIAL DIFFERENTIAL EQUATIONS
.png){kind=icon}
PRE
AI
DOI：10.3934/dcds.2026096.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
. Quantum computing holds significant promise for scientific computing due to its potential for polynomial to even exponential speedups over classical methods, which are often hindered by the curse of dimensionality. While neural networks present a mesh-free alternative to solve partial differential equations (PDEs), their accuracy is difficult to achieve since one needs to solve a high-dimensional non-convex optimization problem using the stochastic gradient descent method and its variants, the convergence of which is difficult to prove and cannot be guaranteed. The classical random feature method (RFM) effectively merges advantages from both classical numerical analysis and neural network based techniques, achieving spectral accuracy and a natural adaptability to complex geometries. In this work, we introduce a quantum random feature method (QRFM) that leverages quantum computing to accelerate the classical RFM framework. Our method constructs PDE solutions using quantum-generated random features and enforces the governing equations via a collocation approach. A complexity analysis demonstrates that this hybrid quantum-classical algorithm can achieve a quadratic speedup over the classical RFM.
Keywords:
Quantum algorithms
partial differential equation
random feature method
quantum kernel regression
machine learning
Journal
D
IF:
1.1
Papers:
104
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more