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:2502.15917 · IEEE Transactions on Power Systems

Qubit-Efficient Quantum Annealing for Stochastic Unit Commitment

Wei Jun Hong, Wangkun Xu, Fei Teng

Published Jun 23, 2026• 14 citations
arXivHTMLPDF

Abstract

Stochastic Unit Commitment (SUC) has been proposed to manage the uncertainties driven by renewable integration, but it leads to significant computational complexity. When accelerated by Benders Decomposition (BD), the master problem becomes binary integer programming, which is still NP-hard and computationally demanding for classical methods. Quantum Annealing (QA), known for efficiently solving Quadratic Unconstrained Binary Optimization (QUBO) problems, presents a potential solution. However, existing quantum algorithms rely on slack variables to handle linear binary inequality constraints, leading to increased qubit consumption and reduced computational efficiency. To solve the problem, this paper introduces the Powell-Hestenes-Rockafellar Augmented Lagrangian Multiplier (PHR-ALM) method to eliminate the need for slack variables, making qubit consumption independent of the increasing number of Benders cuts. To further reduce the qubit overhead, quantum ADMM is applied to break large-scale SUC into smaller blocks for sequential solutions, which does not scale with the number of generators. Finally, the simulation results on both 4-generator and the IEEE bus-118 systems demonstrate the feasibility and scalability of the proposed algorithm, indicating its superior qubit and runtime efficiency over classical and baseline quantum approaches on the D-Wave QPU platform.

DOI
10.1109/tpwrs.2026.3706404

Related papers

Toward Fast Quantum-Classical Hybrid Benders Decomposition for the SCUC Problem: An Efficient Approximate Formulation of QUBOs

Xiaodong Zheng, Jiahua Yang, Baorong Zhou

Mixed-integer linear programs (MILPs) are fundamental to power system operations but are challenging to solve due to their NP-hard nature. Quantum annealing, which seeks to find the ground state of an Ising model–a minimization of a quadratic binary function–offers potential speedups for solving combinatorial optimization problems. However, converting MILPs into quadratic unconstrained binary optimization (QUBO) problems often requires lots of slack variables, leading to significant qubit overhead and limiting the capability of quantum annealers. In this work, we propose an efficient formulation approach that generates a QUBO representation of a targeted MILP without introducing auxiliary binary variables. Geometrically, our method approximates the value function of the MILP with a quadratic binary function leveraging a simple convex optimization subroutine. We prove the existence of the QUBO representation, which preserves the MILP’s optimal solution and objective value with the same number of binary variables. The proposed approach is validated on several instances of the security-constrained unit commitment (SCUC) problem, with test cases featuring up to 288 binary variables, demonstrating its efficacy in reducing qubit overhead for quantum-classical hybrid Benders decomposition frameworks.

IEEE Power Engineering Society General Meeting•Jul 27, 2025•1 citation

Towards Quantum Stochastic Optimization for Energy Systems under Uncertainty: Joint Chance Constraints with Quantum Annealing

David Ribes, Tatiana Gonzalez Grandon

Uncertainty is fundamental in modern power systems, where renewable generation and fluctuating demand make stochastic optimization indispensable. The chance constrained unit commitment problem (UCP) captures this uncertainty but rapidly becomes computationally challenging as the number of scenarios grows. Quantum computing has been proposed as a potential route to overcome such scaling barriers. In this work, we evaluate the applicability of quantum annealing platforms to the chance constrained UCP. Focusing on a scenario approximation, we reformulated the problem as a mixed integer linear program and solved it using DWave hybrid quantum classical solver alongside Gurobi. The hybrid solver proved competitive under strict runtime limits for large scenario sets (15,000 in our experiments), while Gurobi remained superior on smaller cases. QUBO reformulations were also tested, but current annealers cannot accommodate stochastic UCPs due to hardware limits, and deterministic cases suffered from embedding overhead. Our study delineates where chance constrained UCPs can already be addressed with hybrid quantum classical methods, and where current quantum annealers remain fundamentally limited.

quant-pharXiv:2512.03925•Journal of Mathematics in Industry•Dec 4, 2025•3 citations

On Revolutionizing Power Systems: Suitability of Quantum Computing-Ready Pipelines for Stochastic Unit Commitment Optimization

