Quantum-inspired classical algorithms provably cannot achieve exponential-in-dimension speedup for finite-element discretizations of the high-dimensional Poisson equation.
A polynomial dimension-dependence analysis of Bramble--Pasciak--Xu preconditioners
2 Pith papers cite this work. Polarity classification is still indexing.
abstract
We investigate the dimension dependence of Bramble--Pasciak--Xu (BPX) preconditioners for high-dimensional partial differential equations and establish that the condition numbers of BPX-preconditioned systems grow only polynomially with the spatial dimension. Our analysis requires a careful derivation of the dimension dependence of several fundamental tools in the theory of finite element methods, including elliptic regularity, the Bramble--Hilbert lemma, trace inequalities, and inverse inequalities. We further analyze an averaged Scott--Zhang-type quasi-interpolation operator, and show that its associated constants scale polynomially with the dimension. Building on these ingredients, we prove a multilevel norm equivalence theorem and derive a BPX preconditioner with explicit polynomial bounds on its dimensional dependence. The analysis is motivated in part by recent tensor and quantum finite element methods, where dimension-explicit conditioning estimates for BPX preconditioners play an important role.
years
2026 2representative citing papers
A multilevel algorithm using Schur-complement factorization on interlevel corrections eliminates polynomial h-dependent readout overhead for observables with χ≤2 in quantum elliptic PDE solvers, achieving near-Heisenberg scaling with amplitude estimation.
citing papers explorer
-
Quantum-inspired methods for finite-element discretizations of the high-dimensional Poisson equation
Quantum-inspired classical algorithms provably cannot achieve exponential-in-dimension speedup for finite-element discretizations of the high-dimensional Poisson equation.
-
Toward Efficient End-to-End Quantum Elliptic PDE Solvers: a Multilevel Correction Algorithm for Direct Observable Estimation
A multilevel algorithm using Schur-complement factorization on interlevel corrections eliminates polynomial h-dependent readout overhead for observables with χ≤2 in quantum elliptic PDE solvers, achieving near-Heisenberg scaling with amplitude estimation.