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:2110.12624 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Adapting Quantum Approximation Optimization Algorithm (QAOA) for Unit Commitment

Samantha Koretsky, Pranav Gokhale, Jonathan M. Baker, Joshua Viszlai, Honghao Zheng, Niroj Gurung, Ryan Burg, Esa Aleksi Paaso, Amin Khodaei, Rozhin Eskandarpour, Frederic T. Chong

Published Oct 1, 2021• 56 citations
arXivHTMLPDF

Abstract

In the present Noisy Intermediate-Scale Quantum (NISQ), hybrid algorithms that leverage classical resources to reduce quantum costs are particularly appealing. We formulate and apply such a hybrid quantum-classical algorithm to a power system optimization problem called Unit Commitment, which aims to satisfy a target power load at minimal cost. Our algorithm extends the Quantum Approximation Optimization Algorithm (QAOA) with a classical minimizer in order to support mixed binary optimization. Using Qiskit, we simulate results for sample systems to validate the effectiveness of our approach. We also compare to purely classical methods. Our results indicate that classical solvers are effective for our simulated Unit Commitment instances with fewer than 400 power generation units. However, for larger problem instances, the classical solvers either scale exponentially in runtime or must resort to coarse approximations. This opens the door to potential quantum advantage for systems with several hundred units, though quantum error correction may be necessary at this scale.

DOI
10.1109/qce52317.2021.00035

Related papers

Hybrid Quantum-Classical Unit Commitment

Reza Mahroo, Amin Kargarian

This paper proposes a hybrid quantum-classical algorithm to solve a fundamental power system problem called unit commitment (UC). The UC problem is decomposed into a quadratic subproblem, a quadratic unconstrained binary optimization (QUBO) subproblem, and an unconstrained quadratic subproblem. A classical optimization solver solves the first and third subproblems, while the QUBO subproblem is solved by a quantum algorithm called quantum approximate optimization algorithm (QAOA). The three subproblems are then coordinated iteratively using a three-block alternating direction method of multipliers algorithm. Using Qiskit on the IBM Q system as the simulation environment, simulation results demonstrate the validity of the proposed algorithm to solve the UC problem.

arXiv:2201.03701•IEEE Texas Power and Energy Conference (TPEC)•Feb 28, 2022•22 citations

Benchmarking Hybrid Quantum-Classical Algorithms for Power Grid Optimization Problems

Igor Gaidai, Rick Mukherjee

Alternating Current Optimal Power Flow Unit Commitment (AC-OPF-UC) is a difficult mixed-integer nonlinear optimization problem that combines binary generator commitment decisions with nonconvex continuous AC power-flow constraints. In this work, we investigate whether hybrid quantum-classical variational algorithms can improve the solution of single-period AC-OPF-UC relative to classical approaches. To the best of our knowledge, this is the first study to directly evaluate quantum or hybrid quantum-classical algorithms for the full AC-OPF-UC problem. We consider two candidate algorithms for improving AC-OPF-UC solution quality relative to purely classical methods on ideal quantum hardware. The first applies QAOA directly to a fully discretized formulation of the problem, with equality and inequality constraints incorporated through penalty terms and slack variables. Although conceptually straightforward, this approach requires a prohibitively large number of qubits even for small instances. The second, qubit-efficient approach encodes only the binary generator status variables on a quantum computer, while optimizing the continuous power-flow variables classically for each sampled bitstring. We benchmark this method on randomly generated AC-OPF-UC instances with 5 to 13 generators and compare it against SCIP, SMAC, and uniform random sampling. Our simulations show that the qubit-efficient hybrid method does not outperform uniform sampling. These results suggest that in order to establish potential advantage of the variational hybrid strategy considered here over the best classical algorithms, if any, much larger system sizes (25+ generators) need to be tested, which is beyond our computational capacity. Alternatively, different approaches, such as quantum versions of branch-and-bound methods, may be more promising.

