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

Finite-Element Electromagnetic Analysis and Evaluation of Antenna Performance Metrics Using a Quantum Linear System Solver

Hiroaki Ominato, Takahiro Ohyama, Shiro Kawabata

quant-phcs.CESubmitted Oct 28, 2026• Announced Oct 29, 2026• 0 citations
arXivHTMLPDF

Abstract

Electromagnetic analysis based on the finite element method is widely used in antenna design. At higher frequencies, however, the required mesh refinement makes solving large sparse linear systems the main contributor to computational cost. Quantum linear system solvers offer a potential means of accelerating this step, but their output is a superposition state: reconstructing all components of the classical solution vector would forfeit the quantum speedup. Prior studies have proposed methods for obtaining physical quantities such as scattering cross sections and scattering parameters from the solution state. To support antenna design using fault-tolerant quantum computers, we formulate the total radiated power, the radiated power within a prescribed solid angle, and the dielectric and conductive losses as observables for efficient evaluation from a quantum solution state. These observables avoid the measurement cost of reconstructing all components of the output quantum state. We develop an end-to-end hybrid quantum--classical workflow that combines finite-element electromagnetic analysis, matrix preconditioning, a quantum linear system solver, and the evaluation of antenna design metrics. To validate the workflow, we performed numerical experiments evaluating these observables for an axisymmetric coaxially fed monopole antenna. Under idealized conditions, the relative errors in the total radiated power and the dissipated power with respect to the classical finite-element solution were on the order of $10^{-3}$, confirming the consistency of the workflow. The proposed method is expected to provide a basis for using quantum linear system solvers to evaluate antenna performance and, in the future, to design high-frequency wireless devices.

AI Summary

The paper asks how antenna performance metrics can be extracted from a quantum linear-system solver’s normalized finite-element solution state without reconstructing the full electromagnetic field. It expresses total and solid-angle-restricted radiated power, Huygens-surface power flux, and dielectric and conductive losses as quadratic forms $x^\dagger Qx$. Radiation observables are constructed from far-field linear functionals; loss observables follow from volume and surface integrals of finite-element basis fields. The workflow combines Ruiz diagonal equilibration, Hermitian embedding of the complex indefinite Maxwell matrix, and HHL-type solution-state preparation. Observables are transformed consistently with preconditioning, and physical power scales are recovered using the solution norm inferred from postselection probability. Validation uses idealized classical simulation for an axisymmetric coaxially fed monopole with 519 complex degrees of freedom. Equilibration reduces the condition number from $6.16\times10^5$ to $9.34\times10^3$; the simulation uses 14 phase qubits and has postselection probability $1.29\times10^{-5}$ at the reference frequency. Relative errors against the classical discrete solution are $0.769\%$ for total radiated power and $0.662\%$ for angular-band power. Across a 21-frequency sweep, radiated-power errors remain below $0.693\%$, and total-loss errors below $0.313\%$. The classical far-field and Huygens-surface powers differ by $6.64\%$, requiring electromagnetic convergence studies. Finite-shot estimation, gate-synthesis precision, fault-tolerant resources, and end-to-end complexity are not evaluated. Observable formulation alone does not establish efficient measurement or quantum advantage; matrix access, state preparation, preconditioning, spectral bounds, and readout costs remain to be assessed.

Little sign of AI-generated textIncrementalSmall numerics onlyStrong assumptions

Central claim may not hold: The abstract claims efficient evaluation of antenna observables, but the paper establishes quadratic-form representations and ideal-simulator consistency without an efficient quantum measurement construction or end-to-end complexity bound.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
10 pages, 5 figures

Related papers

Recent Advances in Quantum Computing Method Based on FEM for Microwave Components

Xiaolong Li, Feng Feng, Jingyi Feng +1 more

