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:2609.36999

Towards Scalable Quantum Unit Commitment in Power Systems: Encoding and Complexity Reduction Techniques

Marc Carrillo-MuÑoz, Sergio MartÍnez-Hermida, Sara Barja-MartÍnez, Antonio E. SaldaÑa GonzÁlez, MÒnica AragÜÉs-PeÑalba

quant-pheess.SYSubmitted Sep 29, 2026• Announced Sep 30, 2026• 0 citations
arXivHTMLPDF

Abstract

This paper develops a Quantum optimisation Unit Commitment (UC) framework that benefits from Pauli Correlation Encoding (PCE) as a qubit reduction preprocessing technique and Sample-based Quantum Diagonalisation (SQD) as a hybrid post-processing refinement method. The UC problem is formulated in binary form, then transformed into a QUBO problem and mapped onto an Ising representation suitable for adiabatic quantum evolution within the Qibo framework. This study analyses how PCE and SQD techniques affect qubit scalability, computational effort, feasibility, and probability of recovering the optimal solution as the number of generators increases. The results show that PCE reduces the effective size of the encoded problem, SQD improves the concentration of probability on feasible and optimal solutions, and their combined application provides the best overall behaviour in several scalable case studies, achieving more reliable solutions with lower effective computational cost than the unreduced formulation. The repository is available open source in Github (link is not yet available until work is published. However, if requested by the reviewers, we can make it open for a scific time window, if requested).

AI Summary

The paper asks whether qubit compression and sample-based post-processing can improve a quantum-optimisation workflow for unit commitment. It studies a simplified, single-period model: minimise generator commitment costs subject to an exact demand-balance constraint, with fixed power per active generator. The binary problem is mapped to a penalty QUBO and an Ising Hamiltonian. The workflow combines Pauli Correlation Encoding (PCE), simulated adiabatic evolution in Qibo, and optional Sample-based Quantum Diagonalisation (SQD). PCE replaces logical $Z_i$ operators with products of reduced-register $Z$ operators, restricting the representable schedules and potentially increasing interaction order. Encodings are selected using cost-weighted coverage of known feasible configurations. Penalty calibration also uses the optimal feasible cost. SQD retains frequently sampled bitstrings and diagonalises a projected auxiliary Hamiltonian; the reported setting, $\beta=1$, makes this Hamiltonian diagonal, selecting minimum-energy retained configurations. Numerical tests cover constructed instances with $N=4$–$20$ generators; unreduced comparisons stop at $N=12$. Selected PCE encodings reduce qubit counts by $40\%$–$60\%$, with optimal-solution probabilities of $0.343$–$0.906$. At $N=20$, ten qubits retain two of 28 feasible schedules and yield optimal probability $0.906$. SQD raises reported feasible and optimal probabilities to one in every tested direct and compressed case, with overhead below $0.02$ seconds for direct cases. The stated limitations are classical-emulator resource constraints, instance-dependent compression performance, and the simplified operational model. Hardware resource benefits, sensitivity to feasible-space structure, and extensions to multi-period and more realistic generator constraints remain for future study.

Likely largely AI-generatedOverclaimsSmall numerics onlyMissing comparisonStrong assumptions

Central claim may not hold: The claimed scalability is not established end to end because penalty calibration uses the optimal feasible cost and PCE selection uses cost-weighted feasible configurations without a demonstrated scalable method for obtaining that information. All reported SQD runs use beta=1, making post-processing equivalent to minimum-energy selection among retained samples, so unit output optimal probability is conditional on already retaining an optimum and demonstrates no advantage over ordinary best-sample selection. Table 2 reports eight retained states for both N=4 and N=5, although the stated rho_SQD=1/8 subspace-size rule permits at most two and four states, respectively. Selected PCE runs are slower than direct evolution at N=10 and N=12, and the reported timing does not establish the full cost of testing and selecting reduced dimensions.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

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

Qubit-Efficient Variational Quantum Optimization via Pauli Correlation Encoding: Application to Large-Scale Power Demand Portfolio Optimization

Takuya Yoshioka, Keita Sasada, Riku Usuki +2 more

Variational quantum algorithms offer a promising route to combinatorial optimization, but their applicability is limited by the challenge of encoding large-scale problems within restricted qubit resources. In this work, we introduce a qubit-efficient variational framework based on Pauli correlation encoding (PCE) and apply it to electric power demand portfolio optimization. Binary variables are represented through expectation values of Pauli correlation operators, which encode multi-body correlations of the quantum state and provide a continuous relaxation enabling compact representations with few qubits. We further propose a two-stage hybrid formulation, in which a time-averaged problem provides initialization for a time-resolved optimization. Numerical simulations demonstrate near-optimal performance across problem sizes ranging from $m=18$ to $10{,}296$, with normalized cost gaps on the order of $10^{-4}$ relative to solutions with certified optimality. We show that the performance is governed by the interplay between continuous relaxation and discretization: the effective resolution of the correlator representation determines how reliably improvements in the continuous loss translate into better discrete solutions, with larger systems exhibiting more consistent behavior. Finally, we demonstrate robustness on a trapped-ion quantum processor, where high-quality solutions are obtained despite noise and finite sampling. These results establish PCE as a physically motivated and qubit-efficient framework for large-scale combinatorial optimization.

quant-pharXiv:2607.24722•Physical Review Applied•Jul 28, 2026•2 citations

Quantum-Compatible Unit Commitment Modeling through Logarithmic Discretization

Tyler Christeson, Amin Khodaei, Rozhin Eskandarpour

