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:2512.03808

Solution of the Electric Field Integral Equation Using a Hybrid Quantum-Classical Scheme: Investigation of Accuracy and Efficiency

Rui Chen, Teng-Yang Ma, Meng-Han Dou, Chao-Fu Wang

quant-phmath-phSubmitted Dec 3, 2025• Announced Dec 4, 2025• 0 citations
arXivHTMLPDF

Abstract

Conventional classical solvers are commonly used for solving matrix equation systems resulting from the discretization of SIEs in computational electromagnetics (CEM). However, the memory requirement would become a bottleneck for classical computing as the electromagentic problems become much larger. As an alternative, quantum computing has a natural "parallelization" advantage with much lower storage complexity due to the superposition and entanglement in quantum mechanics. Even though several quantum algorithms have been applied for the SIEs-based methods in the literature, the size of the matrix equation systems solvable using them is still limited. In this work, we use a hybrid quantum-classical scheme to solve the EFIE for analyzing electromagentic scattering from three-dimensional (3D) perfect electrically conducting objects with arbitrary shapes in CEM for the first time. Instead of directly solving the original EFIE matrix equation system using the quantum algorithms, the hybrid scheme first designs the preconditioned linear system and then uses a double-layer iterative strategy for its solution, where the external iteration layer builds subspace matrix equation systems with smaller dimension and the internal iteration layer solves the smaller systems using the quantum algorithms. Two representative quantum algorithms, HHL and VQLS, are considered in this work, which are executed on the quantum simulator and quantum computer platforms. We present the theoretical time complexity analysis of the hybrid quantum-classical scheme and perform numerical experiments to investigate the accuracy and efficiency of the hybrid scheme. The results show that the computational complexity of the hybrid VQLS-classical scheme is lower than the conventional fast solvers in classical computing, which indicates the hybrid scheme is more promising for analyzing large-scale electromagnetic problems.

Comments
6 pages, 6 figures

Related papers

Investigation of Quantum Algorithms for the Solution of EFIE-Based Matrix Equation System for 3D PEC Scatterers

Rui Chen, Teng-Yang Ma, Menghan Dou +1 more

In this work, we investigate the Harrow-Hassidim-Lloyd (HHL) quantum algorithm for the solution of electric field integral equation (EFIE)-based matrix equation system for analyzing electromagnetic scattering from three-dimensional (3D) perfect electrically conducting (PEC) objects. The HHL algorithm is one of the representative quantum algorithms for the solution of linear equation systems. Numerical experiments are presented to investigate the computational cost and accuracy of the HHL algorithm for solving the EFIE matrix equation system executed on the virtual simulator on the classical computers.

Photonics & Electromagnetics Research Symposium - Fall (PIERS-Fall)•Nov 4, 2025•2 citations

On Quantum Solvers for Linear Algebraic Systems

Papagiannis Nikos, Vavalis Manolis

Abstract Solving large-scale linear systems is an integral part of many scientific disciplines. Classical linear solvers have a polynomial time complexity and it seems impossible to further improve their performance. This fact has directed scientific research to the study of corresponding quantum algorithms, which promise even exponential acceleration compared to existing methods. In this paper, we present and analyze some of the most important related results. In particular, we present the HHL and WZP algorithms based on the eigen-decomposition of a matrix, the row and column iteration methods, as well as two hybrid algorithms that require the cooperation of a classical and a quantum computer, namely an algorithm that uses random walks and the VQLS algorithm. The latter is also examined from an experimental standpoint using the Qiskit open-source framework and a suitable quantum circuit is proposed which can enhance its performance.

Quantum Information and Computation•Dec 1, 2025•0 citations

A Hybrid Quantum Solver for the Lorenz System

Sajad Fathi Hafshejani, Daya Ram Gaur, Arundhati Dasgupta +3 more

We develop a hybrid classical-quantum method for solving the Lorenz system. We use the forward Euler method to discretize the system in time, transforming it into a system of equations. This set of equations is solved by using the Variational Quantum Linear Solver (VQLS) algorithm. We present numerical results comparing the hybrid method with the classical approach for solving the Lorenz system. The simulation results demonstrate that the VQLS method can effectively compute solutions comparable to classical methods. The method is easily extended to solving similar nonlinear differential equations.

arXiv:2410.15417•Entropy•Nov 22, 2024•10 citations

Quantum Computing for Industrial Electromagnetics: Applicability and Case Studies in Solving Maxwell's Equations

Francesco Turro, Marco Maronese, Daniele Dragoni

Computational electromagnetics plays a central role in many industrial applications but often requires substantial computational resources, particularly when fine spatial discretizations are needed. While classical approaches remain the standard, quantum computing offers the potential to accelerate large-scale simulations by encoding them with a limited number of qubits. Here, we investigate the performance and resource scaling of the Harrow-Hassidim-Lloyd (HHL) and Quantum Singular Value Transformation (QSVT) algorithms for solving linear systems generated by the finite-difference time-domain (FDTD) method, a widely adopted numerical scheme for discretizing Maxwell's equations. We benchmark their performance across representative industrial use cases, including radar propagation, lens simulations, and beamforming processes. Our results demonstrate the validity of the approaches, achieving state infidelities smaller than $2\cdot 10^{-3}$ with success probabilities greater than $10^{-3}$, compatible with practical quantum state sampling. Overall, we observe that the QSVT method consistently delivers higher accuracy. We further observe that the condition number of the linear matrix, a key factor governing the performance of quantum solvers, saturates as the number of spatial lattice points increases. This implies that the spatial grid can be scaled to realistic industrial dimensions without increasing the HHL or QSVT circuit depth due to ill-conditioned matrices.

