analiza aiqbench
This survey examines how quantum computing paradigms, including annealing and variational algorithms, can address scalability bottlenecks in power system unit commitment problems. By categorizing existing research on hybrid classical-quantum approaches, the paper highlights current hardware limitations and potential pathways for optimizing electricity market scheduling with large-scale systems.
A Survey on Applications of Quantum Computing for Unit Commitment
arXiv:2601.01777v2 Announce Type: replace Abstract: 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.
Abstract: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.
Quantum Physics (quant-ph); Systems and Control (eess.SY)
arXiv:2601.01777 [quant-ph]
(or arXiv:2601.01777v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2601.01777 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 250 cuvinte
Subiecte conexe

Digital States 2026: AI Moves From Experiment to Infrastructure
govtech.com · 24 sept. 2026

Nations at the Quantum Table
The Quantum Insider · 24 aug. 2026

UK, Japan Expand Quantum Partnership With Focus on Commercial Deployment
The Quantum Insider · 15 iun. 2026

How To Prepare For Quantum Computing, The Complete Readiness Guide
Quantum Zeitgeist · 31 iul. 2026