For AC power flow, any quantum solver built from state preparation, a quantum linear solve, and full readout has runtime Ω(Nκ/ε), slower than classical NRLF's O(Nκ log(κ/ε)) at normal accuracies.
Quantum Power Flows: From Theory to Practice
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Climate change is becoming one of the greatest challenges to the sustainable development of modern society. Renewable energies with low density greatly complicate the online optimization and control processes, where modern advanced computational technologies, specifically quantum computing, have significant potential to help. In this paper, we discuss applications of quantum computing algorithms toward state-of-the-art smart grid problems. We suggest potential, exponential quantum speedup by the use of the Harrow-Hassidim-Lloyd (HHL) algorithms for sparse matrix inversions in power-flow problems. However, practical implementations of the algorithm are limited by the noise of quantum circuits, the hardness of realizations of quantum random access memories (QRAM), and the depth of the required quantum circuits. We benchmark the hardware and software requirements from the state-of-the-art power-flow algorithms, including QRAM requirements from hybrid phonon-transmon systems, and explicit gate counting used in HHL for explicit realizations. We also develop near-term algorithms of power flow by variational quantum circuits and implement real experiments for 6 qubits with a truncated version of power flows.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Conditions for Quantum Advantage in AC Power Flow
For AC power flow, any quantum solver built from state preparation, a quantum linear solve, and full readout has runtime Ω(Nκ/ε), slower than classical NRLF's O(Nκ log(κ/ε)) at normal accuracies.