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

International Conference on Ambient Intelligence, Knowledge Informatics and Industrial Electronics (AIKIIE)

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

Aayush Sharma, Rashi Sinha, P. V. Manitha

Published Aug 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/aikiie69997.2026.11708004

Related papers

Hybrid quantum-classical optimization of the resource scheduling problem

Tyler Christeson, Md Habib Ullah, Ali Arabnya +2 more

• We propose a new hybrid quantum-classical algorithm for solving the UC problem. • The hybrid model successfully optimizes 24-hour UC systems from 10 to 1000 units. • The model outperforms classical metaheuristics (GA and SA) and classical MINLP. • This represents an improvement over previous QCUC methods, a step to real-world use. Resource scheduling is critical in many industries, especially in power systems where the Unit Commitment (UC) problem determines the on/off status and output levels of generators under physical and economic constraints. Traditional exact methods, such as Branch‑and‑Bound, Branch‑and‑Cut, dynamic programming and mixed‑integer linear programming (MILP), remain the backbone of UC solution techniques, but they often rely on linear approximations or exhaustive search, leading to high computational burdens as system size grows. Metaheuristic approaches, such as genetic algorithms, particle swarm optimization, and other evolutionary methods, have been explored to mitigate this complexity; however, they typically lack optimality guarantees, exhibit sensitivity to initial conditions, and can become prohibitively time‑consuming for large‑scale systems. In this paper, we introduce a quantum‑classical hybrid algorithm for UC, and other resource scheduling problems by extension, that leverages Benders decomposition to decouple binary commitment decisions from continuous economic dispatch. The binary “master problem” is formulated as a quadratic unconstrained binary optimization (QUBO) model and solved on a quantum annealer. The continuous “subproblem,” which minimizes generation costs, with Lagrangian cuts feeding back to the master until convergence. We evaluate our hybrid framework on systems scaled from 10 to 1,000 generation units. Compared against a classical mixed‑integer nonlinear programming (MINLP) baseline, the hybrid algorithm achieves a consistently lower computation‑time growth rate and maintains an absolute optimality gap below 1.63%. These results demonstrate that integrating quantum annealing within a hybrid quantum-classical Benders decomposition loop can significantly accelerate large‑scale resource scheduling without sacrificing solution quality, pointing toward a viable path for addressing the escalating complexity of modern power grids.

arXiv:2511.00733•Next research.•Jan 27, 2026•9 citations

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

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

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

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

Resource-efficient QUBO formulations for the Knapsack and Bin Packing problem

Pim van den Heuvel

Quantum computing approaches, such as Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA), have emerged as promising candidates for solving combinatorial optimization problems. Since these approaches typically work with Quadratic Unconstrained Binary Optimization (QUBO) problems, constraints, when present, are commonly encoded as penalty terms. Conventional approaches to incorporate inequality constraints into QUBO formulations additionally require the introduction of slack variables, increasing the required number of qubits. The Knapsack and Bin Packing problems are optimization problems with such inequality constraints. We show that the number of slack variables required to formulate the Knapsack problem as a QUBO problem can be reduced using certain properties specific to this problem. Moreover, we present two separate strategies for the Knapsack and Bin Packing problems that avoid using the costly slack variables altogether. Instead, both strategies solve several QUBO problems, with varying penalty constants, such that at least one of them is a good representation of the given optimization problem. Numerical simulations of QAOA, as well as experiments on a D-Wave quantum annealer, show that these slack-less approaches can improve performance compared to the conventional slack variable method (in terms of success probability), even when the latter is allowed to vary penalty constants too.

•Jan 1, 2025•0 citations
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.
• We propose a new hybrid quantum-classical algorithm for solving the UC problem. • The hybrid model successfully optimizes 24-hour UC systems from 10 to 1000 units. • The model outperforms classical metaheuristics (GA and SA) and classical MINLP. • This represents an improvement over previous QCUC methods, a step to real-world use. Resource scheduling is critical in many industries, especially in power systems where the Unit Commitment (UC) problem determines the on/off status and output levels of generators under physical and economic constraints. Traditional exact methods, such as Branch‑and‑Bound, Branch‑and‑Cut, dynamic programming and mixed‑integer linear programming (MILP), remain the backbone of UC solution techniques, but they often rely on linear approximations or exhaustive search, leading to high computational burdens as system size grows. Metaheuristic approaches, such as genetic algorithms, particle swarm optimization, and other evolutionary methods, have been explored to mitigate this complexity; however, they typically lack optimality guarantees, exhibit sensitivity to initial conditions, and can become prohibitively time‑consuming for large‑scale systems. In this paper, we introduce a quantum‑classical hybrid algorithm for UC, and other resource scheduling problems by extension, that leverages Benders decomposition to decouple binary commitment decisions from continuous economic dispatch. The binary “master problem” is formulated as a quadratic unconstrained binary optimization (QUBO) model and solved on a quantum annealer. The continuous “subproblem,” which minimizes generation costs, with Lagrangian cuts feeding back to the master until convergence. We evaluate our hybrid framework on systems scaled from 10 to 1,000 generation units. Compared against a classical mixed‑integer nonlinear programming (MINLP) baseline, the hybrid algorithm achieves a consistently lower computation‑time growth rate and maintains an absolute optimality gap below 1.63%. These results demonstrate that integrating quantum annealing within a hybrid quantum-classical Benders decomposition loop can significantly accelerate large‑scale resource scheduling without sacrificing solution quality, pointing toward a viable path for addressing the escalating complexity of modern power grids.
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.
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.
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.
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.
Quantum computing approaches, such as Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA), have emerged as promising candidates for solving combinatorial optimization problems. Since these approaches typically work with Quadratic Unconstrained Binary Optimization (QUBO) problems, constraints, when present, are commonly encoded as penalty terms. Conventional approaches to incorporate inequality constraints into QUBO formulations additionally require the introduction of slack variables, increasing the required number of qubits. The Knapsack and Bin Packing problems are optimization problems with such inequality constraints. We show that the number of slack variables required to formulate the Knapsack problem as a QUBO problem can be reduced using certain properties specific to this problem. Moreover, we present two separate strategies for the Knapsack and Bin Packing problems that avoid using the costly slack variables altogether. Instead, both strategies solve several QUBO problems, with varying penalty constants, such that at least one of them is a good representation of the given optimization problem. Numerical simulations of QAOA, as well as experiments on a D-Wave quantum annealer, show that these slack-less approaches can improve performance compared to the conventional slack variable method (in terms of success probability), even when the latter is allowed to vary penalty constants too.