A Quantum Spectral Framework for Solving PDEs

• URL: http://arxiv.org/abs/2604.25825v1
• Date: Tue, 28 Apr 2026 16:33:59 GMT
• Title: A Quantum Spectral Framework for Solving PDEs
• Abstract summary: Partial differential equations (PDEs) are fundamental across numerous scientific fields.<n>Attempts to solve this problem typically rely on either classical sparsity and low-rank decompositions.<n>Quantum Computing offers a promising alternative, as it allows us to operate in significantly larger spaces.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Partial differential equations (PDEs) are fundamental across numerous scientific fields. As these problems scale to high dimensions, classical numerical schemes introduce severe computational bottlenecks, known as the curse of dimensionality. Attempts to solve this problem typically rely on either classical sparsity and low-rank decompositions, or neural network surrogate models. On the other hand, Quantum Computing offers a promising alternative, as it allows us to operate in significantly larger spaces while demanding far fewer resources. In this work, we present a quantum subroutine to solve second-order linear PDEs by exploiting the structural properties of the filter in Fourier space using Quantum Block Encoding (QBE) with quantum reversible arithmetic. This approach serves as a specialized alternative to standard quantum matrix inversion, which typically relies solely on Quantum Singular Value Transformation (QSVT) without exploiting the inherent structural properties of the matrix. We validate the proposed methodology against its classical counterpart to prove its correctness. This framework provides a foundation for extending these methods toward quantum group Fourier transforms, wavelet-based analysis, and equivariant quantum neural networks (EQNNs), offering a promising path toward solving broader classes of problems, including nonlinear PDEs.

Related papers

• Adaptive Quantum Physics-Informed Neural Networks for Differential Equations with Applications to Fluid Dynamics [0.0]
  Physics-informed neural networks (PINNs) have emerged as a versatile approach for solving nonlinear partial differential equations (PDEs)<n>We present a hybrid quantum-classical framework that enhances Quantum PINNs through adaptive collocation point sampling and loss-aware attention mechanisms.
  arXiv  Detail & Related papers  (2026-08-01T20:11:21Z)
• Quantum Physics-Informed Neural Networks for Solving Integro and Fractional PDEs [5.658353995249502]
  This work introduces a quantum physics-informed neural network (QPINN) framework that combines a quantum neural network with the governing equations of general nonlinear equations.<n>A series of numerical experiments demonstrates that the proposed QPINN framework accurately captures the behavior of nonlinearIDEs and FIPDEs.
  arXiv  Detail & Related papers  (2026-06-25T10:51:47Z)
• Learning PDEs for Portfolio Optimization with Quantum Physics-Informed Neural Networks [9.321321481203904]
  Partial differential equations (PDEs) play a crucial role in financial mathematics, particularly in portfolio optimization.<n>Here, we investigate the potential role of quantum circuits for solving PDEs.
  arXiv  Detail & Related papers  (2026-04-03T10:24:14Z)
• SpinGQE: A Generative Quantum Eigensolver for Spin Hamiltonians [42.007194397302825]
  Ground state search is central to quantum computing.<n>We present SpinGQE, an extension of the Generative Quantum Eigensolver framework to spin Hamiltonians.<n>We employ a transformer-based decoder to learn over quantum circuits that produce low-energy states.
  arXiv  Detail & Related papers  (2026-03-25T13:38:15Z)
• Quantum Neural Physics: Solving Partial Differential Equations on Quantum Simulators using Quantum Convolutional Neural Networks [4.542801731045077]
  This work establishes a mapping from discretised physical equations to logarithmic-scale quantum circuits.<n>It provides a new and exploratory path to exponential memory compression and computational acceleration for PDE solvers on future fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2026-03-25T11:19:56Z)
• Simulating Supersymmetric Quantum Mechanics Using Variational Quantum Algorithms [0.0]
  We present the variational quantum eigensolver (VQE) for supersymmetric quantum mechanics with various superpotentials.<n>A key new feature is an adaptive ansatz construction algorithm that reduces the number of variational parameters within our anstze.<n>Preliminary VQE results obtained from real IBM quantum devices highlight accuracy, resource constraints, and computational cost.
  arXiv  Detail & Related papers  (2026-03-19T10:54:58Z)
• Quantum Orthogonal Separable Physics-Informed Neural Networks [0.0]
  This paper introduces Quantum Orthogonal Separable Physics-Informed Neural Networks (QO-SPINNs), a novel architecture for solving Partial Differential Equations.<n>We leverage a quantum algorithm for accelerating matrix multiplication within each layer, achieving a $mathcal O(dlog d/2)$ complexity.<n>We provide a robust and efficient framework for uncertainty quantification (UQ) which, to our knowledge, is the first UQ method specifically designed for Separable PINNs.
  arXiv  Detail & Related papers  (2025-11-16T14:15:19Z)
• Quantum Random Feature Method for Solving Partial Differential Equations [36.58357595906332]
  Quantum computing holds promise for scientific computing due to its potential for exponential speedups over classical methods.<n>In this work, we introduce a quantum random method (QRFM) that leverages advantages from both numerical analysis and neural analysis.
  arXiv  Detail & Related papers  (2025-10-09T08:42:09Z)
• Quantum neural ordinary and partial differential equations [38.77776626953413]
  We present a unified framework that brings the continuous-time formalism of classical neural ODEs/PDEs into quantum machine learning and quantum control.<n>We define QNODEs as the evolution of finite-dimensional quantum systems, and QNPDEs as infinite-dimensional (continuous-variable) counterparts.
  arXiv  Detail & Related papers  (2025-08-24T18:43:44Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Quantum-inspired optimization for wavelength assignment [51.55491037321065]
  We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
  arXiv  Detail & Related papers  (2022-11-01T07:52:47Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization [44.96576908957141]
  We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linear iterations problems on quantum computers.
  arXiv  Detail & Related papers  (2022-03-23T18:00:03Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.