The unit commitment (UC) problem is essential to operating the power system in an efficient and reliable manner. However, modern power systems are growing increasingly complex with the growing penetration of distributed energy resources, making classical approaches to the UC problem computationally inefficient. Quantum computing approaches have been investigated for the UC problem due to the potential to outperform classical solutions. In many quantum models, including quadratic unconstrained binary optimization, or QUBO, the problem must be reformulated by discretizing continuous variables into "bins" or "segments" to ensure compatibility with the quantum processing unit (QPU). This would increase the number of variables due to discretization and lead to sub-optimal solutions. In this paper, we propose a new reformulation strategy for converting optimization problems into QPU-compatible binary quadratic models while creating significantly fewer binary variables, resulting in faster computation, increased efficiency, and further scalability. The performance of this approach is examined in terms of computation time and solution optimality to demonstrate its advantages and to illustrate the potential capability to solve the UC problem more efficiently than classical solutions.

IEEE PES Innovative Smart Grid Technologies Europe•Oct 14, 2024•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 paper 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 hours, 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.

quant-pharXiv:2611.05030•IEEE Transactions on Industrial Informatics•Nov 4, 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

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
This paper develops a Quantum optimisation Unit Commitment (UC) framework that benefits from Pauli Correlation Encoding (PCE) as a qubit reduction preprocessing technique and Sample-based Quantum Diagonalisation (SQD) as a hybrid post-processing refinement method. The UC problem is formulated in binary form, then transformed into a QUBO problem and mapped onto an Ising representation suitable for adiabatic quantum evolution within the Qibo framework. This study analyses how PCE and SQD techniques affect qubit scalability, computational effort, feasibility, and probability of recovering the optimal solution as the number of generators increases. The results show that PCE reduces the effective size of the encoded problem, SQD improves the concentration of probability on feasible and optimal solutions, and their combined application provides the best overall behaviour in several scalable case studies, achieving more reliable solutions with lower effective computational cost than the unreduced formulation. The repository is available open source in Github (link is not yet available until work is published. However, if requested by the reviewers, we can make it open for a scific time window, if requested).
The paper asks whether qubit compression and sample-based post-processing can improve a quantum-optimisation workflow for unit commitment. It studies a simplified, single-period model: minimise generator commitment costs subject to an exact demand-balance constraint, with fixed power per active generator. The binary problem is mapped to a penalty QUBO and an Ising Hamiltonian.
The workflow combines Pauli Correlation Encoding (PCE), simulated adiabatic evolution in Qibo, and optional Sample-based Quantum Diagonalisation (SQD). PCE replaces logical ZiZ_iZi​ operators with products of reduced-register ZZZ operators, restricting the representable schedules and potentially increasing interaction order. Encodings are selected using cost-weighted coverage of known feasible configurations. Penalty calibration also uses the optimal feasible cost. SQD retains frequently sampled bitstrings and diagonalises a projected auxiliary Hamiltonian; the reported setting, β=1\beta=1β=1, makes this Hamiltonian diagonal, selecting minimum-energy retained configurations.
Numerical tests cover constructed instances with N=4N=4N=4–202020 generators; unreduced comparisons stop at N=12N=12N=12. Selected PCE encodings reduce qubit counts by 40%40\%40%–60%60\%60%, with optimal-solution probabilities of 0.3430.3430.343–0.9060.9060.906. At N=20N=20N=20, ten qubits retain two of 28 feasible schedules and yield optimal probability 0.9060.9060.906. SQD raises reported feasible and optimal probabilities to one in every tested direct and compressed case, with overhead below 0.020.020.02 seconds for direct cases.
The stated limitations are classical-emulator resource constraints, instance-dependent compression performance, and the simplified operational model. Hardware resource benefits, sensitivity to feasible-space structure, and extensions to multi-period and more realistic generator constraints remain for future study.
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.
Variational quantum algorithms offer a promising route to combinatorial optimization, but their applicability is limited by the challenge of encoding large-scale problems within restricted qubit resources. In this work, we introduce a qubit-efficient variational framework based on Pauli correlation encoding (PCE) and apply it to electric power demand portfolio optimization. Binary variables are represented through expectation values of Pauli correlation operators, which encode multi-body correlations of the quantum state and provide a continuous relaxation enabling compact representations with few qubits. We further propose a two-stage hybrid formulation, in which a time-averaged problem provides initialization for a time-resolved optimization. Numerical simulations demonstrate near-optimal performance across problem sizes ranging from m=18m=18m=18 to 10,29610{,}29610,296, with normalized cost gaps on the order of 10−410^{-4}10−4 relative to solutions with certified optimality. We show that the performance is governed by the interplay between continuous relaxation and discretization: the effective resolution of the correlator representation determines how reliably improvements in the continuous loss translate into better discrete solutions, with larger systems exhibiting more consistent behavior. Finally, we demonstrate robustness on a trapped-ion quantum processor, where high-quality solutions are obtained despite noise and finite sampling. These results establish PCE as a physically motivated and qubit-efficient framework for large-scale combinatorial optimization.
The unit commitment (UC) problem is essential to operating the power system in an efficient and reliable manner. However, modern power systems are growing increasingly complex with the growing penetration of distributed energy resources, making classical approaches to the UC problem computationally inefficient. Quantum computing approaches have been investigated for the UC problem due to the potential to outperform classical solutions. In many quantum models, including quadratic unconstrained binary optimization, or QUBO, the problem must be reformulated by discretizing continuous variables into "bins" or "segments" to ensure compatibility with the quantum processing unit (QPU). This would increase the number of variables due to discretization and lead to sub-optimal solutions. In this paper, we propose a new reformulation strategy for converting optimization problems into QPU-compatible binary quadratic models while creating significantly fewer binary variables, resulting in faster computation, increased efficiency, and further scalability. The performance of this approach is examined in terms of computation time and solution optimality to demonstrate its advantages and to illustrate the potential capability to solve the UC problem more efficiently than classical solutions.
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 paper 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 hours, 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.
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.