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

IEEE Transactions on Sustainable Energy

Towards Conditioning-Wise Quantum Electromagnetic Transient Simulation for Converter-Dominated Systems

Qi Lou, Yijun Xu, Wei Gu, Menghan Dou, Fei Zhang, Yuan Fang, Linping Wu, Li Zimeng

Published Jan 1, 2026• 0 citations
Publisher

Abstract

In converter-dominated power systems, the electromagnetic transient program (EMTP) requires repeatedly solving large-scale linear equations, which is therefore computationally prohibitive. Recently, the Quantum EMTP (QEMTP) has offered the potential for a quantum leap in computational performance. However, it suffers from trainability degradation and hardware limitations. To address these issues, this paper develops a conditioning-wise QEMTP. First, we identify matrix ill-conditioning as a key factor leading to barren plateaus in QEMTP. Accordingly, a topology-aware hybrid preconditioner is tailored to alleviate this phenomenon. Then, to improve sample efficiency, we simplify the cost function and propose a quantum sequential optimizer (QSO) on the preconditioned system. Last, by projecting the QEMTP problem onto a preconditioned Krylov subspace, we remove the need for explicit right-hand-side state preparation and thus reduce the quantum resource demand of QSO. Case studies reveal the excellent performance of the proposed method.

DOI
10.1109/tste.2026.3751404

Related papers

Initialization-Wise Quantum Electromagnetic Transient Program

Qi Lou, Yijun Xu, Wei Gu +1 more

With the increasing penetration of renewable energy sources and power electronic devices, the Electromagnetic Transients Program (EMTP) has become indispensable for modern power system analysis. Classical EMTP faces a conflict between computational efficiency and real-time requirements, while the rapid advancement of quantum computing offers a pathway for a quantum leap. However, existing QEMTP methods suffer from slow convergence, requiring numerous iterations that consume substantial quantum resources and drastically reduce computational efficiency. This paper proposes an initialization-wise QEMTP framework that leverages physics-informed initialization to accelerate convergence. A detailed analysis of the cost function incorporating the Gram–Schmidt procedure guides the selection of initial parameters, while a cross-initialization method—applied in QEMTP for the first time—mitigates switching-induced errors. Simulation results demonstrate the framework’s efficiency, accuracy, and robustness.

IEEE Power Engineering Society General Meeting•Jul 1, 2026•0 citations

Quantum Electromagnetic Transients Program

Yifan Zhou, Fei Feng, Peng Zhang

This letter devises a quantum electromagnetic transients program (QEMTP) which is the first attempt to tackle the computational challenges in solving EMTP through quantum computing. The main contributions lie in: (1) A quantum-enabled EMTP formulation with Dommel's model encoded in quantum states; 2) An Harrow-Hassidim-Lloyd (HHL)-based QEMTP to solve the discrete-time nodal equations; 3) An iteration-based HHL revision for mitigating temporal errors to achieve high accuracy of QEMTP with limited quantum resources. Case studies verify the correctness and efficacy of QEMTP in simulating both fast and slow dynamics.

IEEE Transactions on Power Systems•Mar 18, 2021•36 citations

Matrix Low-Dimensional Qubit Casting Based Quantum Electromagnetic Transient Network Simulation Program

Qi Lou, Yijun Xu, Wei Gu

In modern power systems, the integration of converter-interfaced generations requires the development of electromagnetic transient network simulation programs (EMTP) that can capture rapid fluctuations. However, as the power system scales, the EMTP's computing complexity increases exponentially, leading to a curse of dimensionality that hinders its practical application. Facing this challenge, quantum computing offers a promising approach for achieving exponential acceleration. To realize this in noisy intermediate-scale quantum computers, the variational quantum linear solution (VQLS) was advocated because of its robustness against depolarizing noise. However, it suffers data inflation issues in its preprocessing phase, and no prior research has applied quantum computing to high-frequency switching EMT networks.To address these issues, this paper first designs the matrix low-dimension qubit casting (MLQC) method to address the data inflation problem in the preprocessing of the admittance matrix for VQLS in EMT networks. Besides, we propose a real-only quantum circuit reduction method tailored to the characteristics of the EMT network admittance matrices. Finally, the proposed quantum EMTP algorithm (QEMTP) has been successfully verified for EMT networks containing a large number of high-frequency switching elements.

arXiv:2502.11728•IEEE Transactions on Quantum Engineering•Jan 1, 2026•4 citations

Noisy-Intermediate-Scale Quantum Electromagnetic Transients Program

Yifan Zhou, Peng Zhang, Fei Feng

Quantum-empowered electromagnetic transients program (QEMTP) is a promising paradigm for tackling EMTP’s computational burdens. Nevertheless, no existing studies truly achieve a practical and scalable QEMTP operable on today’s noisy-intermediate-scale quantum (NISQ) computers. The strong reliance on noise-free and fault-tolerant quantum devices–which appears to be decades away– hinder practical applications of current QEMTP methods. This paper devises a NISQ-QEMTP methodology which for the first time transitions the QEMTP operations from ideal, noise-free quantum simulators to real, noisy quantum computers. The main contributions lie in: (1) design of shallow-depth QEMTP quantum circuits for mitigating noises on NISQ quantum devices; (2) practical QEMTP linear solvers incorporating executable quantum state preparation and measurements for nodal voltage computations; (3) a noise-resilient QEMTP algorithm leveraging quantum resources logarithmically scaled with power system dimension; (4) a quantum shifted frequency analysis (QSFA) for accelerating QEMTP by exploiting dynamic phasor simulations with larger time steps; (5) a systematical analysis on QEMTP’s performance under various noisy quantum environments. Extensive experiments systematically verify the accuracy, efficacy, universality and noise-resilience of QEMTP on both noise-free simulators and IBM real quantum computers.

