Quantum computing-based solver for interacting power grids

• URL: http://arxiv.org/abs/2607.29582v1
• Date: Fri, 31 Jul 2026 16:07:07 GMT
• Title: Quantum computing-based solver for interacting power grids
• Abstract summary: We propose a novel quantum-classical hybrid methodology to map the transmission grid's admittance matrix onto a Quantum Processing Unit (QPU)<n>Because the grid's matrix is non-Hermitian, standard quantum eigensolvers are insufficient; thus, we employ the Real Variance-based Variational Quantum Eigensolver (RVVQE) algorithm to accurately extract the complex eigenvalues that represent the system's modes.<n>The RVVQE framework not only bridges the mathematical topologies of dissipative electrical grids and open quantum systems but also provides a profoundly scalable architecture capable of diagnosing resonance in
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The proliferation of power electronics in multi-terminal transmission grids has increasingly led to harmonic distortions and dynamic instabilities. While Resonance Mode Analysis (RMA) provides deep insights into these system resonances, evaluating the critical modes of large-scale grids presents a severe computational bottleneck. Classical iterative techniques must continuously diagonalize massively high-dimensional, non-Hermitian admittance matrices across a wide frequency spectrum, a process that rapidly exhausts classical memory and processing limits. To overcome this scaling barrier, we propose a novel quantum-classical hybrid methodology that natively maps the transmission grid's admittance matrix onto a Quantum Processing Unit (QPU). Because the grid's matrix is non-Hermitian, standard quantum eigensolvers are insufficient; thus, we employ the Real Variance-based Variational Quantum Eigensolver (RVVQE) algorithm to accurately extract the complex eigenvalues that represent the system's modes. Validated against a standard 5-bus transmission system, the quantum-derived critical-resonance modal impedances demonstrate near-perfect alignment with the exact classical frequency responses. Crucially, by encoding the grid's state logarithmically into quantum memory, this methodology bypasses classical RAM limitations. The successful implementation of the RVVQE framework not only bridges the mathematical topologies of dissipative electrical grids and open quantum systems but also provides a profoundly scalable architecture capable of diagnosing resonance instabilities in massive, continental-scale networks that currently exceed classical computational boundaries.

Related papers

• Efficient Treatment of Non-Linearity in Quantum Computational Fluid Dynamics Using Hybrid Tensor Networks [0.0]
  We present a hybrid quantum-classical tensor network algorithm.<n>We replace prior state-based nonlinear implementations with tensor-based block encodings.<n>Compared to fully classical tensor network solvers, our hybrid approach yields substantial reductions in both memory footprint and computational cost.
  arXiv  Detail & Related papers  (2026-08-25T07:13:00Z)
• Learnable yet not simulable: a quantum resource theory of learning models [57.695822250391906]
  It remains unclear which quantum resource governs the classical learnability of quantum circuits.<n>We study the expectation-value functions of families of tunable quantum circuits.<n>These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning.
  arXiv  Detail & Related papers  (2026-08-03T14:48:03Z)
• CANOE: Classically Assisted Non-Orthogonal Eigensolver [0.4779196219827507]
  We introduce CANOE, which distributes Rayleigh-Ritz basis states between quantum and classical hardware.<n>We validate this through numerical simulations of a 76-qubit chromium atom system.<n>These results position CANOE as a practical framework for combining limited quantum resources with expansive classical resources.
  arXiv  Detail & Related papers  (2026-03-13T17:21:14Z)
• Quantum-accelerated conjugate gradient methods via spectral initialization [0.0]
  A fault-tolerant quantum algorithm is used exclusively to construct a spectrally informed initial guess for a classical conjugate gradient (CG) solver.<n>A central feature of QACG is a controllable decomposition of the condition number between the quantum and the classical solver.<n>Results illustrate a concrete pathway toward the scientific and industrial use of early-stage fault-tolerant quantum computing.
  arXiv  Detail & Related papers  (2026-02-10T11:51:42Z)
• Physics-Informed Hybrid Quantum-Classical Dispatching for Large-Scale Renewable Power Systems:A Noise-Resilient Framework [9.378801906395179]
  High-penetration energy introduces significantity and non-Classicality into power system dispatching optimization.<n>Existing approaches typically treat the power grid as a "black box"<n>This paper proposes a Hybrid Quantum-Bridging Dispatching (PIHQ-CD) framework.
  arXiv  Detail & Related papers  (2026-01-26T13:35:54Z)
• Edge of Many-Body Quantum Chaos in Quantum Reservoir Computing [0.0]
  In reservoir computing, optimal performance is typically achieved at the edge of chaos," the boundary between order and chaos.<n>Here, we identify its quantum many-body counterpart using the QRC implemented on the celebrated Sachdev-Ye-Kitaev model.
  arXiv  Detail & Related papers  (2025-06-21T02:33:49Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Autoregressive Transformer Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation [5.668795025564699]
  We present an approach for tackling open quantum system dynamics. We compactly represent quantum states with autoregressive transformer neural networks. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator.
  arXiv  Detail & Related papers  (2020-09-11T18:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.