quant-pharXiv:2608.10671•Aug 12, 2026•1 citation

A Hybrid Quantum-Classical Coarse-to-Fine Finite Element Solver for Heterogeneous Darcy Flow

Kapil Chawla, Sanghyun Lee, Jonathan Valyou

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.

arXiv:2611.09593•Nov 6, 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
Conventional classical solvers are commonly used for solving matrix equation systems resulting from the discretization of SIEs in computational electromagnetics (CEM). However, the memory requirement would become a bottleneck for classical computing as the electromagentic problems become much larger. As an alternative, quantum computing has a natural "parallelization" advantage with much lower storage complexity due to the superposition and entanglement in quantum mechanics. Even though several quantum algorithms have been applied for the SIEs-based methods in the literature, the size of the matrix equation systems solvable using them is still limited. In this work, we use a hybrid quantum-classical scheme to solve the EFIE for analyzing electromagentic scattering from three-dimensional (3D) perfect electrically conducting objects with arbitrary shapes in CEM for the first time. Instead of directly solving the original EFIE matrix equation system using the quantum algorithms, the hybrid scheme first designs the preconditioned linear system and then uses a double-layer iterative strategy for its solution, where the external iteration layer builds subspace matrix equation systems with smaller dimension and the internal iteration layer solves the smaller systems using the quantum algorithms. Two representative quantum algorithms, HHL and VQLS, are considered in this work, which are executed on the quantum simulator and quantum computer platforms. We present the theoretical time complexity analysis of the hybrid quantum-classical scheme and perform numerical experiments to investigate the accuracy and efficiency of the hybrid scheme. The results show that the computational complexity of the hybrid VQLS-classical scheme is lower than the conventional fast solvers in classical computing, which indicates the hybrid scheme is more promising for analyzing large-scale electromagnetic problems.
In this work, we investigate the Harrow-Hassidim-Lloyd (HHL) quantum algorithm for the solution of electric field integral equation (EFIE)-based matrix equation system for analyzing electromagnetic scattering from three-dimensional (3D) perfect electrically conducting (PEC) objects. The HHL algorithm is one of the representative quantum algorithms for the solution of linear equation systems. Numerical experiments are presented to investigate the computational cost and accuracy of the HHL algorithm for solving the EFIE matrix equation system executed on the virtual simulator on the classical computers.
Abstract Solving large-scale linear systems is an integral part of many scientific disciplines. Classical linear solvers have a polynomial time complexity and it seems impossible to further improve their performance. This fact has directed scientific research to the study of corresponding quantum algorithms, which promise even exponential acceleration compared to existing methods. In this paper, we present and analyze some of the most important related results. In particular, we present the HHL and WZP algorithms based on the eigen-decomposition of a matrix, the row and column iteration methods, as well as two hybrid algorithms that require the cooperation of a classical and a quantum computer, namely an algorithm that uses random walks and the VQLS algorithm. The latter is also examined from an experimental standpoint using the Qiskit open-source framework and a suitable quantum circuit is proposed which can enhance its performance.
We develop a hybrid classical-quantum method for solving the Lorenz system. We use the forward Euler method to discretize the system in time, transforming it into a system of equations. This set of equations is solved by using the Variational Quantum Linear Solver (VQLS) algorithm. We present numerical results comparing the hybrid method with the classical approach for solving the Lorenz system. The simulation results demonstrate that the VQLS method can effectively compute solutions comparable to classical methods. The method is easily extended to solving similar nonlinear differential equations.
Computational electromagnetics plays a central role in many industrial applications but often requires substantial computational resources, particularly when fine spatial discretizations are needed. While classical approaches remain the standard, quantum computing offers the potential to accelerate large-scale simulations by encoding them with a limited number of qubits. Here, we investigate the performance and resource scaling of the Harrow-Hassidim-Lloyd (HHL) and Quantum Singular Value Transformation (QSVT) algorithms for solving linear systems generated by the finite-difference time-domain (FDTD) method, a widely adopted numerical scheme for discretizing Maxwell's equations. We benchmark their performance across representative industrial use cases, including radar propagation, lens simulations, and beamforming processes. Our results demonstrate the validity of the approaches, achieving state infidelities smaller than 2⋅10−32\cdot 10^{-3}2⋅10−3 with success probabilities greater than 10−310^{-3}10−3, compatible with practical quantum state sampling. Overall, we observe that the QSVT method consistently delivers higher accuracy. We further observe that the condition number of the linear matrix, a key factor governing the performance of quantum solvers, saturates as the number of spatial lattice points increases. This implies that the spatial grid can be scaled to realistic industrial dimensions without increasing the HHL or QSVT circuit depth due to ill-conditioned matrices.
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.
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.