REVIEW 9 cited by
Quantum Realization of the Finite Element Method
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Quantum Realization of the Finite Element Method
read the original abstract
This paper presents a quantum algorithm for the solution of prototypical second-order linear elliptic partial differential equations discretized by $d$-linear finite elements on Cartesian grids of a bounded $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 $\mathtt{tol}$ with an optimal complexity of order $\mathtt{tol}^{-1}$ up to logarithmic terms, significantly improving over existing approaches. Notably, this approach does not rely on regularity of the solution and achieves quantum advantage over classical solvers 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.
Forward citations
Cited by 9 Pith papers
-
Constrained Optimal Polynomials for Quantum Linear System Solvers
Constrained Uniform Polynomial (CUP) and Constrained Adaptive Polynomial (CAP) solvers achieve lower error than standard QSVT and Chebyshev methods in noise-limited regimes by optimizing accuracy versus block-encoding...
-
Nonisothermal global-pressure exactness in fractured multiphase flow with aperture feedback
A new mixed saturation-temperature compatibility condition is derived for exact global-pressure equivalence in nonisothermal multiphase fractured flow, with numerical benchmarks confirming regimes where exactness hold...
-
Block encoding the 3D heterogeneous Poisson equation with application to fracture flow
Block encoding of the 3D heterogeneous Poisson matrix enables quantum linear system algorithms to solve discretized fracture flow problems with runtime O(N^{2/3} polylog N log(1/ε)) and exponential memory savings over...
-
Stable full-field simulation of a multiscale elliptic equation by means of Quantized Tensor Trains
A QTT-based solver with Helmholtz-Leray penalization in Fourier space stably computes solutions and gradients for multiscale elliptic PDEs on meshes with up to 10^37 virtual degrees of freedom in 3D.
-
Stable full-field simulation of a multiscale elliptic equation by means of Quantized Tensor Trains
A QTT-based solver for multiscale elliptic equations achieves full-field solutions and gradients on meshes up to 10^37 DoFs in 3D via a penalized Helmholtz-Leray formulation solved in Fourier space, with claimed uncon...
-
Nonisothermal global-pressure exactness in fractured multiphase flow with aperture feedback
Constrained optimal polynomials (CUP and CAP) reduce quantum linear system solver errors under noise by jointly optimizing approximation accuracy and block-encoding normalization, outperforming standard QSVT and Cheby...
-
Schr\"odingerization for quantum linear systems problems with near-optimal dependence on matrix queries
Schrödingerization-based quantum linear systems solver using LCHS and block preconditioning for near-optimal query complexity.
-
Unitaria: Quantum Linear Algebra via Block Encodings
Unitaria is a new open-source Python library that provides a high-level, composable interface for block encodings in quantum computing, enabling automatic circuit generation and classical simulation-based verification.
-
A Quantum Path to Partial Differential Equations
Lecture notes that organize quantum PDE algorithms around block encodings of finite-difference and finite-element operators, tracking discretization, preparation, normalization, postselection, and measurement costs.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.