Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Resolution of elasto-plastic finite-elements problems by quantum annealing (Plenary Lecture)

Van Dung Nguyen, Ling Wu, F. Remacle, Ludovic Noels

Published Jan 7, 2025• 0 citations
OpenAlex

Related papers

A hybrid quantum annealer-classical computer variational framework for elasto-plastic materials

Nguyen, Van Dung, Wu, Ling, Damanet, François +2 more

re)formulation for quantum annealing

•Jun 4, 2024•0 citations

A quantum annealing-sequential quadratic programming assisted finite element simulation for non-linear and history-dependent mechanical problems

Van Dung Nguyen, Ling Wu, F. Remacle +1 more

arXiv:2310.06911•European Journal of Mechanics - A/Solids•Feb 1, 2024•13 citations

Quantum Finite Element Method via Quantum Annealing for Solid Mechanics

Xidong Wang, Xiaojun Wang, Lianming Xu +3 more

•Jan 1, 2026•0 citations

Lecture: Quantum Annealing

Dennis Willsch

•Jan 1, 2025•0 citations

Solving Helmholtz problems with finite elements on a quantum annealer

Arnaud Rémi, François Damanet, Christophe Geuzaine

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.

arXiv:2410.13740•Physical Review A•Dec 15, 2025•0 citations

Plenary lecture 4: mathematical characterization of quantum algorithm

Satoshi Iriyama

International Conference on Applied Mathematics•Dec 14, 2009•0 citations
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.