betaFeedback

WorksPhysics and Astronomy

Accelerating Diffusion Maps on a Quantum Computer: Spectral Filtering and Galerkin PDE Solvers

Abstract

Diffusion maps generalize principal component analysis (PCA) to nonlinear manifolds, enabling spectral dimensionality reduction, geometric data analysis, and elliptic PDE approximation on point clouds. For large datasets of size NN, however, classical matrix operations incur prohibitive poly⁡(N)\operatorname{poly}(N) scaling, even when extracting low-dimensional spectral features or targeted scalar observables. We introduce a quantum algorithmic framework that bypasses explicit graph-Laplacian assembly by exploiting the symmetric factorization G=ATAG = A^T A directly at the block-encoding level. Combining Gaussian moment dilation, Laplace-weighted linear combinations of unitaries (LCU), and quantum singular value transformation (QSVT), we implement spectral filters of AA to estimate heat-semigroup overlaps, regularized inverse queries, and energy responses, as well as to prepare spectral Galerkin solution states. A common-state construction further allows the block-encoding queries to be used across multiple scalar observables. Under polylogarithmic-cost block-encoding access to AA and state-preparation oracles, our heat-overlap algorithm achieves O(polylog⁡N)O(\operatorname{polylog} N) gate complexity at fixed normalized precision, confidence, and spectral scale. Ideal statevector simulations validate our discrete circuit constructions, while a matched approximate-counting benchmark demonstrates the quadratic precision advantage of coherent amplitude estimation for energy readout.

Paper details

vlnc:W_6863dvzb
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 5

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…