Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 51 min ago
PreprintCC BY-NC-ND 4.0arXiv

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

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).

Related

  1. Periodic Symmetry-Adapted Encoding: Qubit Reduction in Crystalline Electronic Structure
    Dario Picozzi
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  2. Scalable simulation of non-Markovian quantum transport by stochastic-phase bath reduction
    Zhen Huang, Lin Lin, Pinchen Xie
    arXivPreprintarXiv licenceFull textCondensed matterQuantum physics & quantum informationarXiv
  3. Classical Commitment over Quantum Channels with Limited Entanglement Assistance
    Remi A. Chou
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  4. On Revolutionizing Power Systems: Suitability of Quantum Computing-Ready Pipelines for Stochastic Unit Commitment Optimization
    Ying-Yi Hong, Dylan Josh Domingo Lopez
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  5. A Backend-Agnostic MWIS Kernel for Stochastic Unit Commitment with Neutral-Atom Hardware Validation
    Jiying Chen, Min Lin, Jingwei Wen +2
    arXivPreprintCC BY 4.0Full textOptimisation & controlQuantum physics & quantum informationarXiv
BibTeX
@misc{carrillomunoz2026towards,
  title = {{Towards Scalable Quantum Unit Commitment in Power Systems: Encoding and Complexity Reduction Techniques}},
  author = {Marc Carrillo-MuÑoz and Sergio MartÍnez-Hermida and Sara Barja-MartÍnez and Antonio E. SaldaÑa GonzÁlez and MÒnica AragÜÉs-PeÑalba},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.36999},
  eprint = {2609.36999},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.36999},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Towards Scalable Quantum Unit Commitment in Power Systems: Encoding and Complexity Reduction Techniques
AU  - Marc Carrillo-MuÑoz
AU  - Sergio MartÍnez-Hermida
AU  - Sara Barja-MartÍnez
AU  - Antonio E. SaldaÑa GonzÁlez
AU  - MÒnica AragÜÉs-PeÑalba
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2609.36999
UR  - https://arxiv.org/abs/2609.36999
AB  - 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).
ER  -