Metraipolis › archive › dc_aae3e4fc9949
On Revolutionizing Power Systems: Suitability of Quantum Computing-Ready Pipelines for Stochastic Unit Commitment Optimization — arXiv:2611.05030
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05030
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T13:02:30.051Z
- SHA-256 of the archived text
3edf294759e640acbcc99d9379fe99fea2aa974f96c9071a069564e54b3b4598- Stable URL of this page
https://metraipolis.com/documento/dc_aae3e4fc9949
How to cite
On Revolutionizing Power Systems: Suitability of Quantum Computing-Ready Pipelines for Stochastic Unit Commitment Optimization — arXiv:2611.05030 — arXiv (en), https://arxiv.org/abs/2611.05030 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aae3e4fc9949 (Metraipolis archive dc_aae3e4fc9949, sha256 3edf294759e640acbcc99d9379fe99fea2aa974f96c9071a069564e54b3b4598)
BibTeX
@misc{dcaae3e4fc9949,
title = {On Revolutionizing Power Systems: Suitability of Quantum Computing-Ready Pipelines for Stochastic Unit Commitment Optimization — arXiv:2611.05030},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05030},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aae3e4fc9949; sha256 3edf294759e640acbcc99d9379fe99fea2aa974f96c9071a069564e54b3b4598},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05030. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno). Categorie arXiv: Quantum Physics (quant-ph) ; Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2611.05030 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-04T12:36:48.058Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).