quant-pharXiv:2607.15543•Scientific Reports•Jul 20, 2026•1 citation

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Willie Aboumrad, Phani R V Marthi, Suman Debnath +2 more

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•7 citations

Scaling Quantum Optimization for Unit Commitment via Pauli Correlation Encoding

Kien X. Nguyen, Ilya Safro, Xiaoyuan Liu

Unit commitment is an important optimization problem in power system operations, classified as NP-hard. This paper presents a hybrid quantum-classical method for the unit commitment problem with time-dependent constraints, where decisions must be made about which generators to turn on/off and how much power they should produce over a planning horizon. We use a hybrid quantum-classical optimization procedure to determine the on/off schedules of the generating units and the corresponding power dispatch that satisfies operational constraints such as load balance, generator limits, ramping, and reserve requirements. We frame the optimization loop as a leader-follower structure, where the quantum optimizer leads to give the on/off decisions, and the classical optimizer follows to produce the power level schedule. Leveraging Pauli-Correlation Encoding, our method scales to horizon-wide unit commitment schedules by encoding the binary variables with far fewer qubits. By combining these components, the method can handle multi-period settings while using far fewer qubits than straightforward quantum encodings that allocate one qubit per decision variable as in prior approaches. We evaluate the approach on both small- and large-scale instances, up to 312 binary variables, and show that it reliably produces feasible schedules with competitive operating costs.

quant-pharXiv:2605.17145•May 19, 2026•2 citations

A hybrid classical-quantum approach to highly constrained Unit Commitment problems

Salgado, Bruna, André Sequeira, Luís Paulo Santos

The unit commitment (UC) problem stands as a critical optimization challenge in the electrical power industry. It is classified as NP-hard, placing it among the most intractable problems to solve. This paper introduces a novel hybrid quantum-classical algorithm designed to efficiently (approximately) solve the UC problem in polynomial time. In this approach, the UC problem is decomposed into two subproblems: a QUBO (Quadratic Unconstrained Binary Optimization) problem and a quadratic optimization problem. The algorithm employs the Quantum Approximate Optimization Algorithm (QAOA) to identify the optimal unit combination and classical methods to determine individual unit powers. The proposed hybrid algorithm is the first to include both the spinning reserve constraint (thus improving its applicability to real-world scenarios) and to explore QAOA warm-start optimization in this context. The effectiveness of this optimization was illustrated for specific instances of the UC problem, not only in terms of solution accuracy but also by reducing the number of iterations required for QAOA convergence. Hybrid solutions achieved using a single-layer warm-start QAOA (p=1) are within a 5.1 % margin of the reference (approximate) classical solution, while guaranteeing polynomial time complexity on the number of power generation units and time intervals.

