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

Fei Feng, Yifan Zhou, Peng Zhang

Published May 4, 2021• 69 citations
Publisher

Abstract

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.

DOI
10.1109/tpwrs.2021.3077382

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•Apr 11, 2021•0 citations

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.

•Apr 11, 2021•0 citations

Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow

Parikshit Pareek, Abhijith Jayakumar, Carleton Coffrin +1 more

Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practicalquantum advantagecan be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. We investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.

arXiv:2402.08617•IEEE Transactions on Power Systems•Sep 29, 2025•8 citations

Quantum Computing Solution of DC Power Flow

Rozhin Eskandarpour, Kumar Ghosh, Amin Khodaei +3 more

In this paper, we model and solve a fundamental power system problem, i.e., DC power flow, using a practical quantum computer. The Harrow-Hassidim-Lloyd (HHL) quantum algorithm is used to solve the DC power flow problem. The HHL algorithm for the solution of a system of linear equations (SLE) offers an exponential speedup over the classical computers. The speedup advantage is more significant when the size and the frequency of solving the power flow problem become more substantial. Verified quantum computing applications to power systems are merely nonexistent at this point. Through this paper, we plan to (1) provide a proof-of-concept that practical power system problems can be solved using quantum technology, (2) build a quantum-grid foundation by solving a fundamental power system problem with applications in many other critical grid problems, and (3) apply HHL to solve an SLE which has broad applications in many power system problems. A small 3-bus system is used for testing and demonstration purposes, considering the limitations of the available quantum computing hardware and software. The proposed method's merits and effectiveness are demonstrated using IBM open-source quantum computer and reported through proof-of-concept experimental demonstration using a 4-qubit quantum information processor.

arXiv:2010.02442•Oct 6, 2020•12 citations

Experimental Quantum Computing to Solve Network DC Power Flow Problem

Rozhin Eskandarpour, Kumar Ghosh, Amin Khodaei +1 more

Practical quantum computing applications to power grids are nonexistent at the moment. This paper investigates how a fundamental grid problem, namely DC power flow, can be solved using quantum computing. Power flow is the most widely used power system analysis technique, either as a stand-alone application or embedded in other applications; therefore, its fast and accurate solution is of utmost significance for grid operators. We base our studies on the Harrow-Hassidim-Lloyd (HHL) quantum algorithm, which has a proven theoretical speedup over classical algorithms in solving a system of linear equations. Practical studies on a quantum computer are conducted using the WSCC 9-bus system.

arXiv:2106.12032•Jun 22, 2021•14 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•16 citations
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.
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.
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.
Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practicalquantum advantagecan be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. We investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.
In this paper, we model and solve a fundamental power system problem, i.e., DC power flow, using a practical quantum computer. The Harrow-Hassidim-Lloyd (HHL) quantum algorithm is used to solve the DC power flow problem. The HHL algorithm for the solution of a system of linear equations (SLE) offers an exponential speedup over the classical computers. The speedup advantage is more significant when the size and the frequency of solving the power flow problem become more substantial. Verified quantum computing applications to power systems are merely nonexistent at this point. Through this paper, we plan to (1) provide a proof-of-concept that practical power system problems can be solved using quantum technology, (2) build a quantum-grid foundation by solving a fundamental power system problem with applications in many other critical grid problems, and (3) apply HHL to solve an SLE which has broad applications in many power system problems. A small 3-bus system is used for testing and demonstration purposes, considering the limitations of the available quantum computing hardware and software. The proposed method's merits and effectiveness are demonstrated using IBM open-source quantum computer and reported through proof-of-concept experimental demonstration using a 4-qubit quantum information processor.
Practical quantum computing applications to power grids are nonexistent at the moment. This paper investigates how a fundamental grid problem, namely DC power flow, can be solved using quantum computing. Power flow is the most widely used power system analysis technique, either as a stand-alone application or embedded in other applications; therefore, its fast and accurate solution is of utmost significance for grid operators. We base our studies on the Harrow-Hassidim-Lloyd (HHL) quantum algorithm, which has a proven theoretical speedup over classical algorithms in solving a system of linear equations. Practical studies on a quantum computer are conducted using the WSCC 9-bus system.
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.