2024/10/17 by Arnaud Rémi, Rémi, Arnaud, François Damanet +3
Computer Science · #Computational Physics (physics.comp-ph) #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2410.13740
openalex publication_date 2024/10/17 · openalex created_date 2024/10/21 · openalex updated_date 2026/07/30
Solving Helmholtz problems using finite elements leads to the resolution of a linear system which is challenging to solve for classical computers. In this paper, we investigate how quantum annealers could address this challenge. We first express the linear system arising from the Helmholtz problem as a generalized eigenvalue problem (gEVP). The obtained gEVP is mapped into quadratic unconstrained binary optimization problems (QUBOs) which we solve using an adaptive quantum annealing eigensolver (AQAE) and its classical equivalent. We identify two key parameters in the success of AQAE for solving Helmholtz problems: the system condition number and the integrated control errors (ICE) in the quantum hardware. Our results show that a large system condition number implies a finer discretization grid for AQAE to converge, leading to a variable overhead, and that AQAE is either tolerant or not with respect to ICE depending on the gEVP. Finally, we establish lower bounds on the annealing time, narrowing the possibility of a quantum advantage for solving Helmholtz problems.