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 International Symposium on the Application of Artificial Intelligence in Electrical Engineering (AAIEE)

A Generalizable Variational Quantum Oracle with Angle-Embedded Load Profiles for Grover Search Based Unit Commitment

Yubin Ma, Xiaodong Zheng

Published Apr 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/aaiee69872.2026.11649868

Related papers

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

Xiaodong Zheng, Jianhui Wang, Meng Yue

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.

IEEE Transactions on Power Systems•Jan 5, 2024•22 citations

Data-driven fitting of the minimum electricity power purchase cost function to enable quantum market clearing

Xiaodong Zheng, Peile Lin, Haoyong Chen

At present, the construction of the electricity spot market is becoming increasingly sophisticated. Security constrained unit commitment (SCUC) can effectively reduce power procurement costs. However, as the system scale expands, the computational complexity of solving the SCUC problem increases significantly. This paper focuses on transforming the SCUC into a quadratic unconstrained binary optimization (QUBO) model suitable for quantum computers, with the aim of leveraging quantum computing technologies to accelerate the solution of the unit commitment problem. Based on the Benders decomposition framework, the SCUC model is decomposed to generate a set of unit commitment samples together with the corresponding optimal values of their Benders subproblems. To establish the functional relationship between unit commitment and the optimal cost (i.e., the SCUC value function) in a manner compatible with quantum computing technologies, a high-dimensional quadratic function is employed to fit the obtained unit commitment samples and their corresponding optimal cost values, based on the value function theory of mixed-integer programming. The fitted high-dimensional quadratic function is then solved using both commercial solvers and quantum computing platforms. The results indicate that the QUBO can provide high-quality suboptimal solutions to the original SCUC problem.

IET conference proceedings.•Jul 1, 2026•0 citations

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

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

Quantum Machine Learning and Grover's Algorithm for Quantum Optimization of Robotic Manipulators

Hassen Nigatu, Gaokun Shi, Jituo Li +3 more

Optimizing high-degree-of-freedom robotic manipulators requires searching complex, high-dimensional configuration spaces, a task that is computationally challenging for classical methods. This paper introduces a quantum-native framework that integrates Quantum Machine Learning (QML) with Grover's algorithm to solve kinematic optimization problems efficiently. A parameterized quantum circuit is trained to approximate the forward kinematics model, which then constructs an oracle to identify optimal configurations. Grover's algorithm leverages this oracle to provide a quadratic reduction in search complexity. Demonstrated on simulated 1-DoF, 2-DoF, and dual-arm manipulator tasks, the method achieves significant speedups-up to 93x over classical optimizers like Nelder-Mead-as problem dimensionality increases. This work establishes a foundational, quantum-native framework for robot kinematic optimization, effectively bridging quantum computing and robotics problems.

arXiv:2509.07216•IEEE Robotics and Automation Letters•Oct 31, 2025•3 citations

Learning AC Power Flow Solutions using a Data-Dependent Variational Quantum Circuit

Thinh Viet Le, Md Obaidur Rahman, Vassilis Kekatos

Interconnection studies require solving numerous instances of the AC load or power flow (AC PF) problem to simulate diverse scenarios as power systems navigate the ongoing energy transition. To expedite such studies, this work leverages recent advances in quantum computing to find or predict AC PF solutions using a variational quantum circuit (VQC). VQCs are trainable models that run on modern-day noisy intermediate-scale quantum (NISQ) hardware to accomplish elaborate optimization and machine learning (ML) tasks. Our first contribution is to pose a single instance of the AC PF as a nonlinear least-squares fit over the VQC trainable parameters (weights) and solve it using a hybrid classical/quantum computing approach. The second contribution is to feed PF specifications as features into a data-embedded VQC and train the resultant quantum ML (QML) model to predict general PF solutions. The third contribution is to develop a novel protocol to efficiently measure AC-PF quantum observables by exploiting the graph structure of a power network. Preliminary numerical tests indicate that the proposed VQC models attain enhanced prediction performance over a deep neural network despite using much fewer weights. The proposed quantum AC-PF framework sets the foundations for addressing more elaborate grid tasks via quantum computing.

arXiv:2509.03495•IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)•Sep 29, 2025•0 citations
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.
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.
At present, the construction of the electricity spot market is becoming increasingly sophisticated. Security constrained unit commitment (SCUC) can effectively reduce power procurement costs. However, as the system scale expands, the computational complexity of solving the SCUC problem increases significantly. This paper focuses on transforming the SCUC into a quadratic unconstrained binary optimization (QUBO) model suitable for quantum computers, with the aim of leveraging quantum computing technologies to accelerate the solution of the unit commitment problem. Based on the Benders decomposition framework, the SCUC model is decomposed to generate a set of unit commitment samples together with the corresponding optimal values of their Benders subproblems. To establish the functional relationship between unit commitment and the optimal cost (i.e., the SCUC value function) in a manner compatible with quantum computing technologies, a high-dimensional quadratic function is employed to fit the obtained unit commitment samples and their corresponding optimal cost values, based on the value function theory of mixed-integer programming. The fitted high-dimensional quadratic function is then solved using both commercial solvers and quantum computing platforms. The results indicate that the QUBO can provide high-quality suboptimal solutions to the original SCUC problem.
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.
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.
Optimizing high-degree-of-freedom robotic manipulators requires searching complex, high-dimensional configuration spaces, a task that is computationally challenging for classical methods. This paper introduces a quantum-native framework that integrates Quantum Machine Learning (QML) with Grover's algorithm to solve kinematic optimization problems efficiently. A parameterized quantum circuit is trained to approximate the forward kinematics model, which then constructs an oracle to identify optimal configurations. Grover's algorithm leverages this oracle to provide a quadratic reduction in search complexity. Demonstrated on simulated 1-DoF, 2-DoF, and dual-arm manipulator tasks, the method achieves significant speedups-up to 93x over classical optimizers like Nelder-Mead-as problem dimensionality increases. This work establishes a foundational, quantum-native framework for robot kinematic optimization, effectively bridging quantum computing and robotics problems.
Interconnection studies require solving numerous instances of the AC load or power flow (AC PF) problem to simulate diverse scenarios as power systems navigate the ongoing energy transition. To expedite such studies, this work leverages recent advances in quantum computing to find or predict AC PF solutions using a variational quantum circuit (VQC). VQCs are trainable models that run on modern-day noisy intermediate-scale quantum (NISQ) hardware to accomplish elaborate optimization and machine learning (ML) tasks. Our first contribution is to pose a single instance of the AC PF as a nonlinear least-squares fit over the VQC trainable parameters (weights) and solve it using a hybrid classical/quantum computing approach. The second contribution is to feed PF specifications as features into a data-embedded VQC and train the resultant quantum ML (QML) model to predict general PF solutions. The third contribution is to develop a novel protocol to efficiently measure AC-PF quantum observables by exploiting the graph structure of a power network. Preliminary numerical tests indicate that the proposed VQC models attain enhanced prediction performance over a deep neural network despite using much fewer weights. The proposed quantum AC-PF framework sets the foundations for addressing more elaborate grid tasks via quantum computing.