IQFEM: A quantum finite element method for heterogeneous problems with immersed boundaries
Abstract
Quantum computing offers the potential to solve computational mechanics problems with a more favourable complexity scaling than classically possible. To realise this potential, a quantum-compatible formulation of the finite element method is essential. We present such a formulation for Poisson problems with spatially varying coefficients on general domains discretised by an immersed uniform Cartesian grid. The resulting banded sparse system matrices are encoded as the sum of diagonal matrices with polynomial entries and their products with shift matrices. The sum of the matrices is formed using the linear combination of unitaries (LCU) technique. The resulting block-encoded system matrix can be implemented using a polylogarithmic number of elementary gates. For immersed boundaries, the block-encoded system matrix is further processed using a diagonal indicator matrix with zeros and ones. The indicator matrix is defined in terms of an integer-valued level-set function composed of simple geometric primitives via Boolean set operations. The required integer operations are computed on the fly using quantum arithmetic. The resulting block-encoded linear system of equations is solved using quantum singular value transformation (QSVT). The overall gate count, including the QSVT, is O(Ntot2/d polylog(Ntot)), where d is the problem dimension and Ntot the number of grid points. In numerical examples that confirm the theoretical complexity estimates, the solutions converge approximately linearly for immersed problems and quadratically for simply connected domains.
Related
- Frequency-explicit convergence analysis of a multiscale finite element method for highly heterogeneous scattering problems
- A structure-aware construction of quantum BPX preconditioners for Q1 finite element discretizations of reaction-diffusion problems
- An Immersed Interface Method for Parabolic Interface Problems with Nonlinear Jump Conditions
- A Structural Relationship Between Crouzeix-Raviart Immersed Finite Elements for Elliptic and Stokes Interface Problems
- Formation of grain boundaries in ductile single crystals under plane-strain simple shear: a block-coordinate finite element method
BibTeX
@misc{perera2026iqfem,
title = {{IQFEM: A quantum finite element method for heterogeneous problems with immersed boundaries}},
author = {Shehara Perera and Yiren Wang and Fehmi Cirak},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.14077},
eprint = {2609.14077},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.14077},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - IQFEM: A quantum finite element method for heterogeneous problems with immersed boundaries
AU - Shehara Perera
AU - Yiren Wang
AU - Fehmi Cirak
PY - 2026
DA - 2026/09/12
PB - arXiv
DO - 10.48550/arxiv.2609.14077
UR - https://arxiv.org/abs/2609.14077
AB - Quantum computing offers the potential to solve computational mechanics problems with a more favourable complexity scaling than classically possible. To realise this potential, a quantum-compatible formulation of the finite element method is essential. We present such a formulation for Poisson problems with spatially varying coefficients on general domains discretised by an immersed uniform Cartesian grid. The resulting banded sparse system matrices are encoded as the sum of diagonal matrices with polynomial entries and their products with shift matrices. The sum of the matrices is formed using the linear combination of unitaries (LCU) technique. The resulting block-encoded system matrix can be implemented using a polylogarithmic number of elementary gates. For immersed boundaries, the block-encoded system matrix is further processed using a diagonal indicator matrix with zeros and ones. The indicator matrix is defined in terms of an integer-valued level-set function composed of simple geometric primitives via Boolean set operations. The required integer operations are computed on the fly using quantum arithmetic. The resulting block-encoded linear system of equations is solved using quantum singular value transformation (QSVT). The overall gate count, including the QSVT, is O(N_tot^2/d polylog(N_tot)), where d is the problem dimension and N_tot the number of grid points. In numerical examples that confirm the theoretical complexity estimates, the solutions converge approximately linearly for immersed problems and quadratically for simply connected domains.
ER -