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

arXiv:2504.01646 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Adaptive Mesh Refinement Quantum Algorithm for Maxwell's Equations

Élise Fressart, Michel Nowak, Nicole Spillane

Published Aug 30, 2025• 0 citations
arXivHTMLPDF

Abstract

Algorithms that promise to leverage resources of quantum computers efficiently to accelerate the finite element method have emerged. However, the finite element method is usually incorporated into a high-level numerical scheme which allows the adaptive refinement of the mesh on which the solution is approximated. In this work, we propose to extend adaptive mesh refinement to the quantum formalism, and apply our method to the solution of Maxwell's equations. An important step in this procedure is the computation of error estimators, which guide the refinement. By using block-encoding, we propose a way to compute these estimators with quantum circuits. We present first numerical experiments on a 2D geometry.

DOI
10.1109/qce65121.2025.00043

Related papers

Quantum-assisted hλ-adaptive finite element method

R. H. Drebotiy, H. А. Shynkarenko

Quantum computing is a rapidly advancing field, driven by the potential advantages derived from the unique properties of quantum entanglement. In particular, the exponential speedup of certain carefully designed algorithms, compared to their classical counterparts, promises to significantly enhance the numerical solution of a wide range of problems. This paper investigates the integration of quantum computing with the finite element method, focusing on singularly perturbed advection-diffusion-reaction problems. We introduce a novel finite element scheme that combines classical and quantum algorithms. In this approach, the primary mesh adaptation loop is managed by a classical computer, while a specific stabilization procedure is executed on a quantum computer. This procedure leverages the Harrow-Hassidim-Lloyd algorithm in conjunction with the swap test to estimate the value of a linear functional, which constitutes a substantial portion of the computational workload. We demonstrate that this hybrid approach effectively eliminates parasitic oscillations in the finite element approximation, even at the early stages of the adaptation process. This leads to a significant improvement in the quality of intermediate finite element solutions. As a result, our scheme offers more efficient feedback with reduced computational costs for researchers using the method to investigate physical phenomena. To support the scheme, we prove special explicit a posteriori error estimates. Possible benefits of the proposed finite element scheme are analyzed using the numerical comparison with the typical adaptive scheme.

arXiv:2411.12687•Partial Differential Equations in Applied Mathematics•Feb 7, 2025•1 citation

Quantum Simulation of Complex Fluid Dynamics with Adaptive Mesh Refinement

Jincheng Zhang

This paper presents a novel quantum simulation framework designed to address challenges in fluid dynamics simulation, specifically focusing on achieving high accuracy and efficiency. The core innovation lies in the implementation of an Adaptive Mesh Refinement (AMR) technique, which dynamically adjusts the mesh density based on the complexity of the flow field. This mechanism ensures optimal computational resources are utilized, leading to improved simulation performance compared to traditional, static mesh approaches. The theoretical foundations of the proposed method are established through a rigorous analysis of the flow dynamics involved. The paper details the architecture of the simulation, the implementation of the AMR algorithm, and the validation of the framework using a series of challenging fluid dynamics problems. The results demonstrate a significant improvement in accuracy and computational efficiency compared to existing methods, highlighting the potential of this approach for advanced fluid dynamics modeling.

•Aug 31, 2026•0 citations

Quantum Method for Finite Element Simulation of Electromagnetic Problems

Jianan Zhang, Feng Feng, Qi‐Jun Zhang

Quantum simulation of electromagnetic (EM) structures is still in its infancy. In this paper, we investigate the possibility of applying quantum computing to solve the finite element equations for EM problems. Specifically, we propose to leverage a milestone in quantum computing, i.e., the Harrow/Hassidim/Lloyd (HHL) algorithm, to solve the finite element equations in the EM domain. To do this, we first present a systematic method to reformulate the finite element equations into quantum computation format and apply the HHL algorithm to solve the new equations. Taking advantage of the special properties of finite element matrices in EM problems, we then devise a stepwise algorithm to efficiently determine the suitable values for the hyperparameters of HHL. The proposed method can in theory solve the EM finite element equations in logarithmic time relative to the size of the finite element matrix. This is exponentially faster than that achievable by classical computation as the matrix size increases. A two-dimensional EM example is used to illustrate how the proposed method can be used to find the solutions to EM problems through quantum computation.

IEEE MTT-S International Microwave Symposium digest•Jun 7, 2021•16 citations

Title: Adaptive Quantum Error Correction with Dynamic Resource Allocation

Jincheng Zhang

Quantum computing holds immense promise for revolutionary advancements across numerous fields, but the inherent fragility of quantum information necessitates sophisticated error correction techniques. Current quantum error correction methods often rely on computationally intensive overhead, limiting scalability. This paper proposes an adaptive quantum error correction scheme that dynamically allocates resources to different parts of the quantum circuit based on the observed error rate. We introduce a novel resource-aware algorithm that adjusts the amount of error correction applied to each qubit based on its current error state, aiming to significantly improve error correction efficiency and reduce the overall complexity of quantum computations. This work addresses a critical challenge in quantum computing – the need for efficient error correction – with a mechanism for adaptive resource allocation. The proposed algorithm demonstrates substantial improvements in error correction performance compared to existing approaches in initial simulations and preliminary experiments. We conclude with a discussion of the potential implications of this approach for future quantum systems.

•Sep 2, 2026•0 citations

Quantum Computing Method to Solve the Finite Element Equation in EM Problems

Tian Jian Peng, Jianan Zhang, Jian Wei You +1 more

