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

arXiv:2412.14095 · IEEE Transactions on Smart Grid

Quantum Optimization for Optimal Power Flow: CVQLS-Augmented Interior Point Method

Farshad Amani, Amin Kargarian

Published Aug 25, 2025• 8 citations
arXivHTMLPDF

Abstract

This paper presents a quantum-enhanced optimization approach for solving optimal power flow (OPF) by integrating the interior point method (IPM) with a coherent variational quantum linear solver (CVQLS). The objective is to explore the applicability of quantum computing to power systems optimization and address the associated challenges. A comparative analysis of state-of-the-art quantum linear solvers—Harrow-Hassidim-Lloyd (HHL), variational quantum linear solver (VQLS), and CVQLS—revealed that CVQLS is most suitable for OPF due to its stability with ill-conditioned matrices, such as the Hessian in IPM. To ensure high-quality solutions, prevent suboptimal convergence, and avoid the barren plateau problem, we propose a quantum circuit parameter initialization technique along with a method to guide the IPM along the central path. Moreover, we design an ansatz tailored for OPF, optimizing the expressibility and trainability of the quantum circuit to ensure efficient convergence and robustness in solving quantum OPF. Various optimizers are also tested for quantum circuit parameter optimization to select the best one. We evaluate our approaches on multiple systems to show their effectiveness in providing reliable OPF solutions. Simulations for the 2-bus system are conducted on a commercial IBMQ quantum device, while simulations for the other larger cases are performed using the IBM quantum simulator. While promising, CVQLS is limited by current quantum hardware, especially for larger systems. We use a quantum noise simulator to test scalability.

DOI
10.1109/tsg.2025.3602359

Related papers

Nested-Loop Trajectory-Informed Variational Quantum Solver for Interior-Point OPF

Farshad Amani, Amin Kargarian

Optimal power flow (OPF) solved by an interior-point method (IPM) requires repeatedly solving Newton linear systems. When variational quantum linear solvers (VQLS) are used, each IPM iteration involves an additional nested inner variational optimization loop, which can significantly slow the overall quantum-assisted IPM convergence. To address this challenge, this paper proposes a dual-level trainable quantum IPM framework for OPF that leverages early solver-generated trajectories rather than relying on single-point prediction. The key observation is that early IPM iterates provide informative primal-dual, slack, and barrier-variable evolution about the path to optimality, while early VQLS parameter updates provide useful information about the later variational search. At the quantum-solver level, a trainable parameter model uses a short prefix of the VQLS parameter trajectory to project the remaining variational search toward a lower-cost region. At the OPF-solver level, a second trainable model uses early primal-dual IPM iterates to project a later central path state, which is restored to an admissible point before IPM refinement continues. Simulation studies show that the proposed approach reduces the number of variational updates by up to $95\%$ while maintaining OPF objective values close to the classical IPM reference. A 2-bus demonstration on real quantum hardware is also included to validate the implementation of the proposed workflow.

quant-pharXiv:2607.03361•Jul 6, 2026•0 citations

Quantum- Inspired Optimal Power Flow

Farshad Amani, Amin Kargarian

This paper addresses the critical challenge of Op-timal Power Flow (OPF) in electrical engineering, emphasizing the intersection of complexity and technological advancements. Leveraging quantum computation, particularly the Primal-Dual Interior Point Method (PD-IPM) and the Harrow-Hassidim-Lloyd (HHL) algorithm, we explore enhanced solutions for both Alternating Current OPF (ACOPF) and Direct Current OPF (DCOPF). PD-IPM generates linear systems during optimization, aligning with the selected quantum techniques that offer expo-nential speedup. We investigate the scalability and challenges of HHL, emphasizing the current limitations for larger power systems. Additionally, we introduce a hybrid approach that dynamically transitions between quantum and classical methods to optimize convergence. Our study evaluates the proposed methodology's performance under diverse error conditions, em-phasizing its potential to revolutionize solving times for OPF in power systems.

IEEE Texas Power and Energy Conference (TPEC)•Feb 12, 2024•5 citations

Quantum Interior Point Methods: A Review of Developments and An Optimally Scaling Framework

Mohammadhossein Mohammadisiahroudi, Zeguan Wu, Pouya Sampourmahani +2 more

