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

IEEE Transactions on Power Systems

A Fast Quantum Algorithm for Searching the Quasi-Optimal Solutions of Unit Commitment

Xiaodong Zheng, Jianhui Wang, Meng Yue

Published Jan 5, 2024• 22 citations
Publisher

Abstract

The electric power industry faces tough optimization problems that are challenging for classical computers, e.g., the unit commitment (UC). Quantum computing has the potential to provide a speedup for combinatorial optimization problems utilizing ad hoc algorithms like Grover's search algorithm. The quantum oracle is indispensable for Grover's search, yet it is difficult to realize. In this letter, we develop a way to construct efficient oracles for solving UC problems in Grover's framework. The oracle features a physics-informed circuit and a variational quantum circuit picking up good solutions. A quantum algorithm that leverages the oracle is then proposed, which could reduce the number of tractable linear programming subproblems required to solve the targeted UC problem when working in conjugation with classical computers. The oracle and algorithm are validated by results obtained on real quantum hardware and simulators.

DOI
10.1109/tpwrs.2024.3350382

Related papers

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 Generalizable Variational Quantum Oracle with Angle-Embedded Load Profiles for Grover Search Based Unit Commitment

Yubin Ma, Xiaodong Zheng

Security-Constrained Unit Commitment (SCUC) is the core optimization problem for day-ahead clearing of electricity spot markets. With the decision-making dimensions and constraint complexity of the SCUC problem increasing exponentially, conventional algorithms are confronted with a severe curse of dimensionality. By constructing the Oracle based on quantum machine learning (QML), Grover search leverages the intrinsic properties of quantum superposition and entanglement to deliver a quadratic speedup for this class of NP-hard combinatorial optimization problems, which is unattainable with traditional machine learning methods. Existing Grover-search-based quantum algorithms for unit commitment typically rely on basis encoding to construct quantum oracles using variational quantum circuits (VQCs). However, binary basis states are mutually orthogonal and contain little structural information, which limits the expressive power of the VQC and restricts its ability to generalize across diverse load profiles in electricity markets. To address this issue, this paper proposes a hybrid embedding strategy for quantum oracle training within a Grover search framework. By introducing angle encoding to represent the temporal characteristics of load curves, structured load information is embedded into the VQC, improving the representation capacity and generalization capability of the quantum oracle. Numerical simulations and experiments on real quantum hardware demonstrate the effectiveness and generalization capability of the proposed variational quantum oracle.

IEEE International Symposium on the Application of Artificial Intelligence in Electrical Engineering (AAIEE)•Apr 1, 2026•0 citations

A Survey on Applications of Quantum Computing for Unit Commitment

Milad Hasanzadeh, Ali Rajabi, Amin Kargarian

Unit Commitment (UC) is a core optimization problem in power system operation and electricity market scheduling. It determines the optimal on/off status and dispatch of generating units while satisfying system, operational, and market constraints. Traditionally, UC has been solved using mixed-integer programming, dynamic programming, or metaheuristic methods, all of which face scalability challenges as systems grow in size and uncertainty. Recent advances in quantum computing, spanning quantum annealing, variational algorithms, and hybrid quantum classical optimization, have opened new opportunities to accelerate UC solution processes by exploiting quantum parallelism and entanglement. This paper presents a comprehensive survey of existing research on the applications of quantum computing for solving the UC problem. The reviewed works are categorized based on the employed quantum paradigms, including annealing-based, variational hybrid, quantum machine learning, and quantum-inspired methods. Key modeling strategies, hardware implementations, and computational trade-offs are discussed, highlighting the current progress, limitations, and potential future directions for large-scale quantum-enabled UC.

quant-pharXiv:2601.01777•Southeast Symposium on Contemporary Engineering Topics (SSCET)•Jan 6, 2026•6 citations

A Novel Integrated Quantum Computing Approach for Unit Commitment

Bing Yan, Junpeng Zhan, Obumneme Umeonwuka +7 more

The transition toward a decarbonized power grid introduces increasing operational complexity driven by variable renewable, distributed energy resources, electric vehicles, and energy storage resources. These dynamics require rapid and efficient solutions to the Unit Commitment (UC) problem, which classical computing may struggle. Quantum Computing (QC) offers a promising alternative by exploiting qubits’ exponential information capacity to accelerate large-scale optimization. This paper presents a novel integrated QC-based approach to solve UC through synergistic integration of Quantum Feasibility Labeling (QFL), Variational Quantum Search (VQS), and Quantum Global Minimum Finder (QGMF). It enhances feasible-state identification and global optimum discovery, addressing the limitations of existing algorithms such as the Quantum Approximate Optimization Algorithm. Two illustrative UC case studies are used to demonstrate the approach. Results indicate that the combined QFL-VQS-QGMF framework can identify the optimal UC solution accurately. This work highlights the potential of hybrid quantum–classical optimization as a foundational step toward scalable quantum solutions for future grid operations.

IEEE Power Engineering Society General Meeting•Jul 1, 2026•0 citations

Implementation of Efficient Quantum Computing Algorithm for Searching

Nirhali Atharva, Malwade Rohit, P. Akshay +2 more

