Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.33095

An Efficient Quantum Spectral-Galerkin Method for Linear Elliptic Equations

Dongjie Wang, Sheng Chen

Published Oct 22, 2026• 0 citations
arXivHTMLPDF

Abstract

This paper presents an efficient quantum spectral-Galerkin method for constant-coefficient second-order linear elliptic equations. The method employs a boundary-adapted Jacobi tensor-product basis that incorporates the boundary condition into the approximation space and produces Galerkin systems with polynomially bounded condition numbers and sparsity. For analytic solutions satisfying a suitable uniform regularity condition, spectral convergence allows the normalized Galerkin coefficient state to be prepared with complexity $\mathrm{poly}(d,\log(1/ε))$, where $d$ is the spatial dimension and $ε$ is the error tolerance, under standard sparse-access and state-preparation assumptions. At the state-preparation level, this improves the precision dependence over fixed-order finite-difference and finite-element discretizations. We further show how to estimate prescribed linear functionals of the solution, with an additional $O(1/ε)$ factor arising from norm and inner-product estimation.

DOI
10.48550/arxiv.2610.33095

Related papers

Efficient quantum ultraspherical transform and a well-conditioned quantum spectral method

Trong Duong, Norbert Hosters

Solving differential equations is a promising application of quantum computing. Spectral methods, where the solution is represented by coefficients in a basis, are particularly well suited to quantum solvers because their structured discretizations can enable efficient linear-algebra operations while providing rapid convergence. Their quantum implementation, however, requires an efficient transform between amplitudes encoding function values and amplitudes encoding expansion coefficients. This work develops two key components of a quantum spectral method. First, we construct the quantum ultraspherical transform (QUT) for orthonormal ultraspherical polynomials, a basis that supports sparse and well-conditioned discretizations of differential equations. For the basis parameters $m=0$ and $1$, this transform reduces to the discrete cosine and sine transforms with known efficient circuits. Our contribution covers every fixed integer $m\geq2$: for dimensions $N$ with $N+m=2^n$, where $n$ is the number of qubits, the QUT achieves error at most $\varepsilon$ using a gate count polynomial in $n$ and $\log(1/\varepsilon)$. The construction builds on the quantum Fourier transform, augmented by approximations whose accuracy guarantees are independent of $N$. Second, we develop a quantum spectral solver for regular linear ordinary differential equations based on the QUT. Under suitable boundary conditions and data-access assumptions, preconditioning keeps condition numbers bounded independently of the basis size, allowing the solution state to be prepared at polylogarithmic cost in system size and inverse error. Together, these contributions provide a framework for quantum spectral methods with the potential to solve linear differential equations efficiently.

arXiv:2611.06651•Nov 4, 2026•0 citations

Toward Efficient End-to-End Quantum Elliptic PDE Solvers: a Multilevel Correction Algorithm for Direct Observable Estimation

Xiantao Li

Spatial derivatives pose a basic challenge for quantum algorithms for partial differential equations: their standard discretizations have operator norms that grow as the mesh is refined, leading to large block-encoding normalization factors. Even when preconditioning improves access to the solution, estimating derivative-dependent physical observables can reintroduce polynomial dependence on the inverse mesh width. We develop a multilevel quantum algorithm for estimating linear and quadratic observables of elliptic equations that addresses this readout cost. The algorithm decomposes the output into corrections across nested discretizations and realizes fine--coarse cancellation coherently, before measurement. A Ritz-complement factorization connects the $O(h^2)$ size of the corrected response with a block encoding at the same scale, allowing this decay to offset growing readout normalizations. Under efficient quantum access to the corrected coordinates, input data, and readouts, observables with readout scale $O(h^{-χ})$, $0\leχ\le2$, can be estimated to additive accuracy $ε$ at cost $\widetilde O(ε^{-1})$ using amplitude estimation or $\widetilde O(ε^{-2})$ using direct sampling, with only polylogarithmic dependence on the inverse finest mesh width $h_L^{-1}$. We give explicit constructions of the required operator oracles for one-dimensional piecewise linear finite elements with diffusion piecewise constant on a fixed coarsest partition, and for Fourier spectral hierarchies. Output-specific bias estimates connect the discrete results to continuum accuracy.

quant-pharXiv:2606.01270•Jun 2, 2026•3 citations

