Breaking the Curse of Dimensionality in Quantum PDE Solvers via Gevrey Regularity

Abstract

We connect different degrees of smoothness of real-valued periodic functions to the number of qubits required for their high-precision Fourier-basis amplitude encodings. Our central observation is that the Gevrey hierarchy, which stratifies the space between smooth and analytic functions, provides a natural class for high-precision quantum algorithms. We use Gevrey regularity to analyze a quantum algorithm for solving general linear partial differential equations (PDEs) with periodic boundary conditions. We then extend the solver to PDEs with Dirichlet boundary conditions using thin Gevrey collars and a regularized inverse. Our resource bounds specify precision-dependent Fourier cutoffs and account for restricted discrete stability, elementary gate costs, and restriction to the Dirichlet domain. Finally, we apply our approach to isotropic and anisotropic Poisson equations with periodic and Dirichlet boundary conditions.