The K-SAT problem is a fundamental challenge in computational theory, widely used in artificial intelligence, cryptography, and optimization. Classical algorithms struggle with exponential time complexity, making them inefficient for large-scale instances. In this research, we propose an efficient quantum computing approach based on Grover’s algorithm to enhance the search process for satisfiable solutions in K-SAT problems. Our implementation leverages quantum superposition and amplitude amplification to explore multiple possible solutions simultaneously, reducing the search complexity from O (2ⁿ) in classical methods to O(√2ⁿ) in quantum computing. We design a quantum oracle that encodes the K-SAT clauses and integrates it into Grover’s iterative search framework. The performance is evaluated through Qiskit simulations, demonstrating a significant improvement in search efficiency compared to classical brute-force techniques. The results highlight the potential of quantum algorithms in solving complex combinatorial problems with enhanced speed and accuracy. This study contributes to the development of quantum-accelerated optimization methods, paving the way for real-world applications in machine learning, cryptanalysis, and large-scale data processing.

International Research Journal on Advanced Engineering Hub (IRJAEH)•May 21, 2025•0 citations

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
The electric power industry faces tough optimization problems that are challenging for classical computers, e.g., the unit commitment (UC). Quantum computing has the potential to provide a speedup for combinatorial optimization problems utilizing ad hoc algorithms like Grover's search algorithm. The quantum oracle is indispensable for Grover's search, yet it is difficult to realize. In this letter, we develop a way to construct efficient oracles for solving UC problems in Grover's framework. The oracle features a physics-informed circuit and a variational quantum circuit picking up good solutions. A quantum algorithm that leverages the oracle is then proposed, which could reduce the number of tractable linear programming subproblems required to solve the targeted UC problem when working in conjugation with classical computers. The oracle and algorithm are validated by results obtained on real quantum hardware and simulators.
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.
Security-Constrained Unit Commitment (SCUC) is the core optimization problem for day-ahead clearing of electricity spot markets. With the decision-making dimensions and constraint complexity of the SCUC problem increasing exponentially, conventional algorithms are confronted with a severe curse of dimensionality. By constructing the Oracle based on quantum machine learning (QML), Grover search leverages the intrinsic properties of quantum superposition and entanglement to deliver a quadratic speedup for this class of NP-hard combinatorial optimization problems, which is unattainable with traditional machine learning methods. Existing Grover-search-based quantum algorithms for unit commitment typically rely on basis encoding to construct quantum oracles using variational quantum circuits (VQCs). However, binary basis states are mutually orthogonal and contain little structural information, which limits the expressive power of the VQC and restricts its ability to generalize across diverse load profiles in electricity markets. To address this issue, this paper proposes a hybrid embedding strategy for quantum oracle training within a Grover search framework. By introducing angle encoding to represent the temporal characteristics of load curves, structured load information is embedded into the VQC, improving the representation capacity and generalization capability of the quantum oracle. Numerical simulations and experiments on real quantum hardware demonstrate the effectiveness and generalization capability of the proposed variational quantum oracle.
Unit Commitment (UC) is a core optimization problem in power system operation and electricity market scheduling. It determines the optimal on/off status and dispatch of generating units while satisfying system, operational, and market constraints. Traditionally, UC has been solved using mixed-integer programming, dynamic programming, or metaheuristic methods, all of which face scalability challenges as systems grow in size and uncertainty. Recent advances in quantum computing, spanning quantum annealing, variational algorithms, and hybrid quantum classical optimization, have opened new opportunities to accelerate UC solution processes by exploiting quantum parallelism and entanglement. This paper presents a comprehensive survey of existing research on the applications of quantum computing for solving the UC problem. The reviewed works are categorized based on the employed quantum paradigms, including annealing-based, variational hybrid, quantum machine learning, and quantum-inspired methods. Key modeling strategies, hardware implementations, and computational trade-offs are discussed, highlighting the current progress, limitations, and potential future directions for large-scale quantum-enabled UC.
The transition toward a decarbonized power grid introduces increasing operational complexity driven by variable renewable, distributed energy resources, electric vehicles, and energy storage resources. These dynamics require rapid and efficient solutions to the Unit Commitment (UC) problem, which classical computing may struggle. Quantum Computing (QC) offers a promising alternative by exploiting qubits’ exponential information capacity to accelerate large-scale optimization. This paper presents a novel integrated QC-based approach to solve UC through synergistic integration of Quantum Feasibility Labeling (QFL), Variational Quantum Search (VQS), and Quantum Global Minimum Finder (QGMF). It enhances feasible-state identification and global optimum discovery, addressing the limitations of existing algorithms such as the Quantum Approximate Optimization Algorithm. Two illustrative UC case studies are used to demonstrate the approach. Results indicate that the combined QFL-VQS-QGMF framework can identify the optimal UC solution accurately. This work highlights the potential of hybrid quantum–classical optimization as a foundational step toward scalable quantum solutions for future grid operations.
The K-SAT problem is a fundamental challenge in computational theory, widely used in artificial intelligence, cryptography, and optimization. Classical algorithms struggle with exponential time complexity, making them inefficient for large-scale instances. In this research, we propose an efficient quantum computing approach based on Grover’s algorithm to enhance the search process for satisfiable solutions in K-SAT problems. Our implementation leverages quantum superposition and amplitude amplification to explore multiple possible solutions simultaneously, reducing the search complexity from O (2ⁿ) in classical methods to O(√2ⁿ) in quantum computing. We design a quantum oracle that encodes the K-SAT clauses and integrates it into Grover’s iterative search framework. The performance is evaluated through Qiskit simulations, demonstrating a significant improvement in search efficiency compared to classical brute-force techniques. The results highlight the potential of quantum algorithms in solving complex combinatorial problems with enhanced speed and accuracy. This study contributes to the development of quantum-accelerated optimization methods, paving the way for real-world applications in machine learning, cryptanalysis, and large-scale data processing.
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.