Schrödingerization based quantum algorithms for the fractional Poisson equation
By: Shi Jin, Nana Liu, Yue Yu
Potential Business Impact:
Solves hard math problems much faster with quantum computers.
We develop a quantum algorithm for solving high-dimensional fractional Poisson equations. By applying the Caffarelli-Silvestre extension, the $d$-dimensional fractional equation is reformulated as a local partial differential equation in $d+1$ dimensions. We propose a quantum algorithm for the finite element discretization of this local problem, by capturing the steady-state of the corresponding differential equations using the Schr\"odingerization approach from \cite{JLY22SchrShort, JLY22SchrLong, analogPDE}. The Schr\"odingerization technique transforms general linear partial and ordinary differential equations into Schr\"odinger-type systems, making them suitable for quantum simulation. This is achieved through the warped phase transformation, which maps the equation into a higher-dimensional space. We provide detailed implementations of the method and conduct a comprehensive complexity analysis, which can show up to exponential advantage -- with respect to the inverse of the mesh size in high dimensions -- compared to its classical counterpart. Specifically, while the classical method requires $\widetilde{\mathcal{O}}(d^{1/2} 3^{3d/2} h^{-d-2})$ operations, the quantum counterpart requires $\widetilde{\mathcal{O}}(d 3^{3d/2} h^{-2.5})$ queries to the block-encoding input models, with the quantum complexity being independent of the dimension $d$ in terms of the inverse mesh size $h^{-1}$. Numerical experiments are conducted to verify the validity of our formulation.
Similar Papers
Schrodingerization based quantum algorithms for the time-fractional heat equation
Numerical Analysis
Solves hard math problems much faster using quantum computers.
Quantum-Enhanced Spectral Solution of the Poisson Equation
Numerical Analysis
Solves hard math problems much faster using quantum computers.
Quantum preconditioning method for linear systems problems via Schrödingerization
Numerical Analysis
Makes computers solve hard math problems faster.