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 Power Systems

Quantum Newtonian Power Flow

Ruoyan Fan, Chaofan Lin, Peng Zhang

Published Nov 14, 2025• 1 citation
Publisher

Abstract

This letter introduces a novel quantum Newtonian power flow (QNPF) algorithm. The QNPF features a more general quantum circuit that can process non-Hermitian matrices with fewer required qubits and eliminates the need for iterative optimization of gate parameters. Our contributions include: 1) Developing a quantum state-based Newton's power flow framework to enhance accuracy, convergence, and versatility; 2) Integrating quantum singular value transformation to efficiently solve each iteration of QNPF with scalable quantum circuits; and 3) Devising a block-rescaling technique to ensure computational accuracy in ill-conditioned cases. Test results validate the accuracy, scalability and numerical stability of QNPF, underscoring its potential to advance quantum power flow computation.

DOI
10.1109/tpwrs.2025.3632611

Related papers

Quantum Power Flow

Fei Feng, Yifan Zhou, Peng Zhang

This letter is a proof of concept for quantum power flow (QPF) algorithms which underpin various unprecedentedly efficient power system analytics exploiting quantum computing. Our contributions are three-fold: 1) Establish a quantum-state-based fast decoupled model empowered by Hermitian and constant Jacobian matrices; 2) Devise an enhanced Harrow-Hassidim-Lloyd (HHL) algorithm to solve the fast decoupled QPF; 3) Further improve the HHL efficiency by parameterizing quantum phase estimation and reciprocal rotation only at the beginning stage. Promising test results validate the accuracy and efficacy of QPF and demonstrate QPF's enormous potential in the era of quantum computing.

arXiv:2104.04888•IEEE Transactions on Power Systems•May 4, 2021•79 citations

A Hybrid Classical-Quantum Newton-Raphson Framework for Power Flow Computation

Xin Jin, Jun Lu, Lanlan Zhang +2 more

The Newton-Raphson method, despite its quadratic convergence, faces a growing performance bottleneck in solving high-dimensional sparse linear systems as power grid scale and complexity increase. This paper proposes a hybrid classical-quantum Newton-Raphson framework for power flow computation. On the classical side, the polar-coordinate Newton-Raphson iteration and Jacobian assembly are retained; on the quantum side, Krylov subspace reduction is coupled with a variational quantum linear solver (VQLS) to solve the projected low-dimensional linear system. A residual-driven nested iterative refinement strategy and the parameter shift rule are introduced to ensure solution accuracy and gradient efficiency, respectively. Due to current quantum chip hardware constraints, five physical qubits with relatively high fidelity are selected for validation on the domestically developed Origin Wukong superconducting quantum processor. The IEEE 57-bus system (106-dimensional Jacobian) and the Hefei 81-bus regional grid system (141-dimensional) both converge within three Newton iterations with maximum power mismatch below$1 \times 10^{-3}$; voltage relative errors are under$1 \times 10^{-5}$for the 57 -bus case and under$1 \times 10^{-3}$for the 81-bus case. These results demonstrate that the hybrid architecture can deliver accurate power flow solutions under NISQ-era hardware constraints.

International Conference on Power System and Energy Technology (ICPSET)•Jul 1, 2026•0 citations

Quantum Power Flow: Revolutionizing Power Systems Analysis

Buhari Samaila, Chellapandi Sekar

This research investigates the transformative potential of Quantum Power Flow (QPF) in power systems analysis. Leveraging quantum computing principles, the study explores quantum algorithms for power flow simulations to enhance computational efficiency andsolution accuracy. The Quantum Power Flow method is introduced, addressing challenges arising from the growing complexity of power systems, especially with increased renewable energy integration. The mathematical foundation of the Quantum Power Flow method is detailed, emphasizing quantum parallelism and computational advantages. Experimental validation, simulations, and research case studies collectively establish the practical viability and versatility of the proposed quantum approach. A 5 and 3-bus power system case study illustrates its applicability.Acknowledging current quantum computing challenges, including error susceptibility, the study highlights ongoing advancements and error correction mechanisms' potential to overcome limitations. The research concludes by discussing broader implications of quantum power system analysis and outlining future research avenues. In summary, this research comprehensively explores Quantum Power Flow, offering theoretical insights and practical demonstrations. As quantum computing evolves, this study contributes to the paradigm shift in power system analysis, opening new horizons for research and application..

SciWaveBulletin•Jan 1, 2023•6 citations

Power flow analysis using quantum and digital annealers: a discrete combinatorial optimization approach

Zeynab Kaseb, Matthias Möller, Pedro P. Vergara +1 more