IEEE Transactions on Power Systems•May 5, 2022•29 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

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
In converter-dominated power systems, the electromagnetic transient program (EMTP) requires repeatedly solving large-scale linear equations, which is therefore computationally prohibitive. Recently, the Quantum EMTP (QEMTP) has offered the potential for a quantum leap in computational performance. However, it suffers from trainability degradation and hardware limitations. To address these issues, this paper develops a conditioning-wise QEMTP. First, we identify matrix ill-conditioning as a key factor leading to barren plateaus in QEMTP. Accordingly, a topology-aware hybrid preconditioner is tailored to alleviate this phenomenon. Then, to improve sample efficiency, we simplify the cost function and propose a quantum sequential optimizer (QSO) on the preconditioned system. Last, by projecting the QEMTP problem onto a preconditioned Krylov subspace, we remove the need for explicit right-hand-side state preparation and thus reduce the quantum resource demand of QSO. Case studies reveal the excellent performance of the proposed method.
With the increasing penetration of renewable energy sources and power electronic devices, the Electromagnetic Transients Program (EMTP) has become indispensable for modern power system analysis. Classical EMTP faces a conflict between computational efficiency and real-time requirements, while the rapid advancement of quantum computing offers a pathway for a quantum leap. However, existing QEMTP methods suffer from slow convergence, requiring numerous iterations that consume substantial quantum resources and drastically reduce computational efficiency. This paper proposes an initialization-wise QEMTP framework that leverages physics-informed initialization to accelerate convergence. A detailed analysis of the cost function incorporating the Gram–Schmidt procedure guides the selection of initial parameters, while a cross-initialization method—applied in QEMTP for the first time—mitigates switching-induced errors. Simulation results demonstrate the framework’s efficiency, accuracy, and robustness.
This letter devises a quantum electromagnetic transients program (QEMTP) which is the first attempt to tackle the computational challenges in solving EMTP through quantum computing. The main contributions lie in: (1) A quantum-enabled EMTP formulation with Dommel's model encoded in quantum states; 2) An Harrow-Hassidim-Lloyd (HHL)-based QEMTP to solve the discrete-time nodal equations; 3) An iteration-based HHL revision for mitigating temporal errors to achieve high accuracy of QEMTP with limited quantum resources. Case studies verify the correctness and efficacy of QEMTP in simulating both fast and slow dynamics.
In modern power systems, the integration of converter-interfaced generations requires the development of electromagnetic transient network simulation programs (EMTP) that can capture rapid fluctuations. However, as the power system scales, the EMTP's computing complexity increases exponentially, leading to a curse of dimensionality that hinders its practical application. Facing this challenge, quantum computing offers a promising approach for achieving exponential acceleration. To realize this in noisy intermediate-scale quantum computers, the variational quantum linear solution (VQLS) was advocated because of its robustness against depolarizing noise. However, it suffers data inflation issues in its preprocessing phase, and no prior research has applied quantum computing to high-frequency switching EMT networks.To address these issues, this paper first designs the matrix low-dimension qubit casting (MLQC) method to address the data inflation problem in the preprocessing of the admittance matrix for VQLS in EMT networks. Besides, we propose a real-only quantum circuit reduction method tailored to the characteristics of the EMT network admittance matrices. Finally, the proposed quantum EMTP algorithm (QEMTP) has been successfully verified for EMT networks containing a large number of high-frequency switching elements.
Quantum-empowered electromagnetic transients program (QEMTP) is a promising paradigm for tackling EMTP’s computational burdens. Nevertheless, no existing studies truly achieve a practical and scalable QEMTP operable on today’s noisy-intermediate-scale quantum (NISQ) computers. The strong reliance on noise-free and fault-tolerant quantum devices–which appears to be decades away– hinder practical applications of current QEMTP methods. This paper devises a NISQ-QEMTP methodology which for the first time transitions the QEMTP operations from ideal, noise-free quantum simulators to real, noisy quantum computers. The main contributions lie in: (1) design of shallow-depth QEMTP quantum circuits for mitigating noises on NISQ quantum devices; (2) practical QEMTP linear solvers incorporating executable quantum state preparation and measurements for nodal voltage computations; (3) a noise-resilient QEMTP algorithm leveraging quantum resources logarithmically scaled with power system dimension; (4) a quantum shifted frequency analysis (QSFA) for accelerating QEMTP by exploiting dynamic phasor simulations with larger time steps; (5) a systematical analysis on QEMTP’s performance under various noisy quantum environments. Extensive experiments systematically verify the accuracy, efficacy, universality and noise-resilience of QEMTP on both noise-free simulators and IBM real quantum computers.
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.
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.