The growing demand for solving large-scale, data-intensive linear and conic optimization problems, particularly in applications such as artificial intelligence and machine learning, has highlighted the limitations of classical interior point methods (IPMs). Despite their favorable polynomial-time convergence, conventional IPMs often suffer from high per-iteration computational costs, especially for dense problem instances. Recent advances in quantum computing, particularly quantum linear system solvers, offer promising avenues to accelerate the most computationally intensive steps of IPMs. However, practical challenges such as quantum error, hardware noise, and sensitivity to poorly conditioned systems remain significant obstacles. In response, a series of Quantum IPMs (QIPMs) has been developed to address these challenges, incorporating techniques such as feasibility maintenance, iterative refinement, and preconditioning. In this work, we review this line of research with a focus on our recent contributions, including an almost-exact QIPM framework. This hybrid quantum-classical approach constructs and solves the Newton system entirely on a quantum computer, while performing solution updates classically. Crucially, all matrix-vector operations are executed on quantum hardware, enabling the method to achieve an optimal worst-case scalability w.r.t dimension, surpassing the scalability of existing classical and quantum IPMs.

quant-pharXiv:2512.06224•Dec 9, 2025•1 citation

Optimal Scaling Quantum Interior Point Method for Linear Optimization

Mohammadhossein Mohammadisiahroudi, Zeguan Wu, Pouya Sampourmahani +2 more

The emergence of huge-scale, data-intensive linear optimization (LO) problems in applications such as machine learning has driven the need for more computationally efficient interior point methods (IPMs). While conventional IPMs are polynomial-time algorithms with rapid convergence, their per-iteration cost can be prohibitively high for dense large-scale LO problems. Quantum linear system solvers have shown potential in accelerating the solution of linear systems arising in IPMs. In this work, we introduce a novel almost-exact quantum IPM, where the Newton system is constructed and solved on a quantum computer, while solution updates occur on a classical machine. Additionally, all matrix-vector products are performed on the quantum hardware. This hybrid quantum-classical framework achieves an optimal worst-case scaling of $\mathcal{O}(n^2)$ for fully dense LO problems. To ensure high precision, despite the limited accuracy of quantum operations, we incorporate iterative refinement techniques both within and outside the proposed IPM iterations. The proposed algorithm has a quantum complexity of $\mathcal{O}(n^{1.5} κ_A \log(\frac{1}ε))$ queries to QRAM and $\mathcal{O}(n^2 \log(\frac{1}ε))$ classical arithmetic operations. Our method outperforms the worst-case complexity of prior classical and quantum IPMs, offering a significant improvement in scalability and computational efficiency.

quant-pharXiv:2512.04510•IEEE International Conference on Quantum Computing and Engineering (QCE)•Dec 5, 2025•1 citation

Hybrid Quantum-Classical Algorithm for Power Flow Analysis of IEEE 30-bus System using Variational Quantum Linear Solve

Kajornsak Singhun, Siriwat Ninlawat, Thananan Chooseang +2 more

This paper presents a hybrid quantum–classical framework for power flow analysis of the IEEE 30-Bus system using the Variational Quantum Linear Solver (VQLS). While fault-tolerant quantum algorithms such as HHL offer theoretical advantages, their practical implementation remains limited by issues such as state preparation and circuit complexity. To address these challenges, this study adopts VQLS, which is more suitable for Noisy Intermediate-Scale Quantum (NISQ) devices. The linearized power flow equations are reformulated into a quantum-compatible form and solved through a hybrid optimization process that combines parameterized quantum circuits with classical optimization. The framework is implemented using Qiskit and Pandapower and evaluated under both normal operating conditions and N-1 contingency scenarios. The results show that the VQLS-based solver can achieve stable convergence of the cost function. Although convergence becomes slower under line-outage conditions, the algorithm remains capable of approaching a feasible solution. These results indicate that hybrid quantum–classical methods may provide a promising direction for future power system analysis.

International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)•May 1, 2026•0 citations

Acc-VQLS: Accelerated Variational Quantum Linear Solver for VSC Simulation

Shengzhe Chang, Wenliang Nan, Jiyuan Liu +2 more