Power flow (PF) analysis is a foundational computational method to study the flow of power in an electrical network. This analysis involves solving a set of non-linear and non-convex differential-algebraic equations. State-of-the-art solvers for PF analysis, therefore, face challenges with scalability and convergence, specifically for large-scale and/or ill-conditioned cases characterized by high penetration of renewable energy sources, among others. The adiabatic quantum computing paradigm has been proven to efficiently find solutions for combinatorial problems in the noisy intermediate-scale quantum (NISQ) era, and it can potentially address the limitations posed by state-of-the-art PF solvers. For the first time, we propose a novel adiabatic quantum computing approach for efficient PF analysis. Our key contributions are (i) a combinatorial PF algorithm and a modified version that aligns with the principles of PF analysis, termed the adiabatic quantum PF algorithm (AQPF), both of which use Quadratic Unconstrained Binary Optimization (QUBO) and Ising model formulations; (ii) a scalability study of the AQPF algorithm; and (iii) an extension of the AQPF algorithm to handle larger problem sizes using a partitioned approach. Numerical experiments are conducted using different test system sizes on D-Wave's Advantage™ quantum annealer, Fujitsu's digital annealer V3, D-Wave's quantum-classical hybrid annealer, and two simulated annealers running on classical computer hardware. The reported results demonstrate the effectiveness and high accuracy of the proposed AQPF algorithm and its potential to speed up the PF analysis process while handling ill-conditioned cases using quantum and quantum-inspired algorithms.

Scientific Reports•Oct 5, 2024•21 citations

Noise-resilient quantum power flow

Fei Feng, Yifan Zhou, Peng Zhang

Quantum power flow (QPF) offers an inspiring direction for overcoming the computation challenge of power flow through quantum computing. However, the practical implementation of existing QPF algorithms in today's noisy-intermediate-scale quantum (NISQ) era remains limited because of their sensitivity to noise. This paper establishes an NISQ-QPF algorithm that enables power flow computation on noisy quantum devices. The main contributions include: (1) a variational quantum circuit (VQC)-based alternating current (AC) power flow formulation, which enables QPF using short-depth quantum circuits; (2) NISQ-compatible QPF solvers based on the variational quantum linear solver (VQLS) and modified fast decoupled power flow; and (3) an error-resilient QPF scheme to relieve the QPF iteration deviations caused by noise; (3) a practical NISQ-QPF framework for implementable and reliable power flow analysis on noisy quantum machines. Extensive simulation tests validate the accuracy and generality of NISQ-QPF for solving practical power flow on IBM's real, noisy quantum computers.

arXiv:2211.10555•iEnergy•Mar 1, 2023•18 citations

Stochastic quantum power flow for risk assessment in power systems

Brynjar Sævarsson, Hjörtur Jóhannsson, Spyros Chatzivasileiadis

This paper introduces the first quantum computing framework for Stochastic Quantum Power Flow (SQPF) analysis in power systems . The proposed method leverages quantum states to encode power flow distributions, enabling the use of Quantum Monte Carlo (QMC) sampling to efficiently assess the probability of line overloads. Our approach significantly reduces the required sample size compared to traditional Monte Carlo methods , making it particularly suited for risk assessments in scenarios involving high uncertainty, such as renewable energy integration. We validate the method on two test systems, demonstrating the computational advantage of quantum algorithms in reducing sample complexity while maintaining accuracy. This work represents a foundational step toward scalable quantum power flow analysis, with potential applications in future power system operations and planning. The results show promising computational speedups, underscoring the potential of quantum computing in addressing the increasing uncertainty in modern power grids.

