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

Acta Mechanica Solida Sinica

Quantum Computing for Boundary-Aware Computational Mechanics: A Review and Variational Finite Element Perspective

Dingjie Lu, Yangfan Li, Jun Liu, Zhuangjian Liu, Wei-Bin Ewe

Published Nov 2, 2026• 0 citations
Publisher
DOI
10.1007/s10338-026-00862-2

Related papers

A Review of Quantum Scientific Computing Algorithms Relevant to Computational Mechanics

Osama M. Raisuddin, Suvranu De

Archives of Computational Methods in Engineering•Oct 1, 2025•4 citations

Variational quantum algorithm for solving Helmholtz problems with high order finite elements

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

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.

quant-pharXiv:2512.22665•IEEE International Conference on Quantum Control, Computing and Learning (qCCL)•Dec 30, 2025•0 citations

True Variational Principles and Time-Space Finite Element Methods for Classical and Quantum Mechanics

Bradley T. Darrall

•Jan 1, 2016•0 citations

Quantum computing for solid mechanics and structural engineering – A demonstration with Variational Quantum Eigensolver

Yunya Liu, Jiakun Liu, Jordan R. Raney +1 more

arXiv:2308.14745•Extreme Mechanics Letters•Dec 14, 2023•18 citations

Accelerating Large-Scale Linear Algebra Using Variational Quantum Imaginary Time Evolution

Willie Aboumrad, Daiwei Zhu, Claudio Girotto +6 more

The solution of large sparse linear systems via factorization methods such as LU or Cholesky decomposition, can be computationally expensive due to the introduction of non-zero elements, or “fill-in.” Graph partitioning can be used to reduce the “fill-in,” thereby speeding up the solution of the linear system. We introduce a quantum approach to the graph partitioning problem based on variational quantum imaginary time evolution (VarQITE). We develop a hybrid quantum/classical method to accelerate Finite Element Analysis (FEA) by using VarQITE in Ansys's LS-DYNA multiphysics simulation software. This allows us to study different types of FEA problems, from mechanical engineering to computational fluid dynamics in simulations and on quantum hardware (IonQ Aria and IonQ Forte). We demonstrate that VarQITE has the potential to impact LSDYNA workflows by measuring the wall-clock time to solution of FEA problems. We report performance results for our hybrid quantum/classical workflow on selected FEA problem instances, including simulation of blood pumps, automotive roof crush, and vibration analysis of car bodies on meshes of up to six million elements. We find that the LS-DYNA wall clock time can be improved by up to 12% for some problems. Finally, we introduce a classical heuristic inspired by Fiduccia-Mattheyses to improve the quality of VarQITE solutions obtained from hardware runs. Our results highlight the potential impact of quantum computing on large-scale FEA problems in the NISQ era.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•1 citation

Quantum Computation Based Grover’s Search Algorithm and its Variations

Kapil Kumar Soni, Akhtar Rasool

Background: The future computations need parallelism, and a way to achieve the same is through quantum-based specific properties. Quantum computation supports exponential operation to be performed in parallel over a single execution step and hence achieves computational speedup. Objective: One of the quantum-based algorithms allows to search the key element over an index based unstructured database and succeeds to obtain the speedup. In the whole context of article writing, our approach reviews the significance of quantum computing, the basics required for quantum computation and their quantum logic-based circuit operations. Method: The article focuses on Grover’s search algorithm and its variations, and then illustrates the relevant amplitude amplification & phase matching techniques in accordance with the advantages and limitation to the specific perspective. Results: We made the comparative analysis between the amplitude amplification-based static & dynamic Grover’s searching and phase estimation technique. Along with this, we justified the possibilities of the empirical results and observed facts over Grover’s variant approaches. Conclusion: Finally, we conclude the analytical comparison between quantum-based searching techniques along with the applicability of Grover’s algorithm in practical computational science.

Recent Patents on Engineering•Jul 16, 2020•0 citations
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 AAA and A†AA^\dagger AA†A arising from the high-order finite element discretisation of Helmholtz problems can be designed, resulting in a quantum circuit of depth O(p3polylog⁡(Np))\mathcal{O}(p^3\mathrm{poly}\log(Np))O(p3polylog(Np)) with NNN the number of elements and ppp 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.
The solution of large sparse linear systems via factorization methods such as LU or Cholesky decomposition, can be computationally expensive due to the introduction of non-zero elements, or “fill-in.” Graph partitioning can be used to reduce the “fill-in,” thereby speeding up the solution of the linear system. We introduce a quantum approach to the graph partitioning problem based on variational quantum imaginary time evolution (VarQITE). We develop a hybrid quantum/classical method to accelerate Finite Element Analysis (FEA) by using VarQITE in Ansys's LS-DYNA multiphysics simulation software. This allows us to study different types of FEA problems, from mechanical engineering to computational fluid dynamics in simulations and on quantum hardware (IonQ Aria and IonQ Forte). We demonstrate that VarQITE has the potential to impact LSDYNA workflows by measuring the wall-clock time to solution of FEA problems. We report performance results for our hybrid quantum/classical workflow on selected FEA problem instances, including simulation of blood pumps, automotive roof crush, and vibration analysis of car bodies on meshes of up to six million elements. We find that the LS-DYNA wall clock time can be improved by up to 12% for some problems. Finally, we introduce a classical heuristic inspired by Fiduccia-Mattheyses to improve the quality of VarQITE solutions obtained from hardware runs. Our results highlight the potential impact of quantum computing on large-scale FEA problems in the NISQ era.
Background: The future computations need parallelism, and a way to achieve the same is through quantum-based specific properties. Quantum computation supports exponential operation to be performed in parallel over a single execution step and hence achieves computational speedup. Objective: One of the quantum-based algorithms allows to search the key element over an index based unstructured database and succeeds to obtain the speedup. In the whole context of article writing, our approach reviews the significance of quantum computing, the basics required for quantum computation and their quantum logic-based circuit operations. Method: The article focuses on Grover’s search algorithm and its variations, and then illustrates the relevant amplitude amplification & phase matching techniques in accordance with the advantages and limitation to the specific perspective. Results: We made the comparative analysis between the amplitude amplification-based static & dynamic Grover’s searching and phase estimation technique. Along with this, we justified the possibilities of the empirical results and observed facts over Grover’s variant approaches. Conclusion: Finally, we conclude the analytical comparison between quantum-based searching techniques along with the applicability of Grover’s algorithm in practical computational science.