量子算法用于异质偏微分方程:中子扩散本征值问题
Quantum Algorithms for Heterogeneous PDEs: The Neutron Diffusion Eigenvalue Problem
AI总结:
本文提出一种混合量子-经典算法,解决线性反应-扩散方程中的中子扩散本征值问题,通过统一有限元方法展示量子算法在异质介质中提供显著的多项式端到端加速。
摘要:
我们开发了一种混合经典-量子算法,用于求解一种线性反应-扩散方程,即中子扩散(广义)k-本征值问题,该问题用于建立核临界性。该算法处理具有分段常数系数的方程,描述异质介质中的问题。我们应用统一有限元方法,并展示量子算法在端到端加速方面显著优于其经典对应物。这种加速利用了最近在量子线性系统中的进展——快速反演和量子预条件——并将哈密顿模拟作为子程序。我们的结果表明,量子算法可能为异质PDE提供加速,但这种优势相对于最快经典算法的程度取决于其他经典方法如非均匀或自适应网格在特定问题实例中的有效性。
英文摘要:
We develop a 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 classical uniform finite element methods in the cases tested, although nonuniform classical methods can perform much better than uniform ones. Our work 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。