Ying‐Yi Hong, Dylan Josh Domingo Lopez

Modern unit commitment (UC) scenarios, particularly those involving uncertainties from demand fluctuations and renewable energy sources, pose significant challenges to traditional optimization methods due to the large search spaces they encompass. This article proposes a quantum computing-ready optimization pipeline for deterministic and stochastic UC, integrating classical, quantum-inspired, quantum annealing, and hybrid quantum-classical solvers across test systems, including the IEEE 118-bus system. A novel Quadratic unconstrained binary optimization (QUBO) reformulation accommodates generator scaling and 24-hour scheduling horizons with compact Boolean logic penalties for startup, cooldown, and spinning reserve constraints. A divide-and-conquer strategy and quantum computing Monte Carlo (QCMC) simulation address scalability across 27 730 uncertainty scenarios, reducing compilation time by up to two orders of magnitude. Experimental results demonstrate the pipeline’s ability to achieve efficient, scalable, and accurate UC optimization under uncertainty: the hybrid quantum method approach matches the classical baseline, reduces stochastic UC runtime from 40.76 to 14.79 h, and characterizes pure quantum annealing as limited to small systems with 0.22% to 2.18% encoding errors and constraint violations. These results provide an analysis of the scalability and computational practicality of hybrid quantum optimization for generator scheduling in UC.

arXiv:2611.05030•IEEE Transactions on Industrial Informatics•Jul 9, 2026•0 citations

Quantum Annealing for Optimizing Unit Scheduling in Renewable Energy Systems: Formulation and Evaluation

Sven Müller, M. Dukalski, Frank Phillipson

This paper investigates the use of Quantum Annealing (QA) devices for optimizing unit scheduling in renewable energy systems, addressing the challenge of energy balancing with intermittent generation. We compare two approaches for encoding inequality constraints in Quadratic Unconstrained Binary Optimization (QUBO) formulations: (a) the conventional slack-variable-based method and (b) a novel soft-encoding technique called unbalanced penalization. This first application of unbalanced penalization in the energy and power systems domain, aims to disseminate knowledge about near-term applications of quantum-computing and how to make best use of it within the community. Through computational experiments, we find thatUnbalanced Penalizationconsistently outperforms the conventional method of using slack variables by reducing the number of variables in the QUBO formulation. Despite this, its inherent nature penalizes feasible solutions unevenly, preventing the ability to handle much larger problem sizes. More broadly, we observe that both methods-like most pure quantum approaches-struggle with scalability on current QA hardware, as solution quality declines with increasing problem size. In light of these limitations, we assess the feasibility of purely quantum solutions and argue that hybrid approaches remain the most practical path forward.

IEEE Transactions on Power Systems•Aug 21, 2025•4 citations

A Penalty-Based QUBO Formulation for Quantum Unit Commitment: Mitigating Slack Variable Constraints in QAOA

Aayush Sharma, Rashi Sinha, P. V. Manitha

The advent of renewable integration to modernize the electric grid has introduced unprecedented complexities in power system operation. Solving the Unit Commitment (UC) problem requires searching vast combinatorial spaces that usually limit classical deterministic solvers. This paper presents a Hybrid Quantum-Classical Framework for solving the UC problem with a rigid Quadratic Unconstrained Binary Optimization (QUBO) formulation. The results of a classical metaheuristic solver (Simulated Annealing) were benchmarked against a variational quantum algorithm (QAOA) implemented with IBM Qiskit. The framework was tested on the standard IEEE 14-Bus system. To accommodate current quantum hardware limits, the quantum execution was localized to a 3-hour, 215statespace peak-load window. Within this comparative window, the classical solver outperformed on execution time (1.2 s) and cost (Rs. 65,000). However, the QAOA implementation (Rs. 69,000 within 45.5 s) provided a mathematically viable pathway for quantum-native grid dispatch. Furthermore, this paper highlights quantum hardware scaling issues caused by inequality-driven slack variables, developing a strict quadratic penalty approach to eliminate auxiliary variables and formulate an initial framework for future quantum grid utility control.

International Conference on Ambient Intelligence, Knowledge Informatics and Industrial Electronics (AIKIIE)•Aug 1, 2026•0 citations

Machine Learning–Enhanced Quantum–Classical Benders Decomposition for Stochastic Unit Commitment

