Abstract The precise waveform tracking of electromagnetic transients program is hindered in bulk power systems due to increasingly complex transient characteristics, and the possible solution is provided by the emergence of quantum algorithms. This work devises a gridded quantum differentiation algorithm (GQDA) under the paradigm of quantum computing, which avoids reformulating electromagnetic transient problems into the quantum linear system problem solving paradigm, and performs electromagnetic transients analysis based on differentiable quantum circuits. As one variational quantum algorithm, GQDA uses differentiable quantum circuits to solve differential equations, showing good scalability and flexibility, and exhibits a potential theoretical advantage in asymptotic complexity compared with classical methods. GQDA also includes a scheme of time domain scaling for fast-slow dynamic systems to improve the quality of the solution. Proportionally scaling the parameters of circuit elements is analogous to proportionally scaling the evolution of the state variables in the time domain. Case studies are conducted to explore how the number of grids affects the accuracy and efficiency of GQDA, as well as the potential advantages of GQDA. The results confirm that GQDA has high validity and ability to precisely track the waveform and restrain the errors effectively with the suitable choice of shot and grid numbers.
Abstract The precise waveform tracking of electromagnetic transients program is hindered in bulk power systems due to increasingly complex transient characteristics, and the possible solution is provided by the emergence of quantum algorithms. This work devises a gridded quantum differentiation algorithm (GQDA) under the paradigm of quantum computing, which avoids reformulating electromagnetic transient problems into the quantum linear system problem solving paradigm, and performs electromagnetic transients analysis based on differentiable quantum circuits. As one variational quantum algorithm, GQDA uses differentiable quantum circuits to solve differential equations, showing good scalability and flexibility, and exhibits a potential theoretical advantage in asymptotic complexity compared with classical methods. GQDA also includes a scheme of time domain scaling for fast-slow dynamic systems to improve the quality of the solution. Proportionally scaling the parameters of circuit elements is analogous to proportionally scaling the evolution of the state variables in the time domain. Case studies are conducted to explore how the number of grids affects the accuracy and efficiency of GQDA, as well as the potential advantages of GQDA. The results confirm that GQDA has high validity and ability to precisely track the waveform and restrain the errors effectively with the suitable choice of shot and grid numbers.
The advent of quantum computing has heralded unprecedented possibilities in diverse scientific domains, including electrical engineering. This research paper delves into the innovative integration of quantum computing methodologies for the time-domain simulation of electromagnetic transients in interconnected power systems. Electromagnetic transients are pivotal phenomena that influence the stability, reliability, and efficiency of power systems, necessitating accurate and rapid simulation techniques. Classical computational paradigms, albeit powerful, encounter substantial limitations in terms of computational speed and capacity when dealing with large-scale, complex interconnected power networks. To address these challenges, this paper introduces quantum algorithms that leverage the principles of superposition and entanglement, ensuring a quantum leap in simulation capabilities. A comprehensive comparison with conventional simulation methodologies is presented, highlighting the quantum algorithms' superior efficiency and precision. The quantum circuit models for various power system components are meticulously constructed and optimized for quantum resource utilization. Furthermore, the paper explores error mitigation strategies and quantum error correction codes tailored for power system applications, ensuring robustness in the presence of quantum noise and decoherence. The empirical results, obtained from simulations on quantum processors and simulators, underscore the substantial advantages and potential of quantum computing in revolutionizing electromagnetic transient analysis. This research not only paves the way for accelerated and accurate simulations but also contributes to the enhanced stability and reliability of modern interconnected power systems.
Quantum computing has been demonstrated as a promising solution for computation-intensive power system electromagnetic transient (EMT) computation. However, existing work have focused on time-independent Hamiltonian evolution to solve ordinary differential equations (ODEs) with heavily classical interactions. This work proposes OHQS, an optimized time-dependent Hamiltonian evolution quantum solver, to enable high-accuracy computation for ODE-dominated EMT problems without classical iterations. The spatiotemporay mapping transformation is discretized to construct iterative quantum circuit evolution, leveraging the spatiotemporal fixed points (SFPs)-enabled automatic optimizer to reduce discretized errors. Experimental results have demonstrated that OHQS can support time-dependent Hamiltonian evolution in practical applications with up to 99.91% accuracy and achieve up to 9.56× error reduction compared to classical methods. The observed exponential decay of the relative error implies that consumed qubits scale as O(log(1/ξ)) and the ξ is the target relative error tolerance.
Partial differential equations (PDEs) play a central role in scientific and engineering analysis, with applications spanning fluid dynamics, heat and mass transfer, electromagnetism, quantum mechanics, and financial modeling, where they are used to describe diffusion processes, wave propagation, and the evolution of complex systems over space and time. Solving multidimensional partial differential equations (PDEs) is a computationally challenging problem, even for the most advanced classical systems. Over the past decade, quantum computing has attracted significant interest as a potential approach for solving complex computational problems, including multidimensional PDEs. Although a variety of approaches have been proposed for solving PDEs, most of the existing techniques are based on variational quantum algorithms (VQAs). Despite being promising, these VQA-based approaches suffer from low accuracy, long execution times, and limited scalability. In this work, we propose a scalable and efficient quantum algorithm for solving multidimensional PDEs. Our algorithm has two variants. One variant is based on the finite difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, whereas the other is based on FDM, C2Q, and column-by-column decomposition (CCD). We have also evaluated our algorithm using several practical case studies; namely, Poisson, heat, Black–Scholes, and Navier–Stokes equations. The results show that our proposed approach achieves higher accuracy, greater scalability, and faster execution time than the VQA-based approaches. We validated these findings on both noise-free and noisy simulators, as well as on a hardware emulator and real IBM quantum hardware.
Quantum computing has the potential to solve certain compute-intensive problems faster than classical computing by leveraging the quantum mechanical properties of superposition and entanglement. This capability can be particularly useful for solving Partial Differential Equations (PDEs), which are challenging to solve even for High-Performance Computing (HPC) systems, especially for multidimensional PDEs. This led researchers to investigate the usage of Quantum-Centric High-Performance Computing (QC-HPC) to solve multidimensional PDEs for various applications. However, the current quantum computing-based PDE-solvers, especially those based on Variational Quantum Algorithms (VQAs) suffer from limitations, such as low accuracy, long execution times, and limited scalability. In this work, we propose an innovative algorithm to solve multidimensional PDEs with two variants. The first variant uses Finite Difference Method (FDM), Classical-to-Quantum (C2Q) encoding, and numerical instantiation, whereas the second variant utilizes FDM, C2Q encoding, and Column-by-Column Decomposition (CCD). We evaluated the proposed algorithm using the Poisson equation as a case study and validated it through experiments conducted on noise-free and noisy simulators, as well as hardware emulators and real quantum hardware from IBM. Our results show higher accuracy, improved scalability, and faster execution times in comparison to variational-based PDE-solvers, demonstrating the advantage of our approach for solving multidimensional PDEs.
The solution for non-linear, complex partial differential Equations (PDEs) is achieved through numerical approximations, which yield a linear system of equations. This approach is prevalent in Computational Fluid Dynamics (CFD), but it restricts the mesh size since the solution of the linear system becomes computationally intractable when the mesh resolution increases. The reliance on the ability of High-Performance Computers (HPC) to scale up and meet these requirements is myopic; such very high-fidelity simulations require a paradigm shift in computing. This paper presents an exploration of quantum methodologies aimed at achieving high accuracy in solving such a large system of equations. Leveraging recent works in Quantum Linear Solver Algorithms (QLSA) and variational algorithms suitable for Quantum Simulation in HPC, we aspire to push the boundaries of CFD-relevant problems that can be solved on hybrid quantum-classical framework. To this end, we consider the 2D, transient, incompressible, viscous, non-linear coupled Burgers equation as a test problem and investigate the accuracy of our approach by comparing results with a classical linear system of equation solvers, such as the Generalized Minimal RESidual method (GMRES). Through rigorous testing, our findings demonstrate that our quantum methods yield results comparable in accuracy to traditional approaches. Additionally, we demonstrate the accuracy, scalability, and consistency of our quantum method. Lastly, we present an insightful estimation of the resources our quantum algorithm needs to solve systems with nearly 2 billion mesh points.
Quantum computers have the potential to solve some complex problems much faster than classical equivalents. Significant research efforts are aimed at determining which algorithms give which advantages for different use-cases. An application where quantum computers can possibly bring great advantages is solving (partial) differential equations, which has a broad set of applications, for instance in wave-propagation models. Few differential equations admit an analytical solution. For most heuristic methods are required to approximate a solution. Well-known heuristic techniques include the finite element and finite difference method, where the considered space is partitioned and systems of linear equations resulting from this partitioning need to be solved. Quantum computing puts forward new methods to solve these systems of linear equations and hence these differential equations. First, the HHL algorithm gives an efficient way to solve a linear system of equations. The HHL algorithm comes with drawbacks, but in this specific use-case some of these objections might be circumvented. Quantum computers furthermore offer the variational approach: an optimization-based path to solving differential equations. With this approach, the devices might even ‘learn’ the noise patterns emerging in present day quantum computers and compensate for it. In this work we revisit quantum methods for solving partial differential equations and consider how well they work in solving differential equations in practice. We also discuss possible caveats and bottlenecks of the approaches.