This paper reviews two recent advances in applying quantum computing to solve finite element method (FEM) equations for microwave components. Existing quantum algorithms, such as the Harrow-Hassidim-Lloyd (HHL) algorithm, offer exponential speedup for linear systems but face significant challenges in electromagnetic (EM) simulations. These challenges include the high cost of quantum state preparation, ill-conditioned system matrices, and the inability to directly extract scattering parameters (S-parameters) due to the loss of phase information in quantum measurements. In this paper, two novel approaches are introduced to address these issues. The first approach is an efficient quantum state preparation and preconditioning framework. A systematic method has been developed for preparing quantum states that represent the right-hand side (RHS) vectors in finite element equations for EM problems. This method reduces the gate count by exploiting the sparsity of excitation vectors and improves matrix conditions using sparse approximate inverse (SPAI). The second approach is a quantum method for calculating multiport S-parameter magnitudes, which utilizes an integrated quantum circuit and a specific matrix-scaling technique to compute S-parameters without explicit phase information. Both approaches are validated through application examples, demonstrating the potential of quantum computing for solving complex EM problems.

IEEE International Conference on Radio Frequency and Antenna Technologies (RFAT)•May 1, 2026•0 citations

Quantum Computing Method for Fast Frequency Sweep of Electromagnetic Problems Based on Krylov Subspace and Finite Element Method

Xiaolong Li, J. Z. Han, Runqing Zhang +8 more

Recent advancements in hybrid quantum-classical algorithms (HQAs) have demonstrated significant potential for solving large-scale electromagnetic (EM) problems based on the finite element method (FEM). However, existing quantum EM solvers are fundamentally restricted to discrete, point-by-point frequency evaluations. For broadband microwave component design, executing iterative quantum circuit optimizations at each sampled frequency imposes a substantial computational overhead, limiting the practical applicability of broadband quantum EM simulation. To overcome this limitation, we propose a hybrid quantum-classical Krylov subspace projection (HQKSP) method for the fast frequency sweep of FEM-based EM simulations. Instead of repetitive quantum evaluations across the entire frequency band, the proposed method constructs a reduced-order model by generating a set of basis vectors that span a Krylov subspace at a single expansion frequency. To mitigate the quantum circuit depth limitations associated with strict second-order moment matching, we introduce a hardware-efficient recursive strategy to sequentially generate the basis vectors, bypassing the need for deep linear combinations of unitaries (LCUs). A quantum postprocessing mechanism is then developed to track and compensate for the accumulated relative phase offsets, restoring the phase coherence of the subspace. Subsequently, a direct quantum Galerkin projection is employed to compress the massive FEM system matrices into a low-dimensional space. Because the reduced matrix elements are evaluated only once at the expansion point, the quantum projection overhead is independent of the frequency sweep density. Therefore, the proposed HQKSP method enables the accurate extraction of complex-valued S-parameters while offering a potential reduction in frequency-dependent quantum computational overhead for broadband EM simulations. Numerical experiments on microwave components demonstrate that the proposed HQKSP method achieves the fast frequency sweep via quantum evaluations and classical postprocessing, maintaining close agreement with classical full-wave simulations.

IEEE Transactions on Microwave Theory and Techniques•Jan 1, 2026•0 citations

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 +1 more

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.

quant-pharXiv:2512.03808•Dec 4, 2025•0 citations

End-to-end performance of quantum-accelerated large-scale linear algebra workflows

Daiwei Zhu, Miguel Angel Lopez-Ruiz, François-Henry Rouet +5 more

