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

Quantum Finite Element Method via Quantum Annealing for Solid Mechanics

Xidong Wang, Xiaojun Wang, Lianming Xu, Geyong Cao, Yanbo Chen, Zhenghuan Wang

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.2139/ssrn.6668084

Related papers

Finite Element Quantum Mechanical Analysis

Nobuhiro YOSHIKAWA, Yasuyuki Mitsui, Osamu Kuwazuru +1 more

Finite Element Method， O ( N ) Methods

Proceedings of the 1992 Annual Meeting of JSME/MMD•Jan 1, 2003•0 citations

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

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

•Jan 7, 2025•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

Development of Hamiltonian for Structural Applications by Quantum Annealing Assuming Finite Element Method

Rio Honda, Katsuhiro Endo, Yudai Suzuki +3 more

ABSTRACT Quantum annealing is emerging as a practical tool for large‐scale combinatorial optimization. We map continuum displacements and element densities to binary variables, turning both deformation analysis and topology optimization into quadratic unconstrained binary optimization (QUBO) problems that run on today's annealers. Two formulations are compared: one derived from the stiffness equation and another from the minimum total potential energy. Benchmarks show the energy‐based QUBO matches finite‐element displacements and stresses more closely and avoids the rapid term‐count growth that slows the stiffness‐based form. The numerical demonstrations reported here include deformation analysis of a 100‐element plate model and topology optimization of cantilever beams discretized with up to 60 triangular elements or 32 rectangular elements. These examples are intended as proof‐of‐concept demonstrations under current hardware and encoding limitations rather than as large‐scale industrial benchmarks. Leveraging this model, a single QUBO embedding density variables–implemented with combinatorial random‐number sums and a quadratic volume penalty–yields two‐dimensional beam layouts that are quantitatively compared with those obtained using the classical Optimality Criteria (OC) method.

International Journal for Numerical Methods in Engineering•Sep 2, 2026•0 citations

Finite element descriptions of quantum mechanical systems

Holly S. Randa

•Jan 1, 1996•0 citations

Box algorithm for the solution of differential equations on a quantum annealer

Siddhartha Srivastava, Veera Sundararaghavan

Differential equations are ubiquitous in models of physical phenomena. Applications like steady-state analysis of heat flow and deflection in elastic bars often admit to a second-order differential equation. In this paper, we discuss the use of a quantum annealer to solve such differential equations by recasting a finite element model in the form of an Ising Hamiltonian. The discrete variables involved in the Ising model introduce complications when defining differential quantities, for instance, gradients involved in scientific computations of solid and fluid mechanics. To address this issue, a graph-coloring-based methodology is proposed which searches iteratively for solutions in a subspace of weak solutions defined over a graph, hereafter called the ``box algorithm.'' The box algorithm is demonstrated by solving a truss mechanics problem on a D-Wave quantum computer.

arXiv:1812.10572•Physical Review A•May 31, 2019•34 citations
ABSTRACT Quantum annealing is emerging as a practical tool for large‐scale combinatorial optimization. We map continuum displacements and element densities to binary variables, turning both deformation analysis and topology optimization into quadratic unconstrained binary optimization (QUBO) problems that run on today's annealers. Two formulations are compared: one derived from the stiffness equation and another from the minimum total potential energy. Benchmarks show the energy‐based QUBO matches finite‐element displacements and stresses more closely and avoids the rapid term‐count growth that slows the stiffness‐based form. The numerical demonstrations reported here include deformation analysis of a 100‐element plate model and topology optimization of cantilever beams discretized with up to 60 triangular elements or 32 rectangular elements. These examples are intended as proof‐of‐concept demonstrations under current hardware and encoding limitations rather than as large‐scale industrial benchmarks. Leveraging this model, a single QUBO embedding density variables–implemented with combinatorial random‐number sums and a quadratic volume penalty–yields two‐dimensional beam layouts that are quantitatively compared with those obtained using the classical Optimality Criteria (OC) method.
Differential equations are ubiquitous in models of physical phenomena. Applications like steady-state analysis of heat flow and deflection in elastic bars often admit to a second-order differential equation. In this paper, we discuss the use of a quantum annealer to solve such differential equations by recasting a finite element model in the form of an Ising Hamiltonian. The discrete variables involved in the Ising model introduce complications when defining differential quantities, for instance, gradients involved in scientific computations of solid and fluid mechanics. To address this issue, a graph-coloring-based methodology is proposed which searches iteratively for solutions in a subspace of weak solutions defined over a graph, hereafter called the ``box algorithm.'' The box algorithm is demonstrated by solving a truss mechanics problem on a D-Wave quantum computer.