Quantum preconditioning method for finite difference discretizations of the Poisson equation via Schr\"odingerization
read the original abstract
We present a quantum preconditioning framework for solving linear systems arising from a finite difference discretization of the Poisson equation. It is based on the combination of the Schr\"odingerization technique \cite{JLY22b,JLYPRL24} and the BPX multilevel preconditioner in order to achieve near-optimal complexity. The Schr\"odingerization technique transforms linear partial and ordinary differential equations into Schr\"odinger-type systems with unitary evolution in one higher dimension, making them suitable for quantum simulation. A key contribution is a structure-aware construction of the block-encoding for the symmetrically preconditioned matrix $A_S = S^\top A S$, where $A$ is the stiffness matrix and $S$ encodes the BPX preconditioner in factored form. By establishing a novel commuting identity, we avoid the unfavorable normalization scaling that would otherwise arise from naive multiplication of block-encodings. This yields an exact block-encoding of $A_S$ with normalization $\mathcal{O}(d^2(L+1))$, where $d$ is the spatial dimension and $L$ is the number of levels. Combined with the Schr\"odingerization-based Hamiltonian simulation, the overall quantum algorithm achieves a query complexity of $\mathcal{O}\big(\mathrm{poly}(d)\varepsilon^{-1} \mathrm{polylog}(\varepsilon^{-1}) \big)$ for estimating linear functionals of the solution to a given tolerance $\varepsilon$.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation
A new LCNU-to-LCU decomposition yields a quantum framework for Carleman-linearized lattice Boltzmann equations whose term count scales as O(α² Q²) and is independent of spatial or temporal grid points.
-
Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation
A new LCNU-to-LCU decomposition enables a generalized quantum framework for Carleman-linearized polynomial systems like the lattice Boltzmann equation, with Ns scaling as O(α² Q²) independent of spatial and temporal d...
-
Hybrid quantum-classical algorithms for complex nonlinear partial differential equations with Ginzburg-Landau potential and vortex motion laws
Hybrid quantum-classical algorithms exploit the asymptotic reduction of strongly nonlinear PDEs to linear elliptic problems plus vortex dynamics, achieving exponential speedup in spatial size for 2D cases via quantum ...
-
Quantum Data Loading for Carleman Linearized Systems: Application to the Lattice-Boltzmann Equation
A matrix decomposition into linear combinations of non-unitaries produces an LCU for any Carleman-linearized polynomial system and yields an O(α² Q²) term count for the 3D lattice Boltzmann equation independent of spa...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.