Electric Power Systems Research•Jan 15, 2025•4 citations
This letter introduces a novel quantum Newtonian power flow (QNPF) algorithm. The QNPF features a more general quantum circuit that can process non-Hermitian matrices with fewer required qubits and eliminates the need for iterative optimization of gate parameters. Our contributions include: 1) Developing a quantum state-based Newton's power flow framework to enhance accuracy, convergence, and versatility; 2) Integrating quantum singular value transformation to efficiently solve each iteration of QNPF with scalable quantum circuits; and 3) Devising a block-rescaling technique to ensure computational accuracy in ill-conditioned cases. Test results validate the accuracy, scalability and numerical stability of QNPF, underscoring its potential to advance quantum power flow computation.
This letter is a proof of concept for quantum power flow (QPF) algorithms which underpin various unprecedentedly efficient power system analytics exploiting quantum computing. Our contributions are three-fold: 1) Establish a quantum-state-based fast decoupled model empowered by Hermitian and constant Jacobian matrices; 2) Devise an enhanced Harrow-Hassidim-Lloyd (HHL) algorithm to solve the fast decoupled QPF; 3) Further improve the HHL efficiency by parameterizing quantum phase estimation and reciprocal rotation only at the beginning stage. Promising test results validate the accuracy and efficacy of QPF and demonstrate QPF's enormous potential in the era of quantum computing.
The Newton-Raphson method, despite its quadratic convergence, faces a growing performance bottleneck in solving high-dimensional sparse linear systems as power grid scale and complexity increase. This paper proposes a hybrid classical-quantum Newton-Raphson framework for power flow computation. On the classical side, the polar-coordinate Newton-Raphson iteration and Jacobian assembly are retained; on the quantum side, Krylov subspace reduction is coupled with a variational quantum linear solver (VQLS) to solve the projected low-dimensional linear system. A residual-driven nested iterative refinement strategy and the parameter shift rule are introduced to ensure solution accuracy and gradient efficiency, respectively. Due to current quantum chip hardware constraints, five physical qubits with relatively high fidelity are selected for validation on the domestically developed Origin Wukong superconducting quantum processor. The IEEE 57-bus system (106-dimensional Jacobian) and the Hefei 81-bus regional grid system (141-dimensional) both converge within three Newton iterations with maximum power mismatch below1×10−31 \times 10^{-3}1×10−3; voltage relative errors are under1×10−51 \times 10^{-5}1×10−5for the 57 -bus case and under1×10−31 \times 10^{-3}1×10−3for the 81-bus case. These results demonstrate that the hybrid architecture can deliver accurate power flow solutions under NISQ-era hardware constraints.
This research investigates the transformative potential of Quantum Power Flow (QPF) in power systems analysis. Leveraging quantum computing principles, the study explores quantum algorithms for power flow simulations to enhance computational efficiency andsolution accuracy. The Quantum Power Flow method is introduced, addressing challenges arising from the growing complexity of power systems, especially with increased renewable energy integration. The mathematical foundation of the Quantum Power Flow method is detailed, emphasizing quantum parallelism and computational advantages. Experimental validation, simulations, and research case studies collectively establish the practical viability and versatility of the proposed quantum approach. A 5 and 3-bus power system case study illustrates its applicability.Acknowledging current quantum computing challenges, including error susceptibility, the study highlights ongoing advancements and error correction mechanisms' potential to overcome limitations. The research concludes by discussing broader implications of quantum power system analysis and outlining future research avenues. In summary, this research comprehensively explores Quantum Power Flow, offering theoretical insights and practical demonstrations. As quantum computing evolves, this study contributes to the paradigm shift in power system analysis, opening new horizons for research and application..
Power flow (PF) analysis is a foundational computational method to study the flow of power in an electrical network. This analysis involves solving a set of non-linear and non-convex differential-algebraic equations. State-of-the-art solvers for PF analysis, therefore, face challenges with scalability and convergence, specifically for large-scale and/or ill-conditioned cases characterized by high penetration of renewable energy sources, among others. The adiabatic quantum computing paradigm has been proven to efficiently find solutions for combinatorial problems in the noisy intermediate-scale quantum (NISQ) era, and it can potentially address the limitations posed by state-of-the-art PF solvers. For the first time, we propose a novel adiabatic quantum computing approach for efficient PF analysis. Our key contributions are (i) a combinatorial PF algorithm and a modified version that aligns with the principles of PF analysis, termed the adiabatic quantum PF algorithm (AQPF), both of which use Quadratic Unconstrained Binary Optimization (QUBO) and Ising model formulations; (ii) a scalability study of the AQPF algorithm; and (iii) an extension of the AQPF algorithm to handle larger problem sizes using a partitioned approach. Numerical experiments are conducted using different test system sizes on D-Wave's Advantage™ quantum annealer, Fujitsu's digital annealer V3, D-Wave's quantum-classical hybrid annealer, and two simulated annealers running on classical computer hardware. The reported results demonstrate the effectiveness and high accuracy of the proposed AQPF algorithm and its potential to speed up the PF analysis process while handling ill-conditioned cases using quantum and quantum-inspired algorithms.
Quantum power flow (QPF) offers an inspiring direction for overcoming the computation challenge of power flow through quantum computing. However, the practical implementation of existing QPF algorithms in today's noisy-intermediate-scale quantum (NISQ) era remains limited because of their sensitivity to noise. This paper establishes an NISQ-QPF algorithm that enables power flow computation on noisy quantum devices. The main contributions include: (1) a variational quantum circuit (VQC)-based alternating current (AC) power flow formulation, which enables QPF using short-depth quantum circuits; (2) NISQ-compatible QPF solvers based on the variational quantum linear solver (VQLS) and modified fast decoupled power flow; and (3) an error-resilient QPF scheme to relieve the QPF iteration deviations caused by noise; (3) a practical NISQ-QPF framework for implementable and reliable power flow analysis on noisy quantum machines. Extensive simulation tests validate the accuracy and generality of NISQ-QPF for solving practical power flow on IBM's real, noisy quantum computers.
This paper introduces the first quantum computing framework for Stochastic Quantum Power Flow (SQPF) analysis in power systems . The proposed method leverages quantum states to encode power flow distributions, enabling the use of Quantum Monte Carlo (QMC) sampling to efficiently assess the probability of line overloads. Our approach significantly reduces the required sample size compared to traditional Monte Carlo methods , making it particularly suited for risk assessments in scenarios involving high uncertainty, such as renewable energy integration. We validate the method on two test systems, demonstrating the computational advantage of quantum algorithms in reducing sample complexity while maintaining accuracy. This work represents a foundational step toward scalable quantum power flow analysis, with potential applications in future power system operations and planning. The results show promising computational speedups, underscoring the potential of quantum computing in addressing the increasing uncertainty in modern power grids.