Limitations of Fault-Tolerant Quantum Linear System Solvers for Quantum Power Flow
- 29 September 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (2) , 811-820
Abstract
Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can 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.Keywords
All Related Versions
Funding Information
- LANL’s Directed Research and Development (20230771DI)
- Department of Energy, USA
- Alamos National Laboratory at Los
- National Nuclear Security Administration
- U.S. Department of Energy (89233218CNA000001)
This publication has 32 references indexed in Scilit:
- The complexity of NISQNature Communications, 2023
- Solving DC power flow problems using quantum and hybrid algorithmsApplied Soft Computing, 2023
- Quantum computation in power systems: An overview of recent advancesEnergy Reports, 2022
- Fundamental limits of quantum error mitigationnpj Quantum Information, 2022
- Supervised Learning with Quantum Computers2018
- Read the fine printNature Physics, 2015
- Matrix Analysis2012
- Quantum-state preparation with universal gate decompositionsPhysical Review A, 2011
- Efficient quantum state tomographyNature Communications, 2010
- Quantum amplitude amplification and estimation2002