This paper develops a quantum Krylov subspace (QKS)-based shifted frequency analysis (SFA) approach, which synergizes the SFA-enabled acceleration with quantum subspace-enabled scalability to facilitate ultra-scalable electromagnetic transient studies. Our innovations are threefold: (1) We develop a QKS-based SFA architecture, which enables solving high-dimensional SFA models in a lower-dimensional subspace spanned by quantum basis vectors; (2) We design QKS basis vectors that can effectively preserve the critical information of SFA models within the quantum Krylov subspace while maintaining robustness against ill-conditioned matrices; (3) We construct quantum projection and reconstruction circuits to implement QKS with manageable circuit scales. Extensive experiments in IEEE standard testing systems demonstrate the accuracy and effectiveness of QKS-based SFA and its advantage over existing methods. This work, for the first time, unlocks the potential of quantum subspaces in power grid analytics and successfully realizes quantum-based SFA on real-scale power grids.
This paper develops a quantum Krylov subspace (QKS)-based shifted frequency analysis (SFA) approach, which synergizes the SFA-enabled acceleration with quantum subspace-enabled scalability to facilitate ultra-scalable electromagnetic transient studies. Our innovations are threefold: (1) We develop a QKS-based SFA architecture, which enables solving high-dimensional SFA models in a lower-dimensional subspace spanned by quantum basis vectors; (2) We design QKS basis vectors that can effectively preserve the critical information of SFA models within the quantum Krylov subspace while maintaining robustness against ill-conditioned matrices; (3) We construct quantum projection and reconstruction circuits to implement QKS with manageable circuit scales. Extensive experiments in IEEE standard testing systems demonstrate the accuracy and effectiveness of QKS-based SFA and its advantage over existing methods. This work, for the first time, unlocks the potential of quantum subspaces in power grid analytics and successfully realizes quantum-based SFA on real-scale power grids.
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.
Quantum Krylov subspace methods can extract ground and excited states by diagonalizing the Hamiltonian in a compact variational space. In practice, these spaces are almost always generated by real or imaginary time evolution, forcing a timestep trade-off between dynamical accuracy and basis collapse and often producing ill-conditioned overlap matrices that stall convergence. Here we introduce Quantum Krylov using Unitary Decomposition (QKUD), a time-evolution-free construction that maps Hamiltonian powers to implementable unitaries via the Hermitian transform sin(εH)/ε. QKUD reduces to the exact Hamiltonian-power Krylov recursion as ε→0, while finite ε provides a controllable deformation that tunes subspace geometry and improves conditioning. Across molecular active-space benchmarks and a frustrated 2D J1-J2 Heisenberg model, QKUD reproduces exact-Krylov convergence in well-conditioned regimes and systematically restores variational improvement when both exact Krylov and time-evolution Krylov stagnate. These results identify overlap conditioning, instead of time-evolution fidelity, is the key resource for robust quantum Krylov simulation and provide a resilient way forward for accurate quantum simulation of challenging quantum many-body problems.
Predicting ground state energies of quantum many-body systems is one of the central computational challenges in quantum chemistry, physics, and materials science. Krylov subspace methods, such as Krylov Quantum Diagonalization and Sample-based Krylov Quantum Diagonalization, are promising approaches for this task on near-term quantum computers. However, both require repeated quantum circuit executions for each Krylov subspace and for every new Hamiltonian, posing a major bottleneck under noisy hardware constraints. We introduce Generative Krylov Subspace Representations (GenKSR), a framework that learns a classical generative representation of the entire Krylov diagonalization process. To enable effective modeling of quantum systems, GenKSR leverages a conditional generative model framework. We investigate two representative backbone architectures, the standard Transformer and the Mamba state-space model. By learning the distribution of measurement outcomes conditioned on Hamiltonian parameters and evolution time, GenKSR generates Krylov subspace samples for unseen Hamiltonians and for larger subspace dimensions than those used in training. This enables full energy reconstruction purely from the classical model, without additional quantum experiments. We validate our approach through simulations of 15-qubit 1D and 16-qubit 2D Heisenberg models, as well as a hardware experiment on a 20-qubit XXZ chain executed on an IBM quantum processor. Our model successfully learns the distribution from experimental data and generates a high-fidelity representation of the quantum process. This representation enables classical reproduction of experimental outcomes, supports reliable energy estimates for unseen Hamiltonians, and significantly reduces the need for further quantum computation.
Simulating quantum systems is one of the most promising tasks where quantum computing can potentially outperform classical computing. However, the robustness needed for reliable simulations of medium to large systems is beyond the reach of existing quantum devices. To address this, Quantum Krylov Subspace (QKS) methods have been developed, enhancing the ability to perform accelerated simulations on noisy intermediate-scale quantum computers. In this study, we introduce and evaluate two QKS methods derived from the QDavidson algorithm, a novel approach for determining the ground and excited states of many-body systems. Unlike other QKS methods that pre-generate the Krylov subspace through real- or imaginary-time evolution, QDavidson iteratively adds basis vectors into the Krylov subspace. This iterative process enables faster convergence with fewer iterations and necessitates shallower circuit depths, marking a significant advancement in the field of quantum simulation.
Quantum Krylov subspace diagonalization (QKSD) is an emerging method used in place of quantum phase estimation in the early fault-tolerant era, where limited quantum circuit depth is available. In contrast to the classical Krylov subspace diagonalization (KSD) or the Lanczos method, QKSD exploits the quantum computer to efficiently estimate the eigenvalues of large-size Hamiltonians through a faster Krylov projection. However, unlike classical KSD, which is solely concerned with machine precision, QKSD is inherently accompanied by errors originating from a finite number of samples. Moreover, due to difficulty establishing an artificial orthogonal basis, ill-conditioning problems are often encountered, rendering the solution vulnerable to noise. In this work, we present a nonasymptotic theoretical framework to assess the relationship between sampling noise and its effects on eigenvalues. We also propose an optimal solution to cope with large condition numbers by eliminating the ill-conditioned bases. Numerical simulations of the one-dimensional Hubbard model demonstrate that the error bound of finite samplings accurately predicts the experimental errors in well-conditioned regions.
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.