Solving large-scale sparse linear systems is a challenging computational task due to the introduction of non-zero elements, or "fill-in". The Graph Partitioning Problem (GPP) arises naturally when minimizing fill-in and accelerating solvers. In this paper, we measure the end-to-end performance of a hybrid quantum-classical framework designed to accelerate Finite Element Analysis (FEA) by integrating a quantum solver for GPP into Synopsys/Ansys' LS-DYNA multiphysics simulation software. The quantum solver we use is based on Iterative-QAOA, a scalable, non-variational quantum approach for optimization. We focus on two specific classes of FEA problems, namely vibrational (eigenmode) analysis and transient simulation. We report numerical simulations on up to 150 qubits done on NVIDIA's CUDA-Q/cuTensorNet and implementation on IonQ's Forte quantum hardware. The potential impact on LS-DYNA workflows is quantified by measuring the wall-clock time-to-solution for complex problem instances, including vibrational analysis of large finite element models of a sedan car and a Rolls-Royce jet engine, as well as transient simulations of a drill and an impeller. We performed end-to-end performance measurements on meshes comprising up to 35 million elements. Measurements were conducted using LS-DYNA in distributed-memory mode via Message Passing Interface (MPI) on AWS and Synopsys compute clusters. Our findings indicate that with a quantum computer in the loop, amortized LS-DYNA wall-clock time can be improved by up to 14.6% for specific cases and by at least 5.9% for all models considered. These results highlight the significant potential of quantum computing to reduce time-to-solution for large-scale FEA simulations within the Noisy Intermediate-Scale Quantum (NISQ) era, offering an approach that is scalable and extendable into the fault-tolerant quantum computing regime.

quant-pharXiv:2603.15515•Mar 17, 2026•1 citation

Quantum Method of Calculating Multiport S-Parameter Magnitudes Based on FEM for Microwave Components: An HHL Framework

Xiaolong Li, Feng Feng, Jiali Zhang +5 more

Quantum computing in the electromagnetic (EM) field represents a transformative frontier with significant potential for advancement. Recent studies have demonstrated the potential of quantum computing for solving waveguide mode problems, solving finite element method (FEM) equations for EM problems, and scaling the FEM solution. Among these applications, the Harrow–Hassidim–Lloyd (HHL) algorithm is an algorithm with large quantum advantages and has attracted attention. However, existing quantum methods remain constrained by the problem that the quantum-based FEM solution only obtains electric field magnitude and lacks phase information. The lack of phase information results in the inability to solve an important characteristic of EM problems: scattering parameters (S-parameters). To address the above issue, this work proposes a novel quantum method of calculating multiport S-parameter magnitudes based on FEM and HHL algorithm for microwave components. The proposed method introduces novel mathematical formulations optimized for quantum architectures. To streamline the quantum computation process and avoid the need for multiple quantum circuit simulations for each S-parameter, we design an integrated quantum circuit capable of computing magnitudes of all multiport S-parameters within a single execution. Furthermore, a specific matrix-scaling method is also developed to simplify the proposed circuits. The specific matrix-scaling method is used to improve the condition of the FEM matrix and reduce the complexity of the designed quantum circuits. The proposed method is validated using two microwave structures, demonstrating how our proposed quantum method computes S-parameter magnitudes in practical EM applications.

