Quantum Algorithms for Heterogeneous PDEs: The Neutron Diffusion Eigenvalue Problem

• URL: http://arxiv.org/abs/2604.05098v1
• Date: Mon, 06 Apr 2026 18:57:21 GMT
• Title: Quantum Algorithms for Heterogeneous PDEs: The Neutron Diffusion Eigenvalue Problem
• Abstract summary: We develop a hybrid classical-quantum algorithm to solve a type of linear reaction-diffusion equation.<n>We show that the quantum algorithm provides significant end-to-end speedup over its classical counterparts.
• Score: 0.9025503352150882
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a hybrid classical-quantum algorithm to solve a type of linear reaction-diffusion equation, the neutron diffusion (generalized) k-eigenvalue problem that establishes nuclear criticality. The algorithm handles an equation with piecewise constant coefficients, describing a problem in a heterogeneous medium. We apply uniform finite elements and show that the quantum algorithm provides significant polynomial end-to-end speedup over its classical counterparts. This speedup leverages recent advances in quantum linear systems -- fast inversion and quantum preconditioning -- and uses Hamiltonian simulation as a subroutine. Our results suggest that quantum algorithms may provide speedups for heterogeneous PDEs, though the extent of this advantage over the fastest classical algorithm depends on the effectiveness of other classical approaches such as nonuniform or adaptive meshing for a given problem instance.

Related papers

• Quantum Implicit-Explicit Schemes for Multiscale Ordinary and Partial Differential Equations via Schrödingerization [34.04094622012203]
  We present a quantum implicit-explicit (IMEX) scheme for multiscale ordinary and partial differential equations.<n>A key ingredient of our approach is a continuous-time formulation of classical IMEX schemes.<n>We employ the Schrdingerization framework to implement IMEX schemes on quantum computers.
  arXiv  Detail & Related papers  (2026-05-28T06:17:33Z)
• Full-quantum variational dynamics simulation for time-dependent Hamiltonians with global spectral discretization [6.840215349970144]
  The most widely used approach for simulating the dynamics of time-dependent Hamiltonians via quantum computation depends on the quantum-classical hybrid variational quantum time evolution algorithm.<n>We here present a full-quantum approach, in which ordinary differential equations of the variational coefficients are transformed into static linear equations.<n>Our full quantum algorithm avoids classical feedback, exponential convergence for smooth Hamiltonians, and yields a quantum circuit depth that is independent of the number of time steps.
  arXiv  Detail & Related papers  (2026-03-17T18:49:26Z)
• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• 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 Algorithms for Solving Generalized Linear Systems via Momentum Accelerated Gradient and Schrödingerization [34.04094622012203]
  We propose a quantum algorithm that combines the momentum accelerated gradient method with Schr"odingerization.<n>The algorithm achieves speedup over its classical counterpark in solving linear systems.<n>It can overcome the practical limitations of existing non-Schr"odingerization-based quantum linear system algorithms.
  arXiv  Detail & Related papers  (2025-09-20T08:40:53Z)
• Solving wave equation problems on D-Wave quantum annealers [44.99833362998488]
  We solve the one-dimensional Helmholtz equation in several scenarios using the quantum annealer provided by the D-Wave systems within a pseudospectral scheme.<n>We assess the performance of different strategies of encoding based on algebraic arguments and the adiabatic condition.
  arXiv  Detail & Related papers  (2025-07-18T08:06:43Z)
• Quantum Algorithms for Stochastic Differential Equations: A Schrödingerisation Approach [29.662683446339194]
  We propose quantum algorithms for linear differential equations.<n>The gate complexity of our algorithms exhibits an $mathcalO(dlog(Nd))$ dependence on the dimensions.<n>The algorithms are numerically verified for the Ornstein-Uhlenbeck processes, Brownian motions, and one-dimensional L'evy flights.
  arXiv  Detail & Related papers  (2024-12-19T14:04:11Z)
• Quantum and classical algorithms for nonlinear unitary dynamics [0.5729426778193399]
  We present a quantum algorithm for a non-linear differential equation of the form $fracd|urangledt.<n>We also introduce a classical algorithm based on the Euler method allowing comparably scaling to the quantum algorithm in a restricted case.
  arXiv  Detail & Related papers  (2024-07-10T14:08:58Z)
• Integrating Quantum Algorithms Into Classical Frameworks: A Predictor-corrector Approach Using HHL [0.562479170374811]
  We adapt a well-known algorithm for linear systems of equations, originally proposed by Harrow, Hassidim and Lloyd (HHL), by adapting it into a predictor-corrector instead of a direct solver. This strategy enables the intelligent omission of computationally costly steps commonly found in many classical algorithms, while simultaneously mitigating the notorious readout problems associated with extracting a quantum state. The versatility of the approach is illustrated through applications in various fields such as smoothed particle hydrodynamics, plasma simulations, and reactive flow configurations.
  arXiv  Detail & Related papers  (2024-06-28T15:31:10Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Towards quantum advantage via topological data analysis [0.0]
  We study the quantum-algorithmic methods behind the algorithm for topological data analysis of Lloyd, Garnerone and Zanardi. We provide a number of new quantum algorithms for problems such as rank estimation and complex network analysis.
  arXiv  Detail & Related papers  (2020-05-06T06:31:24Z)

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.