This manuscript presents the Quantum Finite Element Method (Q-FEM) developed for use in noisy intermediate-scale quantum (NISQ) computers and employs the variational quantum linear solver (VQLS) algorithm. The proposed method leverages the classical FEM procedure to perform the unitary decomposition of the stiffness matrix and employs generator functions to design explicit quantum circuits corresponding to the unitaries. Q-FEM keeps the structure of the finite element discretization intact allowing for the use of variable element lengths and material coefficients in FEM discretization. The proposed method is tested on a steady-state heat equation discretized using linear and quadratic shape functions. Numerical verification studies are performed on the IBM QISKIT simulator and it is demonstrated that Q-FEM is effective in converging to the correct solution for a variety of problems and model discretizations, including with different element lengths, variable coefficients, and different boundary conditions. The formalism developed herein is general and can be extended to problems with higher dimensions. However, numerical examples also demonstrate that the number of parameters for the variational ansatz scale exponentially with the number of qubits, and increases the odds of convergence. Moreover, the deterioration of system conditioning with problem size results in barren plateaus and convergence difficulties.
This manuscript presents the Quantum Finite Element Method (Q-FEM) developed for use in noisy intermediate-scale quantum (NISQ) computers and employs the variational quantum linear solver (VQLS) algorithm. The proposed method leverages the classical FEM procedure to perform the unitary decomposition of the stiffness matrix and employs generator functions to design explicit quantum circuits corresponding to the unitaries. Q-FEM keeps the structure of the finite element discretization intact allowing for the use of variable element lengths and material coefficients in FEM discretization. The proposed method is tested on a steady-state heat equation discretized using linear and quadratic shape functions. Numerical verification studies are performed on the IBM QISKIT simulator and it is demonstrated that Q-FEM is effective in converging to the correct solution for a variety of problems and model discretizations, including with different element lengths, variable coefficients, and different boundary conditions. The formalism developed herein is general and can be extended to problems with higher dimensions. However, numerical examples also demonstrate that the number of parameters for the variational ansatz scale exponentially with the number of qubits, and increases the odds of convergence. Moreover, the deterioration of system conditioning with problem size results in barren plateaus and convergence difficulties.
Finite-element methods are industry standards for finding numerical solutions to partial differential equations. However, the application scale remains pivotal to the practical use of these methods, even for modern-day supercomputers. Large, multi-scale applications, for example, can be limited by their requirement of prohibitively large linear system solutions. It is therefore worthwhile to investigate whether near-term quantum algorithms have the potential for offering any kind of advantage over classical linear solvers. In this study, we investigate the recently proposed variational quantum linear solver (VQLS) for discrete solutions to partial differential equations. This method was found to scale polylogarithmically with the linear system size, and the method can be implemented using shallow quantum circuits on noisy intermediate-scale quantum (NISQ) computers. Herein, we utilize the hybrid VQLS to solve both the steady Poisson equation and the time-dependent heat and wave equations.
Abstract This paper introduces a quantum-enhanced finite element method (FEM) designed for noisy intermediate-scale quantum (NISQ) devices, leveraging variational quantum algorithms (VQAs) to solve engineering partial differential equations. We demonstrate the framework by solving the Euler–Bernoulli beam and the NAFEMS T4 heat transfer problems, which involve Dirichlet, Neumann, and Robin boundary conditions. A key innovation is a ‘set-to-zero’ strategy that incorporates boundary conditions through a correction matrix, K bc , allowing for flexible imposition at any node without domain decomposition. The global stiffness matrix is decomposed into a constant number of Pauli terms, O (1), using the method by Sato et al while boundary terms are handled with a sublinearly scaling partial Pauli measurement technique. The algorithm achieves logarithmic qubit scaling ( n = ⌈ log 2 N ⌉ qubits for N degrees of freedom(DOF)) and employs shallow, hardware-efficient circuits with empirically trainable depth for small-scale systems. Validation on the Qiskit statevector simulator shows high accuracy. For the Euler–Bernoulli beam problem with 4 to 64 DOF, the algorithm achieves relative errors of 0.5%–1.5% and fidelities of 0.998–0.999. For the NAFEMS T4 heat transfer benchmark, a 5.4% relative error is observed. The VQA converges robustly within 77–350 iterations, though barren plateaus are a known challenge for scaling to larger systems. This work establishes a scalable framework for quantum FEM, offering a significant memory advantage over classical methods and advancing the potential for quantum-enhanced engineering simulations.
In solid mechanics, finite element discretization of large-scale static problems produces large sparse linear systems whose solution requires substantial computation time and memory. The variational quantum linear solver (VQLS) offers a hybrid quantum-classical route, but its use in quantum finite element analysis is limited by the decomposition of nonunitary matrices, barren plateaus, and the measurement cost of expectation values. We propose a voxel-based block variational quantum linear solver (Voxel-BVQLS) that combines structured matrix decomposition, the principle of minimum potential energy, and batched quantum tests. First, we construct an LCU decomposition of the stiffness matrix from the recursive block-banded structure of voxel-grid finite element matrices, with the number of unitary terms bounded independently of the problem size. Second, we optimize the ansatz parameters using a minimum-potential-energy objective in place of a conventional VQLS loss function, thereby mitigating barren plateaus in the studied problems. Third, we introduce a block-Hadamard test whose circuit directly estimates weighted sums of multiple inner products, reducing the number of circuit configurations required per iteration. We assessed the proposed method in noiseless classical simulations using three examples. These examples show that the method reduces both the number of unitary terms in the LCU decomposition and the number of iterations required to converge, while still yielding solutions of finite accuracy. Voxel-BVQLS thus provides a structured hybrid quantum-classical framework for quantum finite element analysis on regular grids.
The finite element method (FEM) is a cornerstone numerical technique for solving partial differential equations (PDEs). Here, we present Qu-FEM, a fault-tolerant era quantum algorithm for the finite element method. In contrast to other quantum PDE solvers, Qu-FEM preserves the geometric flexibility of FEM by introducing two new primitives, the unit of interaction and the local-to-global indicator matrix, which enable the assembly of global finite element arrays with a constant-size linear combination of unitaries. We study the modified Poisson equation as an elliptic problem of interest, and provide explicit circuits for Qu-FEM in Cartesian domains. For problems with constant coefficients, our algorithm admits block-encodings of global arrays that require only O~(d2p2n) Clifford+T gates for d-dimensional, order-p tensor product elements on grids with 2n degrees of freedom in each dimension, where n is the number of qubits representing the N=2n discrete grid points. For problems with spatially varying coefficients, we perform numerical integration directly on the quantum computer to assemble global arrays and force vectors. Dirichlet boundary conditions are enforced via the method of Lagrange multipliers, eliminating the need to modify the block-encodings that emerge from the assembly procedure. This work presents a framework for extending the geometric flexibility of quantum PDE solvers while preserving the possibility of a quantum advantage.
Quantum computing (QC) represents an emerging frontier with significant potential for transformative advancements in Computational Fluid Dynamics (CFD). This potential has been explicitly recognized by the CFD Vision 2030 report, emphasizing the strategic importance of exploring QC for future breakthroughs. Among quantum algorithms relevant to CFD, the Variational Quantum Linear Solver (VQLS) is particularly promising due to its suitability for solving linear and Hamiltonian-based problems, characteristic of fundamental CFD equations such as the pressure-Poisson equation. However, the practical implementation of VQLS for large-scale CFD problems faces critical scalability challenges, most notably the exponential increase in the number of quantum circuit evaluations and the barren plateau phenomenon, which severely hampers trainability and algorithm convergence. In this study, two novel strategies are introduced to address these challenges. First, we utilize a block encoding technique based on efficient oracles, thereby significantly reducing quantum circuit complexity and qubit overhead while accessing system matrix. Second, we incorporate a quantum-inspired evolutionary optimization (QIEO) approach, demonstrating enhanced training efficiency and effectively mitigating the barren plateau issue. These improvements are integrated within a Hybrid Quantum-Classical Method (HQCM) linear solver framework and demonstrated through solving a 2D steady-state heat equation, representative of the pressure-Poisson equations common in incompressible CFD simulations. The proposed methodologies yield promising results, showcasing improved circuit efficiency, enhanced stability during optimization, and accurate numerical solutions. This work lays a foundational step toward realizing practical, scalable quantum-assisted CFD solvers and sets clear pathways for future research aimed at further algorithmic and architectural enhancements.
Quantum linear system algorithms offer theoretical potential for solving large sparse systems from PDE discretizations. However, applying them directly to fine-scale problems remains impractical on near-term hardware because of limited qubits, restricted circuit depth, and noise. They also prepare a quantum state rather than solution coefficients, whose recovery requires measurement and reconstruction. In this work, we develop a hybrid quantum-classical coarse-to-fine finite element framework for heterogeneous Darcy flow. We investigate whether a measured quantum coarse solution improves fine-grid initialization and reduces subsequent classical solver work. Rather than solve the full fine-scale system on a quantum device, we apply a method inspired by the Variational Quantum Linear Solver (VQLS) to the Galerkin coarse system. We reconstruct the approximate coarse solution from measurements, prolongate it to the fine grid, and use it to initialize a classical preconditioned iterative solve.} Numerical experiments on steady heterogeneous Darcy flow and a time-dependent SPE10-based problem show that measured quantum coarse solutions can improve fine-grid initialization, while classical correction recovers accurate pressure fields. The effect on classical solver iterations depends on the problem. All quantum computations were simulated using Qiskit Aer.