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.
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.
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.
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.
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.
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.
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.
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−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.