Voltage source converters (VSCs) play a critical role in modern power systems, where their simulation requires solving linear system problems and remains computationally expensive. Quantum linear system solvers, particularly the variational quantum linear solver (VQLS) tailored for noisy intermediate-scale quantum devices, offer a competitive paradigm with the potential for developing linear solvers with logarithmically scaled computational complexity. We propose Acc-VQLS, a domain-specific quantum algorithm and circuit co-optimization method that accelerates traditional VQLS for VSC simulation. We adopt constant vector-based variational quantum circuits for fast convergence with efficient initial state preparation and employ multi-core processing to parallelize the cost function evaluation and gradient computation. To demonstrate the potential applicability of Acc-VQLS in VSC operating scenarios, we employ the commonly used fault behavior model for VQLS-based VSC simulation. Quantitative experimental evaluations and comparisons across the tested benchmarks show that the proposed Acc-VQLS reduces iterations required for cost function convergence by an average of 82.5%, and our multi-core parallel computing strategy achieves a 53.9 × speedup on the AMD EPYC 9554 CPU. By incorporating a short-circuit fault in the VSC simulation, the proposed Acc-VQLS with error compensation achieves less than 10 − 9 in both the mean absolute error and the root mean square error.

ACM Transactions on Quantum Computing•Jun 18, 2026•0 citations
This paper presents a quantum-enhanced optimization approach for solving optimal power flow (OPF) by integrating the interior point method (IPM) with a coherent variational quantum linear solver (CVQLS). The objective is to explore the applicability of quantum computing to power systems optimization and address the associated challenges. A comparative analysis of state-of-the-art quantum linear solvers—Harrow-Hassidim-Lloyd (HHL), variational quantum linear solver (VQLS), and CVQLS—revealed that CVQLS is most suitable for OPF due to its stability with ill-conditioned matrices, such as the Hessian in IPM. To ensure high-quality solutions, prevent suboptimal convergence, and avoid the barren plateau problem, we propose a quantum circuit parameter initialization technique along with a method to guide the IPM along the central path. Moreover, we design an ansatz tailored for OPF, optimizing the expressibility and trainability of the quantum circuit to ensure efficient convergence and robustness in solving quantum OPF. Various optimizers are also tested for quantum circuit parameter optimization to select the best one. We evaluate our approaches on multiple systems to show their effectiveness in providing reliable OPF solutions. Simulations for the 2-bus system are conducted on a commercial IBMQ quantum device, while simulations for the other larger cases are performed using the IBM quantum simulator. While promising, CVQLS is limited by current quantum hardware, especially for larger systems. We use a quantum noise simulator to test scalability.
Optimal power flow (OPF) solved by an interior-point method (IPM) requires repeatedly solving Newton linear systems. When variational quantum linear solvers (VQLS) are used, each IPM iteration involves an additional nested inner variational optimization loop, which can significantly slow the overall quantum-assisted IPM convergence. To address this challenge, this paper proposes a dual-level trainable quantum IPM framework for OPF that leverages early solver-generated trajectories rather than relying on single-point prediction. The key observation is that early IPM iterates provide informative primal-dual, slack, and barrier-variable evolution about the path to optimality, while early VQLS parameter updates provide useful information about the later variational search. At the quantum-solver level, a trainable parameter model uses a short prefix of the VQLS parameter trajectory to project the remaining variational search toward a lower-cost region. At the OPF-solver level, a second trainable model uses early primal-dual IPM iterates to project a later central path state, which is restored to an admissible point before IPM refinement continues. Simulation studies show that the proposed approach reduces the number of variational updates by up to 95%95\%95% while maintaining OPF objective values close to the classical IPM reference. A 2-bus demonstration on real quantum hardware is also included to validate the implementation of the proposed workflow.
This paper addresses the critical challenge of Op-timal Power Flow (OPF) in electrical engineering, emphasizing the intersection of complexity and technological advancements. Leveraging quantum computation, particularly the Primal-Dual Interior Point Method (PD-IPM) and the Harrow-Hassidim-Lloyd (HHL) algorithm, we explore enhanced solutions for both Alternating Current OPF (ACOPF) and Direct Current OPF (DCOPF). PD-IPM generates linear systems during optimization, aligning with the selected quantum techniques that offer expo-nential speedup. We investigate the scalability and challenges of HHL, emphasizing the current limitations for larger power systems. Additionally, we introduce a hybrid approach that dynamically transitions between quantum and classical methods to optimize convergence. Our study evaluates the proposed methodology's performance under diverse error conditions, em-phasizing its potential to revolutionize solving times for OPF in power systems.
The growing demand for solving large-scale, data-intensive linear and conic optimization problems, particularly in applications such as artificial intelligence and machine learning, has highlighted the limitations of classical interior point methods (IPMs). Despite their favorable polynomial-time convergence, conventional IPMs often suffer from high per-iteration computational costs, especially for dense problem instances. Recent advances in quantum computing, particularly quantum linear system solvers, offer promising avenues to accelerate the most computationally intensive steps of IPMs. However, practical challenges such as quantum error, hardware noise, and sensitivity to poorly conditioned systems remain significant obstacles. In response, a series of Quantum IPMs (QIPMs) has been developed to address these challenges, incorporating techniques such as feasibility maintenance, iterative refinement, and preconditioning. In this work, we review this line of research with a focus on our recent contributions, including an almost-exact QIPM framework. This hybrid quantum-classical approach constructs and solves the Newton system entirely on a quantum computer, while performing solution updates classically. Crucially, all matrix-vector operations are executed on quantum hardware, enabling the method to achieve an optimal worst-case scalability w.r.t dimension, surpassing the scalability of existing classical and quantum IPMs.
The emergence of huge-scale, data-intensive linear optimization (LO) problems in applications such as machine learning has driven the need for more computationally efficient interior point methods (IPMs). While conventional IPMs are polynomial-time algorithms with rapid convergence, their per-iteration cost can be prohibitively high for dense large-scale LO problems. Quantum linear system solvers have shown potential in accelerating the solution of linear systems arising in IPMs. In this work, we introduce a novel almost-exact quantum IPM, where the Newton system is constructed and solved on a quantum computer, while solution updates occur on a classical machine. Additionally, all matrix-vector products are performed on the quantum hardware. This hybrid quantum-classical framework achieves an optimal worst-case scaling of O(n2)\mathcal{O}(n^2)O(n2) for fully dense LO problems. To ensure high precision, despite the limited accuracy of quantum operations, we incorporate iterative refinement techniques both within and outside the proposed IPM iterations. The proposed algorithm has a quantum complexity of O(n1.5κAlog⁡(1ε))\mathcal{O}(n^{1.5} κ_A \log(\frac{1}ε))O(n1.5κA​log(ε1​)) queries to QRAM and O(n2log⁡(1ε))\mathcal{O}(n^2 \log(\frac{1}ε))O(n2log(ε1​)) classical arithmetic operations. Our method outperforms the worst-case complexity of prior classical and quantum IPMs, offering a significant improvement in scalability and computational efficiency.
This paper presents a hybrid quantum–classical framework for power flow analysis of the IEEE 30-Bus system using the Variational Quantum Linear Solver (VQLS). While fault-tolerant quantum algorithms such as HHL offer theoretical advantages, their practical implementation remains limited by issues such as state preparation and circuit complexity. To address these challenges, this study adopts VQLS, which is more suitable for Noisy Intermediate-Scale Quantum (NISQ) devices. The linearized power flow equations are reformulated into a quantum-compatible form and solved through a hybrid optimization process that combines parameterized quantum circuits with classical optimization. The framework is implemented using Qiskit and Pandapower and evaluated under both normal operating conditions and N-1 contingency scenarios. The results show that the VQLS-based solver can achieve stable convergence of the cost function. Although convergence becomes slower under line-outage conditions, the algorithm remains capable of approaching a feasible solution. These results indicate that hybrid quantum–classical methods may provide a promising direction for future power system analysis.
Voltage source converters (VSCs) play a critical role in modern power systems, where their simulation requires solving linear system problems and remains computationally expensive. Quantum linear system solvers, particularly the variational quantum linear solver (VQLS) tailored for noisy intermediate-scale quantum devices, offer a competitive paradigm with the potential for developing linear solvers with logarithmically scaled computational complexity. We propose Acc-VQLS, a domain-specific quantum algorithm and circuit co-optimization method that accelerates traditional VQLS for VSC simulation. We adopt constant vector-based variational quantum circuits for fast convergence with efficient initial state preparation and employ multi-core processing to parallelize the cost function evaluation and gradient computation. To demonstrate the potential applicability of Acc-VQLS in VSC operating scenarios, we employ the commonly used fault behavior model for VQLS-based VSC simulation. Quantitative experimental evaluations and comparisons across the tested benchmarks show that the proposed Acc-VQLS reduces iterations required for cost function convergence by an average of 82.5%, and our multi-core parallel computing strategy achieves a 53.9 × speedup on the AMD EPYC 9554 CPU. By incorporating a short-circuit fault in the VSC simulation, the proposed Acc-VQLS with error compensation achieves less than 10 − 9 in both the mean absolute error and the root mean square error.