Reza Mahroo, Amin Kargarian

This paper proposes a learning-based quantum-classical Benders decomposition method for solving large-scale two-stage stochastic unit commitment (UC) problems. The approach integrates a long short-term memory (LSTM) network to approximate subproblem costs and a support vector machine (SVM) classifier to filter dominant Benders cuts, thereby reducing problem size, facilitating quantum computing implementation, and improving scalability. The master problem is reformulated into a quadratic unconstrained binary optimization (QUBO) problem, enabling its solution on quantum hardware. The key contributions are: (i) a quantum-classical decomposition framework tailored for stochastic UC, (ii) an LSTM-based subproblem proxy to facilitate iterations, (iii) an SVM-based cut filtering method to retain only dominant cuts, and (iv) a QUBO reformulation suitable for quantum solvers. Numerical experiments demonstrate that the proposed method significantly reduces computational overhead and quantum resource requirements compared with conventional approaches.

IEEE Transactions on Power Systems•Jan 14, 2026•2 citations
Stochastic Unit Commitment (SUC) has been proposed to manage the uncertainties driven by renewable integration, but it leads to significant computational complexity. When accelerated by Benders Decomposition (BD), the master problem becomes binary integer programming, which is still NP-hard and computationally demanding for classical methods. Quantum Annealing (QA), known for efficiently solving Quadratic Unconstrained Binary Optimization (QUBO) problems, presents a potential solution. However, existing quantum algorithms rely on slack variables to handle linear binary inequality constraints, leading to increased qubit consumption and reduced computational efficiency. To solve the problem, this paper introduces the Powell-Hestenes-Rockafellar Augmented Lagrangian Multiplier (PHR-ALM) method to eliminate the need for slack variables, making qubit consumption independent of the increasing number of Benders cuts. To further reduce the qubit overhead, quantum ADMM is applied to break large-scale SUC into smaller blocks for sequential solutions, which does not scale with the number of generators. Finally, the simulation results on both 4-generator and the IEEE bus-118 systems demonstrate the feasibility and scalability of the proposed algorithm, indicating its superior qubit and runtime efficiency over classical and baseline quantum approaches on the D-Wave QPU platform.
Mixed-integer linear programs (MILPs) are fundamental to power system operations but are challenging to solve due to their NP-hard nature. Quantum annealing, which seeks to find the ground state of an Ising model–a minimization of a quadratic binary function–offers potential speedups for solving combinatorial optimization problems. However, converting MILPs into quadratic unconstrained binary optimization (QUBO) problems often requires lots of slack variables, leading to significant qubit overhead and limiting the capability of quantum annealers. In this work, we propose an efficient formulation approach that generates a QUBO representation of a targeted MILP without introducing auxiliary binary variables. Geometrically, our method approximates the value function of the MILP with a quadratic binary function leveraging a simple convex optimization subroutine. We prove the existence of the QUBO representation, which preserves the MILP’s optimal solution and objective value with the same number of binary variables. The proposed approach is validated on several instances of the security-constrained unit commitment (SCUC) problem, with test cases featuring up to 288 binary variables, demonstrating its efficacy in reducing qubit overhead for quantum-classical hybrid Benders decomposition frameworks.
Uncertainty is fundamental in modern power systems, where renewable generation and fluctuating demand make stochastic optimization indispensable. The chance constrained unit commitment problem (UCP) captures this uncertainty but rapidly becomes computationally challenging as the number of scenarios grows. Quantum computing has been proposed as a potential route to overcome such scaling barriers. In this work, we evaluate the applicability of quantum annealing platforms to the chance constrained UCP. Focusing on a scenario approximation, we reformulated the problem as a mixed integer linear program and solved it using DWave hybrid quantum classical solver alongside Gurobi. The hybrid solver proved competitive under strict runtime limits for large scenario sets (15,000 in our experiments), while Gurobi remained superior on smaller cases. QUBO reformulations were also tested, but current annealers cannot accommodate stochastic UCPs due to hardware limits, and deterministic cases suffered from embedding overhead. Our study delineates where chance constrained UCPs can already be addressed with hybrid quantum classical methods, and where current quantum annealers remain fundamentally limited.
Modern unit commitment (UC) scenarios, particularly those involving uncertainties from demand fluctuations and renewable energy sources, pose significant challenges to traditional optimization methods due to the large search spaces they encompass. This article proposes a quantum computing-ready optimization pipeline for deterministic and stochastic UC, integrating classical, quantum-inspired, quantum annealing, and hybrid quantum-classical solvers across test systems, including the IEEE 118-bus system. A novel Quadratic unconstrained binary optimization (QUBO) reformulation accommodates generator scaling and 24-hour scheduling horizons with compact Boolean logic penalties for startup, cooldown, and spinning reserve constraints. A divide-and-conquer strategy and quantum computing Monte Carlo (QCMC) simulation address scalability across 27 730 uncertainty scenarios, reducing compilation time by up to two orders of magnitude. Experimental results demonstrate the pipeline’s ability to achieve efficient, scalable, and accurate UC optimization under uncertainty: the hybrid quantum method approach matches the classical baseline, reduces stochastic UC runtime from 40.76 to 14.79 h, and characterizes pure quantum annealing as limited to small systems with 0.22% to 2.18% encoding errors and constraint violations. These results provide an analysis of the scalability and computational practicality of hybrid quantum optimization for generator scheduling in UC.
This paper investigates the use of Quantum Annealing (QA) devices for optimizing unit scheduling in renewable energy systems, addressing the challenge of energy balancing with intermittent generation. We compare two approaches for encoding inequality constraints in Quadratic Unconstrained Binary Optimization (QUBO) formulations: (a) the conventional slack-variable-based method and (b) a novel soft-encoding technique called unbalanced penalization. This first application of unbalanced penalization in the energy and power systems domain, aims to disseminate knowledge about near-term applications of quantum-computing and how to make best use of it within the community. Through computational experiments, we find thatUnbalanced Penalizationconsistently outperforms the conventional method of using slack variables by reducing the number of variables in the QUBO formulation. Despite this, its inherent nature penalizes feasible solutions unevenly, preventing the ability to handle much larger problem sizes. More broadly, we observe that both methods-like most pure quantum approaches-struggle with scalability on current QA hardware, as solution quality declines with increasing problem size. In light of these limitations, we assess the feasibility of purely quantum solutions and argue that hybrid approaches remain the most practical path forward.
The advent of renewable integration to modernize the electric grid has introduced unprecedented complexities in power system operation. Solving the Unit Commitment (UC) problem requires searching vast combinatorial spaces that usually limit classical deterministic solvers. This paper presents a Hybrid Quantum-Classical Framework for solving the UC problem with a rigid Quadratic Unconstrained Binary Optimization (QUBO) formulation. The results of a classical metaheuristic solver (Simulated Annealing) were benchmarked against a variational quantum algorithm (QAOA) implemented with IBM Qiskit. The framework was tested on the standard IEEE 14-Bus system. To accommodate current quantum hardware limits, the quantum execution was localized to a 3-hour, 215statespace peak-load window. Within this comparative window, the classical solver outperformed on execution time (1.2 s) and cost (Rs. 65,000). However, the QAOA implementation (Rs. 69,000 within 45.5 s) provided a mathematically viable pathway for quantum-native grid dispatch. Furthermore, this paper highlights quantum hardware scaling issues caused by inequality-driven slack variables, developing a strict quadratic penalty approach to eliminate auxiliary variables and formulate an initial framework for future quantum grid utility control.
This paper proposes a learning-based quantum-classical Benders decomposition method for solving large-scale two-stage stochastic unit commitment (UC) problems. The approach integrates a long short-term memory (LSTM) network to approximate subproblem costs and a support vector machine (SVM) classifier to filter dominant Benders cuts, thereby reducing problem size, facilitating quantum computing implementation, and improving scalability. The master problem is reformulated into a quadratic unconstrained binary optimization (QUBO) problem, enabling its solution on quantum hardware. The key contributions are: (i) a quantum-classical decomposition framework tailored for stochastic UC, (ii) an LSTM-based subproblem proxy to facilitate iterations, (iii) an SVM-based cut filtering method to retain only dominant cuts, and (iv) a QUBO reformulation suitable for quantum solvers. Numerical experiments demonstrate that the proposed method significantly reduces computational overhead and quantum resource requirements compared with conventional approaches.