High-precision quantum algorithms for partial differential equations

Andrew M. Childs, Jin-Peng Liu, Aaron Ostrander

Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity p o l y ( 1 / ϵ ) , where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be p o l y ( d , log ⁡ ( 1 / ϵ ) ) , where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.

arXiv:2002.07868•Quantum•Nov 10, 2021•219 citations

A Residual-Based Quantum Linear System Algorithm with Dynamic Stopping and Applications to Elliptic PDEs

Xiantao Li

Quantum linear-system algorithms (QLSAs) have rigorous worst-case complexity guarantees, but their runtimes are often chosen from spectral information assumed in advance. What is largely lacking is an a posteriori progress flag: most QLSA workflows, unlike the classical counterparts, do not provide a built-in mechanism to signal whether a particular instance has already converged. For discretizations of elliptic PDEs $-\nabla\cdot(a(x)\nabla u(x))=f(x),$ with divergence--gradient structure \[ -\nabla\cdot \big(a(x)\nabla) \approx A_h=G_h^\dagger G_h, \] we formulate a stable first-order ODE whose limiting solution block is the desired Galerkin solution. The PDE-dependent scale is then \(\norm{G_h}=\bigO(h^{-1})\), comparable to factorized QLSA constructions with square-root condition-number scaling. We design an augmented dynamics with residual variables, in which measuring a residual register gives an on-the-fly convergence indicator without reconstructing the solution vector. For smooth right-hand sides, dynamic stopping can reduce the evolution time and gate count relative to a fixed worst-case schedule, and may also reduce exposure to accumulated hardware errors. Numerical experiments for a two-dimensional finite element Poisson problem show that the residual-register probability follows the actual error decay and, for some right-hand sides, can stop the quantum circuit well before a conservative worst-case runtime estimate is reached.

quant-pharXiv:2605.06414•ACM Transactions on Quantum Computing•May 8, 2026•1 citation

Spatial Discretization Error for Quantum Chemistry Simulation

Di Fang, Jiaqi Zhang

Nonrelativistic quantum chemistry is based on the Schrödinger equation in continuous, unbounded space. Computational approaches on classical and quantum computers often truncate the spatial domain and introduce a finite-dimensional basis, reducing the continuum problem to a finite-dimensional one. There is therefore a fundamental question: to what extent does this approximation capture the original continuum problem? In this work, we develop a general Sobolev-Galerkin framework for estimating spatial discretization errors in quantum simulation with unbounded Hamiltonians. We apply this framework to many-body Coulomb systems and establish both periodization and Galerkin error estimates for wave-function dynamics and ground-state energies. For dynamics, the finite-basis projection error of the exact wave function does not capture the full basis-discretization error: an additional dynamical projection error enters our bound at a different rate, and we introduce an inner-product argument to control this contribution. Interestingly, the spatial convergence rates for wave-function dynamics and ground-state energies differ quantitatively. For ground-state energies, we establish a sharp $M^{-1}$ convergence rate at fixed cell size, where $M$ is the number of one-particle basis functions. We also show that a uniform $M^{-1}$ convergence rate is impossible for the corresponding real-time wave-function error with general $H^2$ initial data. The analysis relies on many-body Sobolev estimates with explicit polynomial dependence on system size. Combining these estimates with state-of-the-art quantum algorithms, we obtain, to our knowledge, the first rigorous end-to-end complexity bounds for quantum simulation of molecular and electronic dynamics with all spatial errors explicitly controlled. The number of basis functions is determined directly from the continuum problem, without regularization.

quant-pharXiv:2610.25260•Oct 20, 2026•1 citation

Quantum realization of the finite element method

M. Deiml, Daniel Peterseim

This paper presents a quantum algorithm for the solution of prototypical second-order linear elliptic partial differential equations discretized by d d -linear finite elements on Cartesian grids of a bounded d d -dimensional domain. An essential step in the construction is a BPX preconditioner, which transforms the linear system into a sufficiently well-conditioned one, making it amenable to quantum computation. We provide a constructive proof demonstrating that, for any fixed dimension, our quantum algorithm can compute suitable functionals of the solution to a given tolerance t o l \mathtt {tol} with an optimal complexity of order t o l − 1 \mathtt {tol}^{-1} up to logarithmic terms, significantly improving over existing approaches. Notably, this approach does not rely on the regularity of the solution and achieves a quantum advantage over classical solvers already in two dimensions, whereas prior quantum methods required at least four dimensions for asymptotic benefits. We further detail the design and implementation of a quantum circuit capable of executing our algorithm, present simulator results, and report numerical experiments on current quantum hardware, confirming the feasibility of preconditioned finite element methods for near-term quantum computing.