arXiv:2412.11312•Dec 15, 2024•10 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
In the present Noisy Intermediate-Scale Quantum (NISQ), hybrid algorithms that leverage classical resources to reduce quantum costs are particularly appealing. We formulate and apply such a hybrid quantum-classical algorithm to a power system optimization problem called Unit Commitment, which aims to satisfy a target power load at minimal cost. Our algorithm extends the Quantum Approximation Optimization Algorithm (QAOA) with a classical minimizer in order to support mixed binary optimization. Using Qiskit, we simulate results for sample systems to validate the effectiveness of our approach. We also compare to purely classical methods. Our results indicate that classical solvers are effective for our simulated Unit Commitment instances with fewer than 400 power generation units. However, for larger problem instances, the classical solvers either scale exponentially in runtime or must resort to coarse approximations. This opens the door to potential quantum advantage for systems with several hundred units, though quantum error correction may be necessary at this scale.
This paper proposes a hybrid quantum-classical algorithm to solve a fundamental power system problem called unit commitment (UC). The UC problem is decomposed into a quadratic subproblem, a quadratic unconstrained binary optimization (QUBO) subproblem, and an unconstrained quadratic subproblem. A classical optimization solver solves the first and third subproblems, while the QUBO subproblem is solved by a quantum algorithm called quantum approximate optimization algorithm (QAOA). The three subproblems are then coordinated iteratively using a three-block alternating direction method of multipliers algorithm. Using Qiskit on the IBM Q system as the simulation environment, simulation results demonstrate the validity of the proposed algorithm to solve the UC problem.
Alternating Current Optimal Power Flow Unit Commitment (AC-OPF-UC) is a difficult mixed-integer nonlinear optimization problem that combines binary generator commitment decisions with nonconvex continuous AC power-flow constraints. In this work, we investigate whether hybrid quantum-classical variational algorithms can improve the solution of single-period AC-OPF-UC relative to classical approaches. To the best of our knowledge, this is the first study to directly evaluate quantum or hybrid quantum-classical algorithms for the full AC-OPF-UC problem. We consider two candidate algorithms for improving AC-OPF-UC solution quality relative to purely classical methods on ideal quantum hardware. The first applies QAOA directly to a fully discretized formulation of the problem, with equality and inequality constraints incorporated through penalty terms and slack variables. Although conceptually straightforward, this approach requires a prohibitively large number of qubits even for small instances. The second, qubit-efficient approach encodes only the binary generator status variables on a quantum computer, while optimizing the continuous power-flow variables classically for each sampled bitstring. We benchmark this method on randomly generated AC-OPF-UC instances with 5 to 13 generators and compare it against SCIP, SMAC, and uniform random sampling. Our simulations show that the qubit-efficient hybrid method does not outperform uniform sampling. These results suggest that in order to establish potential advantage of the variational hybrid strategy considered here over the best classical algorithms, if any, much larger system sizes (25+ generators) need to be tested, which is beyond our computational capacity. Alternatively, different approaches, such as quantum versions of branch-and-bound methods, may be more promising.
Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.
Unit commitment is an important optimization problem in power system operations, classified as NP-hard. This paper presents a hybrid quantum-classical method for the unit commitment problem with time-dependent constraints, where decisions must be made about which generators to turn on/off and how much power they should produce over a planning horizon. We use a hybrid quantum-classical optimization procedure to determine the on/off schedules of the generating units and the corresponding power dispatch that satisfies operational constraints such as load balance, generator limits, ramping, and reserve requirements. We frame the optimization loop as a leader-follower structure, where the quantum optimizer leads to give the on/off decisions, and the classical optimizer follows to produce the power level schedule. Leveraging Pauli-Correlation Encoding, our method scales to horizon-wide unit commitment schedules by encoding the binary variables with far fewer qubits. By combining these components, the method can handle multi-period settings while using far fewer qubits than straightforward quantum encodings that allocate one qubit per decision variable as in prior approaches. We evaluate the approach on both small- and large-scale instances, up to 312 binary variables, and show that it reliably produces feasible schedules with competitive operating costs.
The unit commitment (UC) problem stands as a critical optimization challenge in the electrical power industry. It is classified as NP-hard, placing it among the most intractable problems to solve. This paper introduces a novel hybrid quantum-classical algorithm designed to efficiently (approximately) solve the UC problem in polynomial time. In this approach, the UC problem is decomposed into two subproblems: a QUBO (Quadratic Unconstrained Binary Optimization) problem and a quadratic optimization problem. The algorithm employs the Quantum Approximate Optimization Algorithm (QAOA) to identify the optimal unit combination and classical methods to determine individual unit powers. The proposed hybrid algorithm is the first to include both the spinning reserve constraint (thus improving its applicability to real-world scenarios) and to explore QAOA warm-start optimization in this context. The effectiveness of this optimization was illustrated for specific instances of the UC problem, not only in terms of solution accuracy but also by reducing the number of iterations required for QAOA convergence. Hybrid solutions achieved using a single-layer warm-start QAOA (p=1) are within a 5.1 % margin of the reference (approximate) classical solution, while guaranteeing polynomial time complexity on the number of power generation units and time intervals.
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.