Quantum computing, or quantum computation, has garnered increasing attention within the computational community in recent years, owing to its remarkable efficacy in addressing large-scale problems. In specific scenarios, quantum algorithms exhibit exponential enhancements over their classical counterparts executed on classical computing platforms. Quantum computing introduces myriad opportunities for simulating intricate physical systems, including but not limited to electromagnetic (EM) structures. Despite the extensive research devoted to quantum computing in contemporary literature, the exploration of quantum simulation techniques for EM structures remains relatively limited. In this paper, we will describe a quantum computing method for solving EM problems through finite element equations. The performance of this method will be verified by an EM example.

Photonics & Electromagnetics Research Symposium (PIERS)•Apr 21, 2024•1 citation

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
Algorithms that promise to leverage resources of quantum computers efficiently to accelerate the finite element method have emerged. However, the finite element method is usually incorporated into a high-level numerical scheme which allows the adaptive refinement of the mesh on which the solution is approximated. In this work, we propose to extend adaptive mesh refinement to the quantum formalism, and apply our method to the solution of Maxwell's equations. An important step in this procedure is the computation of error estimators, which guide the refinement. By using block-encoding, we propose a way to compute these estimators with quantum circuits. We present first numerical experiments on a 2D geometry.
Quantum computing is a rapidly advancing field, driven by the potential advantages derived from the unique properties of quantum entanglement. In particular, the exponential speedup of certain carefully designed algorithms, compared to their classical counterparts, promises to significantly enhance the numerical solution of a wide range of problems. This paper investigates the integration of quantum computing with the finite element method, focusing on singularly perturbed advection-diffusion-reaction problems. We introduce a novel finite element scheme that combines classical and quantum algorithms. In this approach, the primary mesh adaptation loop is managed by a classical computer, while a specific stabilization procedure is executed on a quantum computer. This procedure leverages the Harrow-Hassidim-Lloyd algorithm in conjunction with the swap test to estimate the value of a linear functional, which constitutes a substantial portion of the computational workload. We demonstrate that this hybrid approach effectively eliminates parasitic oscillations in the finite element approximation, even at the early stages of the adaptation process. This leads to a significant improvement in the quality of intermediate finite element solutions. As a result, our scheme offers more efficient feedback with reduced computational costs for researchers using the method to investigate physical phenomena. To support the scheme, we prove special explicit a posteriori error estimates. Possible benefits of the proposed finite element scheme are analyzed using the numerical comparison with the typical adaptive scheme.
This paper presents a novel quantum simulation framework designed to address challenges in fluid dynamics simulation, specifically focusing on achieving high accuracy and efficiency. The core innovation lies in the implementation of an Adaptive Mesh Refinement (AMR) technique, which dynamically adjusts the mesh density based on the complexity of the flow field. This mechanism ensures optimal computational resources are utilized, leading to improved simulation performance compared to traditional, static mesh approaches. The theoretical foundations of the proposed method are established through a rigorous analysis of the flow dynamics involved. The paper details the architecture of the simulation, the implementation of the AMR algorithm, and the validation of the framework using a series of challenging fluid dynamics problems. The results demonstrate a significant improvement in accuracy and computational efficiency compared to existing methods, highlighting the potential of this approach for advanced fluid dynamics modeling.
Quantum simulation of electromagnetic (EM) structures is still in its infancy. In this paper, we investigate the possibility of applying quantum computing to solve the finite element equations for EM problems. Specifically, we propose to leverage a milestone in quantum computing, i.e., the Harrow/Hassidim/Lloyd (HHL) algorithm, to solve the finite element equations in the EM domain. To do this, we first present a systematic method to reformulate the finite element equations into quantum computation format and apply the HHL algorithm to solve the new equations. Taking advantage of the special properties of finite element matrices in EM problems, we then devise a stepwise algorithm to efficiently determine the suitable values for the hyperparameters of HHL. The proposed method can in theory solve the EM finite element equations in logarithmic time relative to the size of the finite element matrix. This is exponentially faster than that achievable by classical computation as the matrix size increases. A two-dimensional EM example is used to illustrate how the proposed method can be used to find the solutions to EM problems through quantum computation.
Quantum computing holds immense promise for revolutionary advancements across numerous fields, but the inherent fragility of quantum information necessitates sophisticated error correction techniques. Current quantum error correction methods often rely on computationally intensive overhead, limiting scalability. This paper proposes an adaptive quantum error correction scheme that dynamically allocates resources to different parts of the quantum circuit based on the observed error rate. We introduce a novel resource-aware algorithm that adjusts the amount of error correction applied to each qubit based on its current error state, aiming to significantly improve error correction efficiency and reduce the overall complexity of quantum computations. This work addresses a critical challenge in quantum computing – the need for efficient error correction – with a mechanism for adaptive resource allocation. The proposed algorithm demonstrates substantial improvements in error correction performance compared to existing approaches in initial simulations and preliminary experiments. We conclude with a discussion of the potential implications of this approach for future quantum systems.
Quantum computing, or quantum computation, has garnered increasing attention within the computational community in recent years, owing to its remarkable efficacy in addressing large-scale problems. In specific scenarios, quantum algorithms exhibit exponential enhancements over their classical counterparts executed on classical computing platforms. Quantum computing introduces myriad opportunities for simulating intricate physical systems, including but not limited to electromagnetic (EM) structures. Despite the extensive research devoted to quantum computing in contemporary literature, the exploration of quantum simulation techniques for EM structures remains relatively limited. In this paper, we will describe a quantum computing method for solving EM problems through finite element equations. The performance of this method will be verified by an EM example.
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.