arXiv:2403.19512•Mathematics of Computation•Aug 14, 2025•30 citations
This paper presents an efficient quantum spectral-Galerkin method for constant-coefficient second-order linear elliptic equations. The method employs a boundary-adapted Jacobi tensor-product basis that incorporates the boundary condition into the approximation space and produces Galerkin systems with polynomially bounded condition numbers and sparsity. For analytic solutions satisfying a suitable uniform regularity condition, spectral convergence allows the normalized Galerkin coefficient state to be prepared with complexity poly(d,log⁡(1/ε))\mathrm{poly}(d,\log(1/ε))poly(d,log(1/ε)), where ddd is the spatial dimension and εεε is the error tolerance, under standard sparse-access and state-preparation assumptions. At the state-preparation level, this improves the precision dependence over fixed-order finite-difference and finite-element discretizations. We further show how to estimate prescribed linear functionals of the solution, with an additional O(1/ε)O(1/ε)O(1/ε) factor arising from norm and inner-product estimation.
Solving differential equations is a promising application of quantum computing. Spectral methods, where the solution is represented by coefficients in a basis, are particularly well suited to quantum solvers because their structured discretizations can enable efficient linear-algebra operations while providing rapid convergence. Their quantum implementation, however, requires an efficient transform between amplitudes encoding function values and amplitudes encoding expansion coefficients. This work develops two key components of a quantum spectral method. First, we construct the quantum ultraspherical transform (QUT) for orthonormal ultraspherical polynomials, a basis that supports sparse and well-conditioned discretizations of differential equations. For the basis parameters m=0m=0m=0 and 111, this transform reduces to the discrete cosine and sine transforms with known efficient circuits. Our contribution covers every fixed integer m≥2m\geq2m≥2: for dimensions NNN with N+m=2nN+m=2^nN+m=2n, where nnn is the number of qubits, the QUT achieves error at most ε\varepsilonε using a gate count polynomial in nnn and log⁡(1/ε)\log(1/\varepsilon)log(1/ε). The construction builds on the quantum Fourier transform, augmented by approximations whose accuracy guarantees are independent of NNN. Second, we develop a quantum spectral solver for regular linear ordinary differential equations based on the QUT. Under suitable boundary conditions and data-access assumptions, preconditioning keeps condition numbers bounded independently of the basis size, allowing the solution state to be prepared at polylogarithmic cost in system size and inverse error. Together, these contributions provide a framework for quantum spectral methods with the potential to solve linear differential equations efficiently.
Spatial derivatives pose a basic challenge for quantum algorithms for partial differential equations: their standard discretizations have operator norms that grow as the mesh is refined, leading to large block-encoding normalization factors. Even when preconditioning improves access to the solution, estimating derivative-dependent physical observables can reintroduce polynomial dependence on the inverse mesh width. We develop a multilevel quantum algorithm for estimating linear and quadratic observables of elliptic equations that addresses this readout cost. The algorithm decomposes the output into corrections across nested discretizations and realizes fine--coarse cancellation coherently, before measurement. A Ritz-complement factorization connects the O(h2)O(h^2)O(h2) size of the corrected response with a block encoding at the same scale, allowing this decay to offset growing readout normalizations. Under efficient quantum access to the corrected coordinates, input data, and readouts, observables with readout scale O(h−χ)O(h^{-χ})O(h−χ), 0≤χ≤20\leχ\le20≤χ≤2, can be estimated to additive accuracy εεε at cost O~(ε−1)\widetilde O(ε^{-1})O(ε−1) using amplitude estimation or O~(ε−2)\widetilde O(ε^{-2})O(ε−2) using direct sampling, with only polylogarithmic dependence on the inverse finest mesh width hL−1h_L^{-1}hL−1​. We give explicit constructions of the required operator oracles for one-dimensional piecewise linear finite elements with diffusion piecewise constant on a fixed coarsest partition, and for Fourier spectral hierarchies. Output-specific bias estimates connect the discrete results to continuum accuracy.
Quantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity p o l y ( 1 / ϵ ) , where ϵ is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be p o l y ( d , log ⁡ ( 1 / ϵ ) ) , where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.
Quantum linear-system algorithms (QLSAs) have rigorous worst-case complexity guarantees, but their runtimes are often chosen from spectral information assumed in advance. What is largely lacking is an a posteriori progress flag: most QLSA workflows, unlike the classical counterparts, do not provide a built-in mechanism to signal whether a particular instance has already converged. For discretizations of elliptic PDEs −∇⋅(a(x)∇u(x))=f(x),-\nabla\cdot(a(x)\nabla u(x))=f(x),−∇⋅(a(x)∇u(x))=f(x), with divergence--gradient structure −∇⋅(a(x)∇)≈Ah=Gh†Gh, -\nabla\cdot \big(a(x)\nabla) \approx A_h=G_h^\dagger G_h, −∇⋅(a(x)∇)≈Ah​=Gh†​Gh​, we formulate a stable first-order ODE whose limiting solution block is the desired Galerkin solution. The PDE-dependent scale is then \(\norm{G_h}=\bigO(h^{-1})\), comparable to factorized QLSA constructions with square-root condition-number scaling. We design an augmented dynamics with residual variables, in which measuring a residual register gives an on-the-fly convergence indicator without reconstructing the solution vector. For smooth right-hand sides, dynamic stopping can reduce the evolution time and gate count relative to a fixed worst-case schedule, and may also reduce exposure to accumulated hardware errors. Numerical experiments for a two-dimensional finite element Poisson problem show that the residual-register probability follows the actual error decay and, for some right-hand sides, can stop the quantum circuit well before a conservative worst-case runtime estimate is reached.
Nonrelativistic quantum chemistry is based on the Schrödinger equation in continuous, unbounded space. Computational approaches on classical and quantum computers often truncate the spatial domain and introduce a finite-dimensional basis, reducing the continuum problem to a finite-dimensional one. There is therefore a fundamental question: to what extent does this approximation capture the original continuum problem? In this work, we develop a general Sobolev-Galerkin framework for estimating spatial discretization errors in quantum simulation with unbounded Hamiltonians. We apply this framework to many-body Coulomb systems and establish both periodization and Galerkin error estimates for wave-function dynamics and ground-state energies. For dynamics, the finite-basis projection error of the exact wave function does not capture the full basis-discretization error: an additional dynamical projection error enters our bound at a different rate, and we introduce an inner-product argument to control this contribution. Interestingly, the spatial convergence rates for wave-function dynamics and ground-state energies differ quantitatively. For ground-state energies, we establish a sharp M−1M^{-1}M−1 convergence rate at fixed cell size, where MMM is the number of one-particle basis functions. We also show that a uniform M−1M^{-1}M−1 convergence rate is impossible for the corresponding real-time wave-function error with general H2H^2H2 initial data. The analysis relies on many-body Sobolev estimates with explicit polynomial dependence on system size. Combining these estimates with state-of-the-art quantum algorithms, we obtain, to our knowledge, the first rigorous end-to-end complexity bounds for quantum simulation of molecular and electronic dynamics with all spatial errors explicitly controlled. The number of basis functions is determined directly from the continuum problem, without regularization.
This paper presents a quantum algorithm for the solution of prototypical second-order linear elliptic partial differential equations discretized by d d -linear finite elements on Cartesian grids of a bounded d d -dimensional domain. An essential step in the construction is a BPX preconditioner, which transforms the linear system into a sufficiently well-conditioned one, making it amenable to quantum computation. We provide a constructive proof demonstrating that, for any fixed dimension, our quantum algorithm can compute suitable functionals of the solution to a given tolerance t o l \mathtt {tol} with an optimal complexity of order t o l − 1 \mathtt {tol}^{-1} up to logarithmic terms, significantly improving over existing approaches. Notably, this approach does not rely on the regularity of the solution and achieves a quantum advantage over classical solvers already in two dimensions, whereas prior quantum methods required at least four dimensions for asymptotic benefits. We further detail the design and implementation of a quantum circuit capable of executing our algorithm, present simulator results, and report numerical experiments on current quantum hardware, confirming the feasibility of preconditioned finite element methods for near-term quantum computing.