IEEE Transactions on Microwave Theory and Techniques•Nov 5, 2025•5 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
Electromagnetic analysis based on the finite element method is widely used in antenna design. At higher frequencies, however, the required mesh refinement makes solving large sparse linear systems the main contributor to computational cost. Quantum linear system solvers offer a potential means of accelerating this step, but their output is a superposition state: reconstructing all components of the classical solution vector would forfeit the quantum speedup. Prior studies have proposed methods for obtaining physical quantities such as scattering cross sections and scattering parameters from the solution state. To support antenna design using fault-tolerant quantum computers, we formulate the total radiated power, the radiated power within a prescribed solid angle, and the dielectric and conductive losses as observables for efficient evaluation from a quantum solution state. These observables avoid the measurement cost of reconstructing all components of the output quantum state. We develop an end-to-end hybrid quantum--classical workflow that combines finite-element electromagnetic analysis, matrix preconditioning, a quantum linear system solver, and the evaluation of antenna design metrics. To validate the workflow, we performed numerical experiments evaluating these observables for an axisymmetric coaxially fed monopole antenna. Under idealized conditions, the relative errors in the total radiated power and the dissipated power with respect to the classical finite-element solution were on the order of 10−310^{-3}10−3, confirming the consistency of the workflow. The proposed method is expected to provide a basis for using quantum linear system solvers to evaluate antenna performance and, in the future, to design high-frequency wireless devices.
The paper asks how antenna performance metrics can be extracted from a quantum linear-system solver’s normalized finite-element solution state without reconstructing the full electromagnetic field. It expresses total and solid-angle-restricted radiated power, Huygens-surface power flux, and dielectric and conductive losses as quadratic forms x†Qxx^\dagger Qxx†Qx. Radiation observables are constructed from far-field linear functionals; loss observables follow from volume and surface integrals of finite-element basis fields.
The workflow combines Ruiz diagonal equilibration, Hermitian embedding of the complex indefinite Maxwell matrix, and HHL-type solution-state preparation. Observables are transformed consistently with preconditioning, and physical power scales are recovered using the solution norm inferred from postselection probability. Validation uses idealized classical simulation for an axisymmetric coaxially fed monopole with 519 complex degrees of freedom. Equilibration reduces the condition number from 6.16×1056.16\times10^56.16×105 to 9.34×1039.34\times10^39.34×103; the simulation uses 14 phase qubits and has postselection probability 1.29×10−51.29\times10^{-5}1.29×10−5 at the reference frequency. Relative errors against the classical discrete solution are 0.769%0.769\%0.769% for total radiated power and 0.662%0.662\%0.662% for angular-band power. Across a 21-frequency sweep, radiated-power errors remain below 0.693%0.693\%0.693%, and total-loss errors below 0.313%0.313\%0.313%.
The classical far-field and Huygens-surface powers differ by 6.64%6.64\%6.64%, requiring electromagnetic convergence studies. Finite-shot estimation, gate-synthesis precision, fault-tolerant resources, and end-to-end complexity are not evaluated. Observable formulation alone does not establish efficient measurement or quantum advantage; matrix access, state preparation, preconditioning, spectral bounds, and readout costs remain to be assessed.
This paper reviews two recent advances in applying quantum computing to solve finite element method (FEM) equations for microwave components. Existing quantum algorithms, such as the Harrow-Hassidim-Lloyd (HHL) algorithm, offer exponential speedup for linear systems but face significant challenges in electromagnetic (EM) simulations. These challenges include the high cost of quantum state preparation, ill-conditioned system matrices, and the inability to directly extract scattering parameters (S-parameters) due to the loss of phase information in quantum measurements. In this paper, two novel approaches are introduced to address these issues. The first approach is an efficient quantum state preparation and preconditioning framework. A systematic method has been developed for preparing quantum states that represent the right-hand side (RHS) vectors in finite element equations for EM problems. This method reduces the gate count by exploiting the sparsity of excitation vectors and improves matrix conditions using sparse approximate inverse (SPAI). The second approach is a quantum method for calculating multiport S-parameter magnitudes, which utilizes an integrated quantum circuit and a specific matrix-scaling technique to compute S-parameters without explicit phase information. Both approaches are validated through application examples, demonstrating the potential of quantum computing for solving complex EM problems.
Recent advancements in hybrid quantum-classical algorithms (HQAs) have demonstrated significant potential for solving large-scale electromagnetic (EM) problems based on the finite element method (FEM). However, existing quantum EM solvers are fundamentally restricted to discrete, point-by-point frequency evaluations. For broadband microwave component design, executing iterative quantum circuit optimizations at each sampled frequency imposes a substantial computational overhead, limiting the practical applicability of broadband quantum EM simulation. To overcome this limitation, we propose a hybrid quantum-classical Krylov subspace projection (HQKSP) method for the fast frequency sweep of FEM-based EM simulations. Instead of repetitive quantum evaluations across the entire frequency band, the proposed method constructs a reduced-order model by generating a set of basis vectors that span a Krylov subspace at a single expansion frequency. To mitigate the quantum circuit depth limitations associated with strict second-order moment matching, we introduce a hardware-efficient recursive strategy to sequentially generate the basis vectors, bypassing the need for deep linear combinations of unitaries (LCUs). A quantum postprocessing mechanism is then developed to track and compensate for the accumulated relative phase offsets, restoring the phase coherence of the subspace. Subsequently, a direct quantum Galerkin projection is employed to compress the massive FEM system matrices into a low-dimensional space. Because the reduced matrix elements are evaluated only once at the expansion point, the quantum projection overhead is independent of the frequency sweep density. Therefore, the proposed HQKSP method enables the accurate extraction of complex-valued S-parameters while offering a potential reduction in frequency-dependent quantum computational overhead for broadband EM simulations. Numerical experiments on microwave components demonstrate that the proposed HQKSP method achieves the fast frequency sweep via quantum evaluations and classical postprocessing, maintaining close agreement with classical full-wave simulations.
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.
Solving large-scale sparse linear systems is a challenging computational task due to the introduction of non-zero elements, or "fill-in". The Graph Partitioning Problem (GPP) arises naturally when minimizing fill-in and accelerating solvers. In this paper, we measure the end-to-end performance of a hybrid quantum-classical framework designed to accelerate Finite Element Analysis (FEA) by integrating a quantum solver for GPP into Synopsys/Ansys' LS-DYNA multiphysics simulation software. The quantum solver we use is based on Iterative-QAOA, a scalable, non-variational quantum approach for optimization. We focus on two specific classes of FEA problems, namely vibrational (eigenmode) analysis and transient simulation. We report numerical simulations on up to 150 qubits done on NVIDIA's CUDA-Q/cuTensorNet and implementation on IonQ's Forte quantum hardware. The potential impact on LS-DYNA workflows is quantified by measuring the wall-clock time-to-solution for complex problem instances, including vibrational analysis of large finite element models of a sedan car and a Rolls-Royce jet engine, as well as transient simulations of a drill and an impeller. We performed end-to-end performance measurements on meshes comprising up to 35 million elements. Measurements were conducted using LS-DYNA in distributed-memory mode via Message Passing Interface (MPI) on AWS and Synopsys compute clusters. Our findings indicate that with a quantum computer in the loop, amortized LS-DYNA wall-clock time can be improved by up to 14.6% for specific cases and by at least 5.9% for all models considered. These results highlight the significant potential of quantum computing to reduce time-to-solution for large-scale FEA simulations within the Noisy Intermediate-Scale Quantum (NISQ) era, offering an approach that is scalable and extendable into the fault-tolerant quantum computing regime.
Quantum computing in the electromagnetic (EM) field represents a transformative frontier with significant potential for advancement. Recent studies have demonstrated the potential of quantum computing for solving waveguide mode problems, solving finite element method (FEM) equations for EM problems, and scaling the FEM solution. Among these applications, the Harrow–Hassidim–Lloyd (HHL) algorithm is an algorithm with large quantum advantages and has attracted attention. However, existing quantum methods remain constrained by the problem that the quantum-based FEM solution only obtains electric field magnitude and lacks phase information. The lack of phase information results in the inability to solve an important characteristic of EM problems: scattering parameters (S-parameters). To address the above issue, this work proposes a novel quantum method of calculating multiport S-parameter magnitudes based on FEM and HHL algorithm for microwave components. The proposed method introduces novel mathematical formulations optimized for quantum architectures. To streamline the quantum computation process and avoid the need for multiple quantum circuit simulations for each S-parameter, we design an integrated quantum circuit capable of computing magnitudes of all multiport S-parameters within a single execution. Furthermore, a specific matrix-scaling method is also developed to simplify the proposed circuits. The specific matrix-scaling method is used to improve the condition of the FEM matrix and reduce the complexity of the designed quantum circuits. The proposed method is validated using two microwave structures, demonstrating how our proposed quantum method computes S-parameter magnitudes in practical EM applications.
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.