Variational quantum algorithm for solving Helmholtz problems with high order finite elements
Preprint
Abstract
Discretizing Helmholtz problems via finite elements yields linear systems whose efficient solution remains a major challenge for classical computation. In this paper, we investigate how variational quantum algorithms could address this challenge. We first show that, for regular meshes, a block encoding of the operators $A$ and $A^\dagger A$ arising from the high-order finite element discretisation of Helmholtz problems can be designed, resulting in a quantum circuit of depth $\mathcal{O}(p^3\mathrm{poly}\log(Np))$ with $N$ the number of elements and $p$ the order of the finite elements. Then we apply our algorithm to a one-dimensional Helmholtz problem with Dirichlet and Neumann boundary conditions for various wavenumbers.
Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Advancements in Quantum Computing—Viewpoint: Building Adoption and Competency in IndustryDatenbank-Spektrum, 2024
- Quantum simulation of partial differential equations: Applications and detailed analysisPhysical Review A, 2023
- NISQ computing: where are we and where do we go?AAPPS Bulletin, 2022
- Variational quantum algorithm based on the minimum potential energy for solving the Poisson equationPhysical Review A, 2021
- Variational quantum algorithm for the Poisson equationPhysical Review A, 2021
- On the condition number of high order finite element methods: Influence of p-refinement and mesh distortionComputers & Mathematics with Applications, 2020
- Hardware-efficient variational quantum eigensolver for small molecules and quantum magnetsNature, 2017
- A variational eigenvalue solver on a photonic quantum processorNature Communications, 2014
- High-order quantum algorithm for solving linear differential equationsJournal of Physics A: Mathematical and Theoretical, 2014
- Efficient Quantum Algorithms for Simulating Sparse HamiltoniansCommunications in Mathematical Physics, 2006