Metraipolis › archive › dc_d5bd18deb4f1
IQFEM: A quantum finite element method for heterogeneous problems with immersed boundaries — arXiv:2609.14077
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14077
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:22:28.481Z
- SHA-256 of the archived text
b02c6932f17a36b63746de5c3b7f32412fd1e257a3feec071c782797fa8555a1- Stable URL of this page
https://metraipolis.com/documento/dc_d5bd18deb4f1
How to cite
IQFEM: A quantum finite element method for heterogeneous problems with immersed boundaries — arXiv:2609.14077 — arXiv (en), https://arxiv.org/abs/2609.14077 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d5bd18deb4f1 (Metraipolis archive dc_d5bd18deb4f1, sha256 b02c6932f17a36b63746de5c3b7f32412fd1e257a3feec071c782797fa8555a1)
BibTeX
@misc{dcd5bd18deb4f1,
title = {IQFEM: A quantum finite element method for heterogeneous problems with immersed boundaries — arXiv:2609.14077},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14077},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d5bd18deb4f1; sha256 b02c6932f17a36b63746de5c3b7f32412fd1e257a3feec071c782797fa8555a1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14077. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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_{\text{tot}}^{2/d} \operatorname{polylog}(N_{\text{tot}}))$, where $d$ is the problem dimension and $N_{\text{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.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.14077 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:39:06.301Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).